SLk-Tilings and Paths in Zk
Abstract
An SLk-tiling is a bi-infinite array of integers having all adjacent k× k minors equal to one and all adjacent (k+1)× (k+1) minors equal to zero. Introduced and studied by Bergeron and Reutenauer, SLk-tilings generalize the notion of Conway-Coxeter frieze patterns in the case k=2. In a recent paper, Short showed a bijection between bi-infinite paths of reduced rationals in the Farey graph and SL2-tilings. We extend this result to higher k by constructing a bijection between SLk-tilings and certain pairs of bi-infinite strips of vectors in Zk called paths. The key ingredient in the proof is the connection to Pl\"ucker friezes and Grassmannian cluster algebras. As an application, we obtain results about periodicity, duality, and positivity for tilings.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.