It is well-known that plane partitions, lozenge tilings of a hexagon, perfect matchings on a honeycomb graph, and families of non-intersecting lattice paths in a hexagon are all in bijection. In this work we consider regions that are more general than hexagons. They are obtained by further removing upward-pointing triangles. We call the resulting shapes triangular regions. We establish signed versions of the latter three bijections for triangular regions. We first investigate the tileability of triangular regions by lozenges. Then we use perfect matchings and families of non-intersecting lattice paths to define two signs of a lozenge tiling. Using a new method that we call resolution of a puncture, we show that the two signs are in fact equivalent. As a consequence, we obtain the equality of determinants, up to sign, that enumerate signed perfect matchings and signed families of lattice paths of a triangular region, respectively. We also describe triangular regions, for which the signed enumerations agree with the unsigned enumerations.

Document Type


Publication Date


Notes/Citation Information

Published in The Electronic Journal of Combinatorics, v. 24, issue 1, paper #P1.9, p. 1-27.

The publisher has granted the permission for posting the article here.

Funding Information

D. Cook II partially supported by NSA grant H98230-09-1-0032. Uwe Nagel partially supported by NSA grants H98230-09-1-0032 and H98230-12-1-0247 and by Simons Foundation grants #208869 and #317096.

Included in

Mathematics Commons