Propp's benzels and Lai's nearly symmetric hexagons with holes

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autori principali: Byun, Seok Hyun, Ciucu, Mihai, Lee, Yi-Lin
Natura: Preprint
Pubblicazione: 2024
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866915475676463104
author Byun, Seok Hyun
Ciucu, Mihai
Lee, Yi-Lin
author_facet Byun, Seok Hyun
Ciucu, Mihai
Lee, Yi-Lin
contents In this paper we present a new version of the second author's factorization theorem for perfect matchings of symmetric graphs. We then use our result to solve four open problems of Propp on the enumeration of trimer tilings on the hexagonal lattice. As another application, we obtain a semi-factorization result for the number of lozenge tilings of a large class of hexagonal regions with holes (obtained by starting with an arbitrary symmetric hexagon with holes, and translating all the holes one unit lattice segment in the same direction). This in turn leads to the solution of two open problems posed by Lai and to an extension of a result due to Fulmek and Krattenthaler, which results in exact enumeration formulas for some new families of hexagonal regions with holes. Our result also allows us to find new, simpler proofs (and in one case, a new, simpler form) of some formulas due to Krattenthaler for the number of perfect matchings of Aztec rectangles with unit holes along a lattice diagonal.
format Preprint
id arxiv_https___arxiv_org_abs_2406_18419
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Propp's benzels and Lai's nearly symmetric hexagons with holes
Byun, Seok Hyun
Ciucu, Mihai
Lee, Yi-Lin
Combinatorics
Statistical Mechanics
Mathematical Physics
05A15, 05A19
In this paper we present a new version of the second author's factorization theorem for perfect matchings of symmetric graphs. We then use our result to solve four open problems of Propp on the enumeration of trimer tilings on the hexagonal lattice. As another application, we obtain a semi-factorization result for the number of lozenge tilings of a large class of hexagonal regions with holes (obtained by starting with an arbitrary symmetric hexagon with holes, and translating all the holes one unit lattice segment in the same direction). This in turn leads to the solution of two open problems posed by Lai and to an extension of a result due to Fulmek and Krattenthaler, which results in exact enumeration formulas for some new families of hexagonal regions with holes. Our result also allows us to find new, simpler proofs (and in one case, a new, simpler form) of some formulas due to Krattenthaler for the number of perfect matchings of Aztec rectangles with unit holes along a lattice diagonal.
title Propp's benzels and Lai's nearly symmetric hexagons with holes
topic Combinatorics
Statistical Mechanics
Mathematical Physics
05A15, 05A19
url https://arxiv.org/abs/2406.18419