Related papers: Tiling of Constellations
This article addresses the problem of enumerating the tilings of a plane by lozenges, under the restriction that these tilings be doubly periodic. Kasteleyn's Pfaffian method is applied to compute the generating function of those…
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…
We formulate a construction of type-I fracton models based on gauging planar subsystem symmetries of topologically ordered two dimensional layers that have been stacked in three ambient spatial dimensions. Via our construction, any defect…
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…
v2: An additional assumption was added in Theorem 4.8. In order to show that a connected abelian group is admissible on the site of locally compact spaces we must in addition assume that it is locally topologically divisible. This condition…
In this paper, we define Abelian and consta-Abelian polyadic codes over rings defined as affine algebras over chain rings. For that aim, we use the classical construction via splittings and multipliers of the underlying Abelian group. We…
We study the problem of tiling and packing in vector spaces over finite fields, its connections with zeroes of classical exponential sums, and with the Jacobian conjecture
The periodic tiling conjecture asserts that if a region $\Sigma\subset \mathbb R^d$ tiles $\mathbb R^d$ by translations then it admits at least one fully periodic tiling. This conjecture is known to hold in $\mathbb R$, and recently it was…
In this paper, we establish the conditions for some finite abelian groups and the family all the $k$-sets in each of them summing up to an element $x$ to form $t$-designs. We fully characterize the sufficient and necessary conditions for…
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,…
To understand an aperiodic tiling (or a quasicrystal modeled on an aperiodic tiling), we construct a space of similar tilings, on which the group of translations acts naturally. This space is then an (abstract) dynamical system. Dynamical…
In this paper, we give a proof that it is undecidable whether a set of five polyominoes can tile the plane by translation. The proof involves a new method of labeling the edges of polyominoes, making it possible to assign whether two edges…
The present article studies combinatorial tilings of Euclidean or spherical spaces by polytopes, serving two main purposes: first, to survey some of the main developments in combinatorial space tiling; and second, to highlight some new and…
In this paper it is proved that there exist periodic monohedral tilings and finite seeds of colored tiles, which force non-periodic coloring of the whole plane
We study the tiling of a two-dimensional region of the plane by $K$-cell one-dimensional tiles, or $K$-mers. Unlike previous studies, which typically allowed for one single value of $K$ or sometimes a small assortment of fixed values, here…
We determine all non-edge-to-edge tilings of the sphere by regular spherical polygons of three or more sides.
In this paper, we prove that it is undecidable whether a set of two polycubes can tile $\mathbb{Z}^3$ by translation. The proof involves a new technique that allows us to simulate two disconnected polycubes with two connected polycubes. By…
We present a way of tiling the plane with a regular hexagonal network of defects. The network is stable and follows in consequence of the three-junctions that appear in a model of two real scalar fields that presents $Z_3$ symmetry. The…
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…
Tilings and tiling systems are an abstract concept that arise both as a computational model and as a dynamical system. In this paper, we characterize the sets of periods that a tiling system can produce. We prove that up to a slight…