Related papers: Tiles and colors
Patterned self-assembly tile set synthesis PATS is the problem of finding a minimal tile set which uniquely self-assembles into a given pattern. Czeizler and Popa proved the NP-completeness of PATS and Seki showed that the PATS problem is…
We study tilings of the plane composed of two repeating tiles of different assigned areas relative to an arbitrary periodic lattice. We classify isoperimetric configurations (i.e., configurations with minimal length of the interfaces) both…
Several articles deal with tilings with squares and dominoes on 2-dimensional boards, but only a few on boards in 3-dimensional space. We examine a tiling problem with colored cubes and bricks of $(2\times2\times n)$-board in three…
We prove, using the coordinate Bethe ansatz, the exact solvability of a model of three particles whose point-like interactions are determined by the root system of g_2. The statistics of the wavefunction are left unspecified. Using the…
The algebraic Bethe ansatz is a powerful method to diagonalize transfer-matrices of statistical models derived from solutions of (graded) Yang Baxter equations, connected to fundamental representations of Lie (super-)algebras and their…
Some features of integrable lattice models are reviewed for the case of the six-vertex model. By the Bethe ansatz method we derive the free energy of the six-vertex model. Then, from the expression of the free energy we show analytically…
We prove that is a measurable domain tiles R or R^2 by translations, and if it is "close enough" to a line segment or a square respectively, then it admits a lattice tiling. We also prove a similar result for spectral sets in dimension 1,…
In the perfect tiling problem, we aim to cover the vertices of a hypergraph~$G$ with pairwise vertex-disjoint copies of a hypergraph $F$. There are three essentially necessary conditions for such a perfect tiling, which correspond to…
We study the problem of perfect tiling in the plane and exploring the possibility of tiling a rectangle using integral distinct squares. Assume a set of distinguishable squares (or equivalently a set of distinct natural numbers) is given,…
Cao & Yuan obtained a Blichfeldt-type result for the vertex set of the edge-to-edge tiling of the plane by regular hexagons. Observing that every Archimedean tiling is the union of translates of a fixed lattice, we take a more general…
A modular or distributive lattice is `diamond-colored' if its order diagram edges are colored in such a way that, within any diamond of edges, parallel edges have the same color. Such lattices arise naturally in combinatorial representation…
An exact solution of the model of fully packed loops of two colors on a square lattice has recently been proposed by Dei Cont and Nienhuis using the coordinate Bethe Ansatz approach. We point out here a simpler alternative, in which the…
An $N$-tiling of triangle $ABC$ by triangle $T$ (the `tile') is a way of writing $ABC$ as a union of $N$ copies of $T$ overlapping only at their boundaries. Let the tile $T$ have angles $(\alpha,\beta,\gamma)$, and sides $(a,b,c)$. This…
This paper introduces two tiles whose tilings form a one-parameter family of tilings which can all be seen as digitization of two-dimensional planes in the four-dimensional Euclidean space. This family contains the Ammann-Beenker tilings as…
This article examines the tilings of a strip with equilateral triangles. The number of ways in which the lattices can be covered with a combination of tiles of the two types of triangles is related to Pell's numbers. Additionally, 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…
A tiling is a cover of R^d by tiles such as polygons that overlap only on their borders. A patch is a configuration consisting of finitely many tiles that appears in tilings. From a tiling, we can construct a dynamical system which encodes…
The Four color problem is closely related to other branches of mathematics and practical applications. More than 20 of its reformulations are known, which connect this problem with problems of algebra, statistical mechanics and planning.…
Colored tensor models have recently burst onto the scene as a promising conceptual and computational tool in the investigation of problems of random geometry in dimension three and higher. We present a snapshot of the cutting edge in this…
Quantum systems on a one-dimensional lattice are ubiquitous in the study of models exactly-solved by Bethe Ansatz techniques. Here it is shown that including global-range interaction opens scope for Bethe Ansatz solutions that are not…