A short combinatorial proof of Di Francesco’s conjecture on Aztec triangles
Proceedings of the American Mathematical Society · 12.06.2026
DOI: 10.1090/proc/17718 ↗Kurz gefasst
Fachartikel in der Zeitschrift Proceedings of the American Mathematical Society, online erschienen am 12.06.2026. Verfasst von Seok Hyun Byun und 1 weiteren Autor:innen. Die Arbeit nennt 18 Literaturangaben. Gefördert von: Simons Foundation, National Science Foundation.
Abstract (Originalsprache)
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 [Electron. J. Combin. 28 (2021), Article 4.38]. 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 [J. Symbolic Comput. 127 (2025), Article 102352], the other to Corteel, Huang and Krattenthaler [ Domino tilings of generalized Aztec triangles , arXiv:2305.01774, 2023]) relies on substantial computer calculations which would be hard to check directly. In this paper we present a short combinatorial proof.
Förderung
- Simons Foundation
- National Science Foundation
Zitieren
APA
Byun, S. H., & Ciucu, M. (2026). A short combinatorial proof of Di Francesco’s conjecture on Aztec triangles. Proceedings of the American Mathematical Society. https://doi.org/10.1090/proc/17718
Vancouver
Byun SH, Ciucu M. A short combinatorial proof of Di Francesco’s conjecture on Aztec triangles. Proceedings of the American Mathematical Society. 2026. doi:10.1090/proc/17718
BibTeX
@article{Byun2026,
author = {Byun, Seok Hyun and Ciucu, Mihai},
title = {A short combinatorial proof of Di Francesco’s conjecture on Aztec triangles},
journal = {Proceedings of the American Mathematical Society},
year = {2026},
doi = {10.1090/proc/17718}
}
EUVIMED