| Popis: |
In this paper, we apply the state sum decomposition method to derive a closed formula for the enumeration of lozenge tilings of the region constructed out of a regular hexagon by removing the "maximal staircase" from its alternating corners. This problem, originally proposed by Ciucu and Krattenthaler (2002), has remained unsolved. We introduce the concept of "$Fibonacci-Coloring$" for planar graphs and derive a summation formula of the enumeration in terms of powers of $2$. This formula is reminiscent of the celebrated Aztec Diamond Theorem of Elkies, Kuperberg, Larsen, and Propp (1992), which concerns domino tilings of Aztec Diamonds. |
