Related papers: $SL_k$-Tilings and Paths in $\mathbb{Z}^k$
An $SL_2$-tiling is a bi-infinite matrix of positive integers such that each adjacent 2 by 2 submatrix has determinant 1. Such tilings are infinite analogues of Conway-Coxeter friezes, and they have strong links to cluster algebras,…
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…
An $SL_2$-tiling is a bi-infinite matrix in which all adjacent $2 \times 2$ minors are equal to $1$. Positive integral $SL_2$-tilings were introduced by Assem, Reutenauer and Smith as generalisations of classical Conway--Coxeter frieze…
We study properties of (bi-infinite) arrays having all adjacent $k\times k$ adjacent minors equal to one. If we further add the condition that all adjacent $(k-1)\times (k-1)$ minors be nonzero, then these arrays are necessarily of rank…
SL_2-tilings were introduced by Assem, Reutenauer, and Smith in connection with frieses and their applications to cluster algebras. An SL_2-tiling is a bi-infinite matrix of positive integers such that each adjacent 2 x 2-submatrix has…
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…
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…
Trellises are crucial graphical representations of codes. While conventional trellises are well understood, the general theory of (tail-biting) trellises is still under development. Iterative decoding concretely motivates such theory. In…
There is a natural bijection between Dyck paths and basis diagrams of the Temperley-Lieb algebra defined via tiling. Overhang paths are certain generalisations of Dyck paths allowing more general steps but restricted to a rectangle in the…
We explore a three-dimensional counterpart of the Farey tessellation and its relations to Penner's lambda lengths and $SL_2$-tilings. In particular, we prove a three-dimensional version of Ptolemy relation, and generalise results of Ian…
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…
In this article, we construct SL$_k$-friezes using Pl\"ucker coordinates, making use of the cluster structure on the homogeneous coordinate ring of the Grassmannian of $k$-spaces in $n$-space via the Pl\"ucker embedding. When this cluster…
Motivated by a construction in the theory of cluster algebras (Fomin and Zelevinsky), one associates to each acyclic directed graph a family of sequences of natural integers, one for each vertex; this construction is called a {\em frieze};…
Cover-inclusive Dyck tilings are tilings of skew Young diagrams with ribbon tiles shaped like Dyck paths, in which tiles are no larger than the tiles they cover. These tilings arise in the study of certain statistical physics models and…
A perfect $H$-tiling in a graph $G$ is a collection of vertex-disjoint copies of a graph $H$ in $G$ that covers all vertices of $G$. Motivated by papers of Bush and Zhao and of Balogh, Treglown, and Wagner, we determine the threshold for…
A contractive $n$-tuple $A=(A_1,...,A_n)$ has a minimal joint isometric dilation $S=(S_1,...,S_n)$ where the $S_i$'s are isometries with pairwise orthogonal ranges. This determines a representation of the Cuntz-Toeplitz algebra. When $A$…
A $k$-connected set in an infinite graph, where $k > 0$ is an integer, is a set of vertices such that any two of its subsets of the same size $\ell \leq k$ can be connected by $\ell$ disjoint paths in the whole graph. We characterise the…
We derive a simple bijection between geometric plane perfect matchings on $2n$ points in convex position and triangulations on $n+2$ points in convex position. We then extend this bijection to monochromatic plane perfect matchings on…
Let $TT_k$ denote the transitive tournament on $k$ vertices. Let $TT(h,k)$ denote the graph obtained from $TT_k$ by replacing each vertex with an independent set of size $h \geq 1$. The following result is proved: Let $c_2=1/2$, $c_3=5/6$…
Let $E$ be a directed graph, $K$ any field, and let $L_K(E)$ denote the Leavitt path algebra of $E$ with coefficients in $K$. We show that $L_K(E)$ is a B\'{e}zout ring, i.e., that every finitely generated one-sided ideal of $L_K(E)$ is…