The number of centered lozenge tilings of a symmetric hexagon

DOI10.1006/jcta.1998.2918zbMath0915.05038arXivmath/9712209OpenAlexW2077004953MaRDI QIDQ1284471

Mihai Ciucu, Christian Krattenthaler

Publication date: 18 May 1999

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/9712209

zbMATH Keywords

tilingslattice pathsdeterminantal formula

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial aspects of tessellation and tiling problems (05B45)

Related Items

Tiling enumeration of hexagons with off-central holes, Lozenge tilings of hexagons with removed core and satellites, The interaction of a gap with a free boundary in a two dimensional dimer system, A factorization theorem for lozenge tilings of a hexagon with triangular holes, A non-automatic (!) application of Gosper's algorithm evaluates a determinant from tiling enumeration, Enumeration of rhombus tilings of a hexagon which contain a fixed rhombus in the centre, Lozenge tilings of hexagons with central holes and dents, The number of rhombus tilings of a symmetric hexagon which contain a fixed rhombus on the symmetry axis. I, The number of rhombus tilings of a symmetric hexagon which contain a fixed rhombus on the symmetry axis. II, Fourier transform on high-dimensional unitary groups with applications to random tilings, Lozenge tilings of a hexagon with a horizontal intrusion, Advanced determinant calculus: a complement, Enumeration of Lozenge tilings of hexagons with cut-off corners

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A fast algorithm for proving terminating hypergeometric identities
• Binomial determinants, paths, and hook length formulae
• The method of creative telescoping
• Enumeration of tilings of diamonds and hexagons with defects
• Determinant identities and a generalization of the number of totally symmetric self-complementary plane partitions
• Proof of a determinant evaluation conjectured by Bombieri, Hunt and van Poorten
• Nonintersecting paths, pfaffians, and plane partitions
• Summations for basic hypergeometric series involving a \(q\)-analogue of the digamma function
• A \textit{Mathematica} version of Zeilberger's algorithm for proving binomial coefficient identities
• Generating functions for plane partitions of a given shape
• The Problem of the Calissons
• Enumeration of perfect matchings in graphs with reflective symmetry