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

TL;DR
This paper refines Blum's conjecture on the enumeration of tilings of hexagonal dungeons, providing a more detailed formula and applying it to new dungeon types.
Contribution
It introduces a 3-parameter refinement of Blum's conjecture and extends the enumeration to additional hexagonal dungeon configurations.
Findings
Validated the refined conjecture through combinatorial enumeration.
Extended tiling enumeration to new hexagonal dungeon variants.
Demonstrated the applicability of graphical condensation methods.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · Algebraic structures and combinatorial models · Coding theory and cryptography
