Proof of Blum's conjecture on hexagonal dungeons

Mihai Ciucu; Tri Lai

doi:10.1016/j.jcta.2014.03.008

Proof of Blum's conjecture on hexagonal dungeons

Mihai Ciucu
, Tri Lai

Research output: Contribution to journal › Article › peer-review

16 Scopus citations

Abstract

Matt Blum conjectured that the number of tilings of the hexagonal dungeon of sides a, 2. a, b, a, 2a, b (where b ≥ 2a) is 13^2a214⌊a²/2⌋ (Propp, 1999 [4]). In this paper we present a proof for this conjecture using Kuo's Graphical Condensation Theorem (Kuo, 2004 [2]).

Original language	English (US)
Pages (from-to)	273-305
Number of pages	33
Journal	Journal of Combinatorial Theory. Series A
Volume	125
Issue number	1
DOIs	https://doi.org/10.1016/j.jcta.2014.03.008
State	Published - Jul 2014
Externally published	Yes

Keywords

Aztec dungeons
Dual graph
Graphical condensation
Hexagonal dungeons
Perfect matchings
Tilings

Publisher link

10.1016/j.jcta.2014.03.008

Find It

Find It at U of M Libraries

Cite this

@article{097c7819ec2e49f382f37d05d9fa105f,

title = "Proof of Blum's conjecture on hexagonal dungeons",

abstract = "Matt Blum conjectured that the number of tilings of the hexagonal dungeon of sides a, 2. a, b, a, 2a, b (where b ≥ 2a) is 132a214⌊a2/2⌋ (Propp, 1999 [4]). In this paper we present a proof for this conjecture using Kuo's Graphical Condensation Theorem (Kuo, 2004 [2]).",

keywords = "Aztec dungeons, Dual graph, Graphical condensation, Hexagonal dungeons, Perfect matchings, Tilings",

author = "Mihai Ciucu and Tri Lai",

year = "2014",

month = jul,

doi = "10.1016/j.jcta.2014.03.008",

language = "English (US)",

volume = "125",

pages = "273--305",

journal = "Journal of Combinatorial Theory. Series A",

issn = "0097-3165",

publisher = "Academic Press Inc.",

number = "1",

}

TY - JOUR

T1 - Proof of Blum's conjecture on hexagonal dungeons

AU - Ciucu, Mihai

AU - Lai, Tri

PY - 2014/7

Y1 - 2014/7

N2 - Matt Blum conjectured that the number of tilings of the hexagonal dungeon of sides a, 2. a, b, a, 2a, b (where b ≥ 2a) is 132a214⌊a2/2⌋ (Propp, 1999 [4]). In this paper we present a proof for this conjecture using Kuo's Graphical Condensation Theorem (Kuo, 2004 [2]).

AB - Matt Blum conjectured that the number of tilings of the hexagonal dungeon of sides a, 2. a, b, a, 2a, b (where b ≥ 2a) is 132a214⌊a2/2⌋ (Propp, 1999 [4]). In this paper we present a proof for this conjecture using Kuo's Graphical Condensation Theorem (Kuo, 2004 [2]).

KW - Aztec dungeons

KW - Dual graph

KW - Graphical condensation

KW - Hexagonal dungeons

KW - Perfect matchings

KW - Tilings

UR - https://www.scopus.com/pages/publications/84897939196

UR - https://www.scopus.com/pages/publications/84897939196#tab=citedBy

U2 - 10.1016/j.jcta.2014.03.008

DO - 10.1016/j.jcta.2014.03.008

M3 - Article

AN - SCOPUS:84897939196

SN - 0097-3165

VL - 125

SP - 273

EP - 305

JO - Journal of Combinatorial Theory. Series A

JF - Journal of Combinatorial Theory. Series A

IS - 1

ER -

Proof of Blum's conjecture on hexagonal dungeons

Abstract

Keywords

Publisher link

Find It

Other files and links

Fingerprint

Cite this