Related papers: Tiles and colors
Coloured graphical models are Gaussian statistical models determined by an undirected coloured graph. These models can be described by linear spaces of symmetric matrices. We outline a relationship between the symmetries of the graph and…
Edge-matching problems, also called edge matching puzzles, are abstractions of placement problems with neighborhood conditions. Pieces with colored edges have to be placed on a board such that adjacent edges have the same color. The problem…
A model is presented consisting of triangular trimers on the triangular lattice. In analogy to the dimer problem, these particles cover the lattice completely without overlap. The model has a honeycomb structure of hexagonal cells separated…
We introduce a variant of the vertex-distinguishing edge coloring problem, where each edge is assigned a subset of colors. The label of a vertex is the union of the sets of colors on edges incident to it. In this paper we investigate the…
Consider a graph whose vertices are colored in one of two colors, say black or white. A white vertex is called integrated if it has at least as many black neighbors as white neighbors, and similarly for a black vertex. The coloring as a…
Two new series of substitution tilings are introduced in which the tiles appear in infinitely many orientations. It is shown that several properties of the well-known pinwheel tiling do also hold for these new examples, and, in fact, for…
A two-dimensional configuration is a coloring of the infinite grid Z^2 with finitely many colors. For a finite subset D of Z^2, the D-patterns of a configuration are the colored patterns of shape D that appear in the configuration. The…
The site percolation on the triangular lattice stands out as one of the few exactly solved statistical systems. By initially configuring critical percolation clusters of this model and randomly reassigning the color of each percolation…
Suppose a d-dimensional lattice cube of size n^d is colored in several colors so that no face of its triangulation (subdivision of the standard partition into n^d small cubes) is colored in m+2 colors. Then one color is used at least…
Patterned self-assembly tile set synthesis (PATS) aims at finding a minimum tile set to uniquely self-assemble a given rectangular color pattern. For $k \ge 1$, $k$-PATS is a variant of PATS that restricts input patterns to those with at…
New classes of integrable boundary conditions for the q-deformed (or two-parameter) supersymmetric U model are presented. The boundary systems are solved by using the coordinate space Bethe ansatz technique and Bethe ansatz equations are…
An integral self-affine tile is the solution of a set equation $\mathbf{A} \mathcal{T} = \bigcup_{d \in \mathcal{D}} (\mathcal{T} + d)$, where $\mathbf{A}$ is an $n \times n$ integer matrix and $\mathcal{D}$ is a finite subset of…
We study whether an asymmetric limited-magnitude ball may tile $\mathbb{Z}^n$. This ball generalizes previously studied shapes: crosses, semi-crosses, and quasi-crosses. Such tilings act as perfect error-correcting codes in a channel which…
In the Coloured Clustering problem, we wish to colour vertices of an edge coloured graph to produce as many stable edges as possible, i.e., edges with the same colour as their ends. In this paper, we reveal that the problem is in fact a…
We discuss a geometrical interpretation of the Z-invariant Ising model in terms of isoradial embeddings of planar lattices. The Z-invariant Ising model can be defined on an arbitrary planar lattice if and only if certain paths on the…
Model sets are always Meyer sets, but not vice-versa. This article is about characterizing model sets (general and regular) amongst the Meyer sets in terms of two associated dynamical systems. These two dynamical systems describe two very…
Pattern self-assembly tile set synthesis (PATS) is a combinatorial optimization problem which aim at minimizing a rectilinear tile assembly system (RTAS) that uniquely self-assembles a given rectangular pattern, and is known to be NP-hard.…
Recently, researchers have proposed the Asymmetric Bethe ansatz method - a theoretical tool that extends the scope of Bethe ansatz-solvable models by "breaking" partial mirror symmetry via the introduction of a fully reflecting boundary.…
We define new diagram algebras providing a sequence of multiparameter generalisations of the Temperley-Lieb algebra, suitable for the modelling of dilute lattice systems of two-dimensional Statistical Mechanics. These algebras give a…
To study the fixed parameter undecidability of tiling problem for a set of Wang tiles, Jeandel and Rolin show that the tiling problem for a set of 44 Wang bars is undecidable. In this paper, we improve their result by proving that whether a…