Signed Lozenge Tilings

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.

[1]  R. Stanley.  The number of faces of a simplicial convex polytope , 1980 .

[2]  Richard Kenyon,et al.  Lectures on Dimers , 2009, 0910.3129.

[3]  Cesar Ceballos,et al.  Acyclic Systems of Permutations and Fine Mixed Subdivisions of Simplices , 2013, Discret. Comput. Geom..

[4]  Christian Krattenthaler,et al.  The major counting of nonintersecting lattice paths and generating functions for tableaux , 1995 .

[5]  Ilse Fischer.  Enumeration of Rhombus Tilings of a Hexagon which Contain a Fixed Rhombus in the Centre , 2001, J. Comb. Theory, Ser. A.

[6]  David Cook,et al.  The weak Lefschetz property for monomial ideals of small type , 2015, 1507.03853.

[7]  Federico Ardila,et al.  Flag arrangements and triangulations of products of simplices , 2006 .

[8]  Ira M. Gessel,et al.  Determinants, Paths, and Plane Partitions , 1989 .

[9]  Gaku Liu,et al.  Trivariate monomial complete intersections and plane partitions , 2010 .

[10]  Charalambos A. Charalambides,et al.  Enumerative combinatorics , 2018, SIGA.

[11]  Mihai Ciucu,et al.  Enumeration of Perfect Matchings in Graphs with Reflective Symmetry , 1997, J. Comb. Theory, Ser. A.

[12]  Greg Kuperberg.  Symmetries of Plane Partitions and the Permanent - Determinant Method , 1994, J. Comb. Theory, Ser. A.

[13]  Richard P. Stanley,et al.  Weyl Groups, the Hard Lefschetz Theorem, and the Sperner Property , 1980, SIAM J. Algebraic Discret. Methods.

[14]  W. Thurston.  Conway's tiling groups , 1990 .

[15]  Mihai Ciucu.  A Random Tiling Model for Two Dimensional Electrostatics , 2003 .

[16]  Markus Fulmek.  NONINTERSECTING LATTICE PATHS ON THE CYLINDER , 2003, math/0311331.

[17]  J. Propp.  Enumeration of Matchings: problems and Progress , 1999, math/9904150.

[18]  B. Lindström.  On the Vector Representations of Induced Matroids , 1973 .

[19]  T. Harima,et al.  The Weak and Strong Lefschetz properties for Artinian K-algebras , 2002, math/0208201.

[20]  Mihai Ciucu,et al.  Enumeration of Lozenge Tilings of Hexagons with a Central Triangular Hole , 2001, J. Comb. Theory, Ser. A.

[21]  I. Gessel,et al.  Binomial Determinants, Paths, and Hook Length Formulae , 1985 .