Off-diagonally symmetric domino tilings of the Aztec diamond of odd order
Abstract: We study the enumeration of off-diagonally symmetric domino tilings of odd-order Aztec diamonds in two directions: (1) with one boundary defect, and (2) with maximally-many zeroes on the diagonal. In the first direction, we prove a symmetry property which states that the numbers of off-diagonally symmetric domino tilings of the Aztec diamond of order $2n-1$ are equal when the boundary defect is at the $k$th position and the $(2n-k)$th position on the boundary, respectively. This symmetry property proves a special case of a recent conjecture by Behrend, Fischer, and Koutschan. In the second direction, a Pfaffian formula is obtained for the number of "nearly" off-diagonally symmetric domino tilings of odd-order Aztec diamonds, where the entries of the Pfaffian satisfy a simple recurrence relation. The numbers of domino tilings mentioned in the above two directions do not seem to have a simple product formula, but we show that these numbers satisfy simple matrix equations in which the entries of the matrix are given by Delannoy numbers. The proof of these results involves the method of non-intersecting lattice paths and a modification of Stembridge's Pfaffian formula for families of non-intersecting lattice paths. Finally, we propose conjectures concerning the log-concavity and asymptotic behavior of the number of off-diagonally symmetric domino tilings of odd-order Aztec diamonds.
- Why Delannoy numbers? J. Statist. Plann. Inference, 135(1):40–54, 2005.
- Diagonally symmetric alternating sign matrices, 2023. https://arxiv.org/abs/2309.08446.
- Frédéric Bosio and Marc A. A. van Leeuwen. A bijection proving the Aztec diamond theorem by combing lattice paths. Electron. J. Combin., 20(4):Paper 24, 30, 2013.
- M. Ciucu and C. Krattenthaler. The interaction of a gap with a free boundary in a two dimensional dimer system. Comm. Math. Phys., 302(1):253–289, 2011.
- Mihai Ciucu. Perfect matchings of cellular graphs. J. Algebraic Combin., 5(2):87–103, 1996.
- Mihai Ciucu. Enumeration of perfect matchings in graphs with reflective symmetry. J. Combin. Theory Ser. A, 77(1):67–97, 1997.
- Alternating-sign matrices and domino tilings. I. J. Algebraic Combin., 1(2):111–132, 1992.
- Alternating-sign matrices and domino tilings. II. J. Algebraic Combin., 1(3):219–234, 1992.
- A simple proof of the Aztec diamond theorem. Electron. J. Combin., 12:Research Paper 18, 8, 2005.
- Binomial determinants, paths, and hook length formulae. Adv. in Math., 58(3):300–321, 1985.
- Applications of minor summation formula. III. Plücker relations, lattice paths and Pfaffian identities. J. Combin. Theory Ser. A, 113(1):113–155, 2006.
- C. Krattenthaler. Plane partitions in the work of Richard Stanley and his school. In The mathematical legacy of Richard P. Stanley, pages 231–261. Amer. Math. Soc., Providence, RI, 2016.
- Greg Kuperberg. Symmetry classes of alternating-sign matrices under one roof. Ann. of Math. (2), 156(3):835–866, 2002.
- Tri Lai. Generating function of the tilings of an Aztec rectangle with holes. Graphs Combin., 32(3):1039–1054, 2016.
- Yi-Lin Lee. Off-diagonally symmetric domino tilings of the Aztec diamond. Electron. J. Combin., 30(4):Paper No. 4.20, 30, 2023.
- Bernt Lindström. On the vector representations of induced matroids. Bull. London Math. Soc., 5:85–90, 1973.
- Markov chain algorithms for planar lattice structures. SIAM J. Comput., 31(1):167–192, 2001.
- OEIS Foundation Inc. The On-Line Encyclopedia of Integer Sequences, 2024. Published electronically at http://oeis.org.
- James Propp. Tilings. In Handbook of enumerative combinatorics, Discrete Math. Appl. (Boca Raton), pages 541–588. CRC Press, Boca Raton, FL, 2015.
- Richard P. Stanley. Enumerative combinatorics. Vol. 2, volume 62 of Cambridge Studies in Advanced Mathematics. Cambridge University Press, Cambridge, 1999. With a foreword by Gian-Carlo Rota and appendix 1 by Sergey Fomin.
- John R. Stembridge. Nonintersecting paths, Pfaffians, and plane partitions. Adv. Math., 83(1):96–131, 1990.
- Bo-Yin Yang. Two enumeration problems about the Aztec diamonds. ProQuest LLC, Ann Arbor, MI, 1991. Thesis (Ph.D.)–Massachusetts Institute of Technology.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.