Related papers: Tiles and colors
We consider solutions to the $4$-color problem for the vertices of sphere triangulations with degree sequence $6,...,6,4,4,4,4,4,4$. We sort these solutions into combinatorial types and show that each generic type $\tau$ is parametrized by…
We consider apictorial edge-matching puzzles, in which the goal is to arrange a collection of puzzle pieces with colored edges so that the colors match along the edges of adjacent pieces. We devise an algebraic representation for this…
Enumeration of tilings is the mathematical study concerning the total number of coverings of regions by similar pieces without gaps or overlaps. Enumeration of tilings has become a vibrant subfield of combinatorics with connections and…
We study the P"oschl-Teller equation in complex domain and deduce infinite families of TQ and Bethe ansatz equations, classified by four integers. In all these models the form of T is very simple, while Q can be explicitly written in terms…
The tiling problem has been a famous problem that has appeared in many Mathematics problems. Many of its solutions are rooted in high-level Mathematics. Thus we hope to tackle this problem using more elementary Mathematics concepts. In this…
In the field of algorithmic self-assembly, a long-standing unproven conjecture has been that of the NP-hardness of binary pattern tile set synthesis (2-PATS). The $k$-PATS problem is that of designing a tile assembly system with the…
In this paper we present a new series of 3-dimensional integrable lattice models with $N$ colors. The case $N=2$ generalizes the elliptic model of our previous paper. The weight functions of the models satisfy modified tetrahedron equations…
We present applications of rectangular matrix models to various combinatorial problems, among which the enumeration of face-bicolored graphs with prescribed vertex degrees, and vertex-tricolored triangulations. We also mention possible…
In this second paper, we study the case of substitution tilings of R^d. The substitution on tiles induces substitutions on the faces of the tiles of all dimensions j=0, ..., d-1. We reconstruct the tiling's equivalence relation in a purely…
We describe families of plane-filling curves on any edge-to-edge tiling of the plane with regular polygons and finitely many classes of edges. It is shown how to partition the minimal number of edge classes from the group G of symmetries of…
Colored triangulations offer a generalization of combinatorial maps to higher dimensions. Just like maps are gluings of polygons, colored triangulations are built as gluings of special, higher-dimensional building blocks, such as octahedra,…
We show that given any tiling of Euclidean space, any geometric patterns of points, we can find a patch of tiles (of arbitrarily large size) so that copies of this patch appear in the tiling nearly centered on a scaled and translated…
The problem of rectangle tiling binary arrays is defined as follows. Given an $n \times n$ array $A$ of zeros and ones and a natural number $p$, our task is to partition $A$ into at most $p$ rectangular tiles, so that the maximal weight of…
A new set of exact scattering matrices in 1+1 dimensions is proposed by solving the bootstrap equations. Extending earlier constructions of colour valued scattering matrices this new set has its colour structure associated to non…
Periodic tilings play a role in the decorative arts, in construction and in crystal structures. Combinatorial tiling theory allows the systematic generation, visualization and exploration of such tilings of the plane, sphere and hyperbolic…
A tiling is said to have infinite local complexity (ILC) if it contains infinitely many two-tile patches up to rigid motions. In this work, we provide examples of substitution rules that generate tilings with ILC. The proof relies on…
In this article we show that there exist measurable sets W in the plane with finite measure that tile the plane in a measurable way under the action of a expansive matrix A, an affine Weyl group W, and a full rank lattice G. This note is…
We extend basic properties of two dimensional integrable models within the Algebraic Bethe Ansatz approach to 2+1 dimensions and formulate the sufficient conditions for the commutativity of transfer matrices of different spectral…
Arrangements of pseudolines are a widely studied generalization of line arrangements. They are defined as a finite family of infinite curves in the Euclidean plane, any two of which intersect at exactly one point. One can state various…
A set is said to tile the integers if and only if the integers can be written as a disjoint union of translates of that set. We consider the problem of finding necessary and sufficient conditions for a finite set to tile the integers. For…