Enumeration of Lozenge tilings of hexagons with cut-off corners
From MaRDI portal
Publication:1865392
DOI10.1006/jcta.2002.3288zbMath1015.05006arXivmath/0104058MaRDI QIDQ1865392
Mihai Ciucu, Christian Krattenthaler
Publication date: 26 March 2003
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0104058
05A15: Exact enumeration problems, generating functions
05B45: Combinatorial aspects of tessellation and tiling problems
52C20: Tilings in (2) dimensions (aspects of discrete geometry)
Related Items
Perfect matchings and perfect powers, A non-automatic (!) application of Gosper's algorithm evaluates a determinant from tiling enumeration, The number of rhombus tilings of a symmetric hexagon which contain a fixed rhombus on the symmetry axis. II, Proof of two conjectures of Zuber on fully packed loop configurations, Loops, matchings and alternating-sign matrices, Determinant formulae for some tiling problems and application to fully packed loops., Advanced determinant calculus: a complement
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The story of 1,2,7,42,429,7436,..
- Binomial determinants, paths, and hook length formulae
- q-Catalan numbers
- Symmetries of plane partitions
- Odd symplectic groups
- Generating functions for shifted plane partitions
- Enumeration of lozenge tilings of punctured hexagons
- The number of rhombus tilings of a symmetric hexagon which contain a fixed rhombus on the symmetry axis. I
- The number of centered lozenge tilings of a symmetric hexagon
- Advanced determinant calculus
- Rhombus tilings of a hexagon with two triangles missing on the symmetry axis
- Symmetries of plane partitions and the permanent-determinant method
- Determinant identities and a generalization of the number of totally symmetric self-complementary plane partitions
- Some \(q\)-analogues of determinant identities which arose in plane partition enumeration
- A non-automatic (!) application of Gosper's algorithm evaluates a determinant from tiling enumeration
- Nonintersecting paths, pfaffians, and plane partitions
- Two element lattice permutation numbers and their \(q\)-generalization
- Vicious walkers, friendly walkers and Young tableaux: II. With a wall
- The statistics of dimers on a lattice
- The Problem of the Calissons
- Decision procedure for indefinite hypergeometric summation
- On the Vector Representations of Induced Matroids
- Scaling analysis for the adsorption transition in a watermelon network of \(n\) directed non-intersecting walks
- Enumeration of perfect matchings in graphs with reflective symmetry
