Enumeration of hybrid domino–lozenge tilings

Abstract

We use the subgraph replacement method to investigate new properties of the tilings of regions on the square lattice with diagonals drawn in. In particular, we show that the centrally symmetric tilings of a generalization of the Aztec diamond are always enumerated by a simple product formula. This result generalizes the previous work of Ciucu (1997) and Yang (1992) about symmetric tilings of the Aztec diamond. We also use our method to prove a closed form product formula for the number of centrally symmetric tilings of a quasi-hexagon.2010 Mathematics Subject Classification. 05A15, 05B45.

A q-enumeration of lozenge tilings of a hexagon with three dents

“…However, such q-enumerations are rare in the domain of enumeration of lozenge tilings. Together with the related work [La14], this paper gives such a rare q-enumeration.…”

Perfect Matchings of Trimmed Aztec Rectangles

“…The m × n Aztec rectangle (graph) 1 AR m,n is the subgraph of the square grid induced by the vertices inside or on the boundary of the rectangular contour. The graph restricted in the bold contour on the left of Figure 1.1 shows the Aztec rectangle AR 6,8 .…”

Proof of a refinement of Blum’s conjecture on hexagonal dungeons

“…Lemma 4.1 (Graph-Splitting Lemma; Lemma 3.6(a) in [5]). Let G be a bipartite graph, and let V 1 and V 2 be the two vertex classes.…”