Proof of a refinement of Blum's conjecture on hexagonal dungeons
From MaRDI portal
(Redirected from Publication:526252)
Abstract: Matt Blum conjectured that the number of tilings of a hexagonal dungeon with side-lengths (for ) equals . Ciucu and the author of the present paper proved the conjecture by using Kuo's graphical condensation method. In this paper, we investigate a 3-parameter refinement of the conjecture and its application to enumeration of tilings of several new types of the hexagonal dungeons.
Recommendations
- Proof of Blum's conjecture on hexagonal dungeons
- Proof of two conjectures of Ciucu and Krattenthaler on the enumeration of lozenge tilings of hexagons with cut off corners
- A new proof for the number of Lozenge tilings of quartered hexagons
- Rhombus tilings of a hexagon with three fixed border tiles
- New aspects of regions whose tilings are enumerated by perfect powers
Cites work
- scientific article; zbMATH DE number 1405497 (Why is no real title available?)
- A q-enumeration of lozenge tilings of a hexagon with three dents
- A dual of MacMahon's theorem on plane partitions
- A generalization of Aztec dragons
- A generalization of Kuo condensation
- A new proof for the number of Lozenge tilings of quartered hexagons
- Alternating-sign matrices and domino tilings. I
- Alternating-sign matrices and domino tilings. II
- Applications of graphical condensation for enumerating matchings and tilings
- Aztec castles and the dP3 quiver
- Enumeration of Lozenge tilings of halved hexagons with a boundary defect
- Enumeration of hybrid domino-lozenge tilings
- Enumeration of tilings of a hexagon with a maximal staircase and a unit triangle removed
- Graphical condensation for enumerating perfect matchings
- Graphical condensation of plane graphs: a combinatorial approach
- Graphical condensation, overlapping Pfaffians and superpositions of matchings
- Lozenge tilings of hexagons with arbitrary dents
- Perfect matchings and perfect powers
- Perfect matchings and the octahedron recurrence
- Proof of Blum's conjecture on hexagonal dungeons
- Proof of two conjectures of Ciucu and Krattenthaler on the enumeration of lozenge tilings of hexagons with cut off corners
- The space of circular planar electrical networks
Cited in
(3)
This page was built for publication: Proof of a refinement of Blum's conjecture on hexagonal dungeons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q526252)