Proof of a refinement of Blum's conjecture on hexagonal dungeons

DOI10.1016/J.DISC.2017.03.003zbMATH Open1361.05102arXiv1403.4481OpenAlexW2276524914WikidataQ123344528 ScholiaQ123344528MaRDI QIDQ526252FDOQ526252

Tri Lai

Publication date: 10 May 2017

Published in: Discrete Mathematics (Search for Journal in Brave)

Abstract: Matt Blum conjectured that the number of tilings of a hexagonal dungeon with side-lengths $a,2a,b,a,2a,b$ (for $bgeq2a$) equals $13^{2a^2}14^{lfloor{a}^2/2floor}$. 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.

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

zbMATH Keywords

perfect matchingstilingsgraphical condensationAztec dungeonhexagonal dungeon

Mathematics Subject Classification ID

Combinatorial aspects of tessellation and tiling problems (05B45) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Title not available (Why is that?)
• Alternating-sign matrices and domino tilings. I
• Enumeration of hybrid domino-lozenge tilings
• Alternating-sign matrices and domino tilings. II
• Applications of graphical condensation for enumerating matchings and tilings
• Perfect matchings and perfect powers
• Graphical condensation, overlapping Pfaffians and superpositions of matchings
• Graphical condensation for enumerating perfect matchings
• Proof of two conjectures of Ciucu and Krattenthaler on the enumeration of lozenge tilings of hexagons with cut off corners
• A generalization of Kuo condensation
• A new proof for the number of Lozenge tilings of quartered hexagons
• Proof of Blum's conjecture on hexagonal dungeons
• Enumeration of tilings of a hexagon with a maximal staircase and a unit triangle removed
• Aztec castles and the dP3 quiver
• A \(q\)-enumeration of lozenge tilings of a hexagon with three dents
• A generalization of Aztec dragons
• A dual of MacMahon’s theorem on plane partitions
• Graphical condensation of plane graphs: a combinatorial approach
• Perfect matchings and the octahedron recurrence
• Enumeration of Lozenge tilings of halved hexagons with a boundary defect
• Lozenge tilings of hexagons with arbitrary dents
• The Space of Circular Planar Electrical Networks

Cited In (1)

• Dungeons and dragons: combinatorics for the \(dP_3\) quiver

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)