Proof of two conjectures of Ciucu and Krattenthaler on the enumeration of lozenge tilings of hexagons with cut off corners
From MaRDI portal
Publication:2347883
DOI10.1016/j.jcta.2015.02.008zbMath1315.05076arXiv1309.4640OpenAlexW2035895892WikidataQ59196573 ScholiaQ59196573MaRDI QIDQ2347883
Publication date: 10 June 2015
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1309.4640
Enumeration in graph theory (05C30) Combinatorial aspects of tessellation and tiling problems (05B45) Tilings in (2) dimensions (aspects of discrete geometry) (52C20)
Related Items (14)
A \(q\)-enumeration of lozenge tilings of a hexagon with four adjacent triangles removed from the boundary ⋮ Proof of a conjecture of Kenyon and Wilson on semicontiguous minors ⋮ A \(q\)-enumeration of lozenge tilings of a hexagon with three dents ⋮ Enumeration of Lozenge tilings of halved hexagons with a boundary defect ⋮ Beyond Aztec castles: toric cascades in the \(dP_3\) quiver ⋮ Selberg integrals, Askey-Wilson polynomials and lozenge tilings of a hexagon with a triangular hole ⋮ Dungeons and dragons: combinatorics for the \(dP_3\) quiver ⋮ Symmetries of shamrocks. I. ⋮ Symmetries of shamrocks IV: The self-complementary case ⋮ Binomial determinants for tiling problems yield to the holonomic ansatz ⋮ Proof of a refinement of Blum's conjecture on hexagonal dungeons ⋮ Three interactions of holes in two dimensional dimer systems ⋮ Lozenge tilings of hexagons with holes on three crossing lines ⋮ A generalization of Kuo condensation
Cites Work
- Unnamed Item
- Applications of graphical condensation for enumerating matchings and tilings
- Lozenge tilings of hexagons with arbitrary dents
- Binomial determinants, paths, and hook length formulae
- Odd symplectic groups
- Plane partitions. III: The weak Macdonald conjecture
- Alternating-sign matrices and domino tilings. I
- The shape of a typical boxed plane partition
- Symmetries of plane partitions and the permanent-determinant method
- Graphical condensation for enumerating perfect matchings
- Nonintersecting paths, pfaffians, and plane partitions
- Enumeration of Lozenge tilings of hexagons with cut-off corners
- Proof of Blum's conjecture on hexagonal dungeons
- A triangular gap of side 2 in a sea of dimers in a 60° angle
- A dual of MacMahon’s theorem on plane partitions
- Ordered structures and partitions
- On the Vector Representations of Induced Matroids
- Enumeration of perfect matchings in graphs with reflective symmetry
This page was built for publication: Proof of two conjectures of Ciucu and Krattenthaler on the enumeration of lozenge tilings of hexagons with cut off corners