We present a combinatorial solution to the problem of determining the number of lozenge tilings of a hexagon with sides a, b+1, b, a+1, b, b+1, with the central unit triangle removed. For a=b, this settles an open problem posed by Propp [7].
Enumeration of hybrid domino–lozenge tilings
✍ Scribed by Lai, Tri
- Book ID
- 122231797
- Publisher
- Elsevier Science
- Year
- 2014
- Tongue
- English
- Weight
- 694 KB
- Volume
- 122
- Category
- Article
- ISSN
- 0097-3165
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Motivated by the enumeration of a class of plane partitions studied by Proctor and by considerations about symmetry classes of plane partitions, we consider the problem of enumerating lozenge tilings of a hexagon with ''maximal staircases'' removed from some of its vertices. The case of one vertex c
We deal with unweighted and weighted enumerations of lozenge tilings of a hexagon with side lengths a, b+m, c, a+m, b, c+m, where an equilateral triangle of side length m has been removed from the center. We give closed formulas for the plain enumeration and for a certain (&1)-enumeration of these l
Propp conjectured that the number of lozenge tilings of a semiregular hexagon of sides 2n&1, 2n&1, and 2n which contain the central unit rhombus is precisely one third of the total number of lozenge tilings. Motivated by this, we consider the more general situation of a semiregular hexagon of sides
We want to present a new way of challenging the classical and still unsolved problem of the reconstruction of a domino tiling from its horizontal and vertical projections. We introduce the concept of degree of a domino tiling, i.e. we divide a domino tiling into strips-like sub-tilings and we consid