Classifying integer tilings and hypertilings
Oleg Karpenkov, Ian Short, Matty van Son, Andrei Zabolotskii

TL;DR
This paper classifies all tame integer tilings and hypertilings using geometric models based on generalized Farey graphs, extending previous work on friezes and tilings with applications to hyperbolic geometry and algebra.
Contribution
It introduces a unified geometric framework for classifying tame integer tilings and hypertilings, generalizing known models and providing explicit classifications.
Findings
Classified all positive integer N-tilings and rational friezes.
Developed a geometric model using generalized Farey graphs.
Classified all tame integer hypertilings with Cayley hyperdeterminant 1.
Abstract
There are two objectives to this work: to classify all tame integer tilings and to classify all tame integer hypertilings. Motivation for the first objective comes from Conway and Coxeter's modelling of positive integer friezes using triangulated polygons, which has received significant attention since the discovery of cluster algebras by Fomin and Zelevinsky in 2002. Assem, Reutenauer, and Smith introduced -tilings as generalisations of friezes, and Bessenrodt, Holm, and J{\o}rgensen classified positive integer -tilings using infinite triangulated polygons. Here we consider -tilings, of which -tilings are the case . We provide a geometric model for all tame integer -tilings using a generalisation of the Farey graph in the hyperbolic plane. Highlights of this model include classifications of all positive integer -tilings and of all…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · Algebraic structures and combinatorial models · Geometric and Algebraic Topology
