Title of article
Proof of Blumʹs conjecture on hexagonal dungeons
Author/Authors
Ciucu، نويسنده , , Mihai and Lai، نويسنده , , Tri، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2014
Pages
33
From page
273
To page
305
Abstract
Matt Blum conjectured that the number of tilings of the hexagonal dungeon of sides a, 2a, b, a, 2a, b (where b ⩾ 2 a ) is 13 2 a 2 14 ⌊ a 2 2 ⌋ (Propp, 1999 [4]). In this paper we present a proof for this conjecture using Kuoʹs Graphical Condensation Theorem (Kuo, 2004 [2]).
Keywords
Dual graph , Aztec dungeons , Hexagonal dungeons , Graphical condensation , tilings , Perfect matchings
Journal title
Journal of Combinatorial Theory Series A
Serial Year
2014
Journal title
Journal of Combinatorial Theory Series A
Record number
1532023
Link To Document