相关论文: Classifying SL$_2$-tilings
Due to their elegant and simple nature, unitary Cayley graphs have been an active research topic in the literature. These graphs are naturally connected to several branches of mathematics, including number theory, finite algebra,…
\noindent The algebraic characterization of classes of locally isomorphic aperiodic tilings, being examples of quantum spaces, is conducted for a certain type of tilings in a manner proposed by A. Connes. These $2$-dimensional tilings are…
By viewing $\tilde{A}$ and $\tilde{D}$ type cluster algebras as triangulated surfaces, we find all cluster variables in terms of either (i) the frieze pattern (or bipartite belt) or (ii) the periodic quantities previously found for the…
The study of tilings is a major problem in many mathematical instances, which is studied in two main different approaches: when considering the existence (or obstructions to the existence) of a tiling with a given tile and the other…
The Temperley--Lieb algebra is a finite dimensional associative algebra that arose in the context of statistical mechanics and occurs naturally as a quotient of the Hecke algebra arising from a Coxeter group of type $A$. It is often…
A new method for constructing self-referential tilings of Euclidean space from a graph directed iterated function system, based on a combinatorial structure we call a pre-tree, is introduced. In the special case that we refer to as…
We determine the number of positive integral points on $n$-dimensional affine varieties associated to arbitrary $n \times n$ generalized Cartan matrices. An application to the theory of cluster algebras and combinatorics is the resolution…
For Paley-Wiener functions on weighted combinatorial finite or infinite graphs we develop a weighted sampling theory in which samples are defined as inner products with weight functions (measuring devices). Three reconstruction methods are…
Originally studied by Conway and Coxeter, friezes appeared in various recreational mathematics publications in the 1970s. More recently, in 2015, Baur, Parsons, and Tschabold constructed periodic infinite friezes and related them to…
The entries of frieze patterns may be interpreted as coordinates of roots of a finite Weyl groupoid of rank two. We prove the existence of maximal elements in their root posets and classify those frieze patterns which can be used to build…
Finite frieze patterns with entries in $\mathbb{Z}[\lambda_{p_1},\ldots,\lambda_{p_s}]$ where $\{p_1,\ldots,p_s\} \subseteq \mathbb{Z}_{\geq 3}$ and $\lambda_p = 2 \cos(\pi/p)$ were shown to have a connection to dissected polygons by Holm…
In this survey article we explain the intricate links between Conway-Coxeter friezes and cluster combinatorics. More precisely, we provide a formula, relying solely on the shape of the frieze, describing how each individual entry in the…
We consider the problem of characterizing finite sets which tile the integers by translations. Coven and Meyerowitz (J. Algebra 1999) found necessary and sufficient conditions for a finite set A to tile the integers under the assumption…
Singerman introduced to the theory of maps on surfaces an object that is a universal cover for any map. This object is a tessellation of the hyperbolic plane together with a certain subset of the ideal boundary. The 1-skeleton of this…
Tensor network techniques have proved to be powerful tools that can be employed to explore the large scale dynamics of lattice systems. Nonetheless, the redundancy of degrees of freedom in lattice gauge theories (and related models) poses a…
We explore a paradigm which ties together seemingly disparate areas in number theory, additive combinatorics, and geometric combinatorics including the classical Waring problem, the Furstenberg-S\'{a}rk\"{o}zy theorem on squares in sets of…
We investigate a class of combinatory algebras, called ribbon combinatory algebras, in which we can interpret both the braided untyped linear lambda calculus and framed oriented tangles. Any reflexive object in a ribbon category gives rise…
The fast multipole method (FMM) performs fast approximate kernel summation to a specified tolerance $\epsilon$ by using a hierarchical division of the domain, which groups source and receiver points into regions that satisfy local…
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…
A technique called graphical condensation is used to prove various combinatorial identities among numbers of (perfect) matchings of planar bipartite graphs and tilings of regions. Graphical condensation involves superimposing matchings of a…