Perfect matchings of trimmed Aztec rectangles (Q2411505)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Perfect matchings of trimmed Aztec rectangles |
scientific article |
Statements
Perfect matchings of trimmed Aztec rectangles (English)
0 references
24 October 2017
0 references
Summary: We consider several new families of subgraphs of the square grid whose matchings are enumerated by powers of several small prime numbers: \(2\), \(3\), \(5\), and \(11\). Our graphs are obtained by trimming two opposite corners of an Aztec rectangle. The result yields a proof of a conjecture posed by Ciucu. In addition, we reveal a hidden connection between our graphs and the hexagonal dungeons introduced by Blum.
0 references
perfect matching
0 references
tiling
0 references
dual graph
0 references
Aztec rectangle
0 references
graphical condensation
0 references
hexagonal dungeon
0 references
0 references
0 references
0 references
