English
Related papers

Related papers: The Phase Transition for Dyadic Tilings

200 papers

We show that a single prototile can fill space uniformly but not admit a periodic tiling. A two-dimensional, hexagonal prototile with markings that enforce local matching rules is proven to be aperiodic by two independent methods. The…

Combinatorics · Mathematics 2015-03-13 Joshua E. S. Socolar , Joan M. Taylor

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…

Combinatorics · Mathematics 2025-08-19 Yoonhu Kim

The edge-to-edge tilings of the sphere by congruent quadrilaterals of Type $a^2bc$ are classified as $3$ classes: a sequence of two-parameter families of $2$-layer earth map tilings with $2n$ $(n\ge3)$ tiles, a one-parameter family of…

Combinatorics · Mathematics 2022-07-26 Yixi Liao , Pinren Qian , Erxiao Wang , Yingyun Xu

The so-called "einstein problem" (a pun playing with the famous scientist's name and the German term "ein Stein" for "one stone") asks for a simply connected prototile only allowing nonperiodic tilings without need of any matching rule. So…

Metric Geometry · Mathematics 2025-06-24 Bernhard Klaassen

We consider two families of Pascal-like triangles that have all ones on the left side and ones separated by $m-1$ zeros on the right side. The $m=1$ cases are Pascal's triangle and the two families also coincide when $m=2$. Members of the…

Combinatorics · Mathematics 2022-12-21 Michael A. Allen , Kenneth Edwards

Motivated by applications in reliable and secure communication, we address the problem of tiling (or partitioning) a finite constellation in $\mathbb{Z}_{2^L}^n$ by subsets, in the case that the constellation does not possess an abelian…

Information Theory · Computer Science 2021-05-13 Maiara F. Bollauf , Øyvind Ytrehus

We consider three-dimensional domino tilings of cylinders $\mathcal{R}_N = \mathcal{D} \times [0,N]$ where $\mathcal{D} \subset \mathbb{R}^2$ is a fixed quadriculated disk and $N \in \mathbb{N}$. A domino is a $2 \times 1 \times 1$ brick. A…

Combinatorics · Mathematics 2024-12-24 Raphael de Marreiros

Icosahedral tilings, although non-periodic, are known to be characterized by their configurations of some finite size. This characterization has also been expressed in terms of a simple alternation condition. We provide an alternative proof…

Combinatorics · Mathematics 2016-08-16 Nicolas Bédaride , Thomas Fernique

Tilings of a surface of negative Euler characteristic by n-gons with n\ge 7 is a finite problem. We develop the algorithm for finding all the tilings for fixed number of tiles and present the calculation for tilings of surfaces of small…

Combinatorics · Mathematics 2026-04-29 Chunlin Li , Erxiao Wang , Wu Jie , Min Yan

A cube tiling of $\mathbb{R}^d$ is a family of pairwise disjoint cubes $[0,1)^d+T=\{[0,1)^d+t\colon t\in T\}$ such that $\bigcup_{t\in T}([0,1)^d+t)=\mathbb{R}^d$. Two cubes $[0,1)^d+t$, $[0,1)^d+s$ are called a twin pair if $|t_j-s_j|=1$…

Combinatorics · Mathematics 2017-01-26 Andrzej P. Kisielewicz

A tiling of a topological disc by topological discs is called monohedral if all tiles are congruent. Maltby (J. Combin. Theory Ser. A 66: 40-52, 1994) characterized the monohedral tilings of a square by three topological discs. Kurusa,…

Metric Geometry · Mathematics 2023-06-27 Bushra Basit , Zsolt Lángi

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…

Computational Geometry · Computer Science 2024-07-17 Pratik Ghosal , Syed Mohammad Meesum , Katarzyna Paluch

We prove that the number of monomer-dimer tilings of an $n\times n$ square grid, with $m<n$ monomers in which no four tiles meet at any point is $m2^m+(m+1)2^{m+1}$, when $m$ and $n$ have the same parity. In addition, we present a new proof…

Combinatorics · Mathematics 2011-10-25 Alejandro Erickson , Mark Schurch

The first undecidability result on the tiling is the undecidability of translational tiling of the plane with Wang tiles, where there is an additional color matching requirement. Later, researchers obtained several undecidability results on…

Combinatorics · Mathematics 2025-06-17 Chao Yang , Zhujun Zhang

We show that a rectangle triangle random tiling with a tenfold symmetric phase is solvable by Bethe Ansatz. After the twelvefold square triangle and the eightfold rectangle triangle random tiling, this is the third example of a rectangle…

Statistical Mechanics · Physics 2011-11-29 Jan de Gier , Bernard Nienhuis

We consider tilings of deficient rectangles by the set $\mathcal{T}_4$ of ribbon $L$-tetrominoes. A tiling exists iff the rectangle is a square of odd side. The missing cell is on the main NW--SE diagonal, in an odd position if the square…

Combinatorics · Mathematics 2017-02-10 Viorel Nitica

In this paper a closed form expression for the number of tilings of an $n\times n$ square border with $1\times 1$ and $2\times1$ cuisenaire rods is proved using a transition matrix approach. This problem is then generalised to $m\times n$…

Combinatorics · Mathematics 2016-11-01 M. Connolly

Cover-inclusive Dyck tilings are tilings of skew Young diagrams with ribbon tiles shaped like Dyck paths, in which tiles are no larger than the tiles they cover. These tilings arise in the study of certain statistical physics models and…

Combinatorics · Mathematics 2013-10-21 Jang Soo Kim , Karola Meszaros , Greta Panova , David B. Wilson

A new kind of aperiodic tiling is introduced. It is shown to underlie a structure obtained as a superposition of waves with incommensurate periods. Its connections to other other tilings and quasicrystals are discussed.

Other Condensed Matter · Physics 2007-11-28 A. Losev

We count tilings of a rectangle of integer sides m-1 and n-1 by a special set of tiles. The result is obtained fron the study of the kernel of the adjacency matrix of an n x n rectangular graph of Z x Z.

Combinatorics · Mathematics 2007-05-23 Carlos Tomei , Tania Vieira