Abstract
Matt Blum conjectured that the number of tilings of the hexagonal dungeon of sides a, 2a, b, a, 2a, b (where b⩾2a) is 132a214⌊a22⌋ (Propp, 1999 [4]). In this paper we present a proof for this conjecture using Kuo's Graphical Condensation Theorem (Kuo, 2004 [2]).
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
