A short combinatorial proof of Di Francesco's conjecture on Aztec triangles
Fuente:
arXiv
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866918116125048832 |
|---|---|
| author | Byun, Seok Hyun Ciucu, Mihai |
| author_facet | Byun, Seok Hyun Ciucu, Mihai |
| contents | Di Francesco conjectured in 2021 that the number of domino tilings of a certain family of regions -- called Aztec triangles -- on the square lattice is given by a product formula reminiscent of the one giving the number of alternating sign matrices. This turned out to be a real challenge to prove without the use of computers -- each of the two existing proofs (one due to Koutschan, Krattenthaler and Schlosser, the other to Corteel, Huang and Krattenthaler) relies on substantial computer calculations which would be hard to check directly. In this paper we present a short combinatorial proof that relies on the second author's factorization theorem and complementation theorem for perfect matchings. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2508_04545 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | A short combinatorial proof of Di Francesco's conjecture on Aztec triangles Byun, Seok Hyun Ciucu, Mihai Combinatorics Statistical Mechanics Mathematical Physics 05A15, 82B20 Di Francesco conjectured in 2021 that the number of domino tilings of a certain family of regions -- called Aztec triangles -- on the square lattice is given by a product formula reminiscent of the one giving the number of alternating sign matrices. This turned out to be a real challenge to prove without the use of computers -- each of the two existing proofs (one due to Koutschan, Krattenthaler and Schlosser, the other to Corteel, Huang and Krattenthaler) relies on substantial computer calculations which would be hard to check directly. In this paper we present a short combinatorial proof that relies on the second author's factorization theorem and complementation theorem for perfect matchings. |
| title | A short combinatorial proof of Di Francesco's conjecture on Aztec triangles |
| topic | Combinatorics Statistical Mechanics Mathematical Physics 05A15, 82B20 |
| url | https://arxiv.org/abs/2508.04545 |