Proof of Blum's conjecture on hexagonal dungeons

From MaRDI portal
Publication:2451904



Abstract: Matt Blum conjectured that the number of tilings of the Hexagonal Dungeon of sides a,2a,b,a,2a,b (where bgeq2a) is 132a214lfloorfraca22floor (J. Propp, New Perspectives in Geometric Combinatorics, Cambridge University Press, 1999). In this paper we present a proof for this conjecture using Kuo's Graphical Condensation Theorem (E. Kuo, Applications of Graphical Condensation for Enumerating Matchings and Tilings, Theoretical Computer Science, 2004).












This page was built for publication: Proof 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 Q2451904)