Related papers: $3$D Farey graph, lambda lengths and $SL_2$-tiling…
Recently there has been significant progress in classifying integer friezes and $\text{SL}_2$-tilings. Typically, combinatorial methods are employed, involving triangulations of regions and inventive counting techniques. Here we develop a…
The notion of $SL_2$-tiling is a generalization of that of classical Coxeter-Conway frieze pattern. We classify doubly antiperiodic $SL_2$-tilings that contain a rectangular domain of positive integers. Every such $SL_2$-tiling corresponds…
We discuss complex Farey graphs for the Euclidean imaginary quadratic number fields $\mathbb Q(\sqrt{-d})$, $d\in\{1, 2, 3, 7, 11\}$. We study hyperbolic versions of A. Schmidt's Farey polygons living in $3$-dimensional hyperbolic space…
We prove that the theory of the Farey graph is pseudofinite by constructing a sequence of finite structures that satisfy increasingly large subsets of its first-order axiomatization. This graph is an important object in the study of curve…
An $SL_k$-tiling is a bi-infinite array of integers having all adjacent $k\times k$ minors equal to one and all adjacent $(k+1)\times (k+1)$ minors equal to zero. Introduced and studied by Bergeron and Reutenauer, $SL_k$-tilings generalize…
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…
We introduce a family of 3-variable "Farey polynomials" that are closely connected with the geometry and topology of $3$-manifolds and orbifolds as they can be used to produce concrete realisations of the boundaries and local coordinates…
In this paper we develop a new geometric approach to subtractive continued fraction algorithms in high dimensions. We adapt a version of Farey summation to the geometric techniques proposed by F. Klein in 1895. More specifically we…
Farey sequences of irreducible fractions between 0 and 1 can be related to graph constructions known as Farey graphs. These graphs were first introduced by Matula and Kornerup in 1979 and further studied by Colbourn in 1982 and they have…
We present two results related to an edge-isoperimetric question for Cayley graphs on the integer lattice asked by Ben Barber and Joshua Erde [Isoperimetry of Integer Lattices, Discrete Analysis 7 (2018)]. For any (undirected) graph $G$,…
Chv\'atal, R\"odl, Szemer\'edi and Trotter proved that the Ramsey numbers of graphs of bounded maximum degree are linear in their order. We prove that the same holds for 3-uniform hypergraphs. The main new tool which we prove and use is an…
We describe monotone maps between subsequences of the Farey sequences.
Let $n$ be a nonnegative integer, we use ribbon $n-$graph diagrams and the Yamada polynomial skein relations to construct an algebra ${\mathcal Y}_n$ which is shown to be closely related to the Temerley-Lieb Algebra. We prove that the…
Three-term relations of the form AB+CD=EF arise in multiple mathematical contexts, including the Ptolemy equation for a cyclic quadrilateral, Casey's theorem on bitangents, Penner's relation for lambda lengths, and Pl\"ucker's identity for…
We consider embeddings of 3-regular graphs into 3-dimensional Cartesian coordinates, in such a way that two vertices are adjacent if and only if two of their three coordinates are equal (that is, if they lie on an axis-parallel line) and…
We consider a certain linear recursive relation with integer parameters and study some of its algebraic and geometric properties, with the purpose of estimating the number of chains of valences in the Farey series.
Motivated by a conjecture of Koll\'ar, we study embeddings of multiple rational homology balls in $\mathbb{CP}^2$. To each node of the Farey tree, we associate such an embedding of three rational homology balls with lens space boundary,…
We consider the dimer model on piecewise Temperleyan, simply connected domains, on families of graphs which include the square lattice as well as superposition graphs. We focus on the spanning tree $\mathcal{T}_\delta$ associated to this…
Tame SL$_2$-tilings are related to Farey graph and friezes; much less is known about wild (not tame) SL$_2$-tilings. In this note, we demonstrate SL$_2$-tilings that are maximally wild: we prove that the maximum wild density of an integer…
We restate Thomassen's theorem of 3-extendability, an extension of the famous planar 5-choosability theorem, in terms of graph polynomials. This yields an Alon--Tarsi equivalent of 3-extendability.