Related papers: Filling a box with translates of two bricks
The periodic tiling conjecture asserts that any finite subset of a lattice $\mathbb{Z^d}$ which tiles that lattice by translations, in fact tiles periodically. We announce here a disproof of this conjecture for sufficiently large $d$, which…
We show that translational tiling problems in a quotient of $\mathbb{Z}^d$ can be effectively reduced or ``simulated'' by translational tiling problems in $\mathbb{Z}^d$. In particular, for any $d \in \mathbb{N}$, $k < d$ and…
A group-theoretical approach to the construction of quasiperiodic tilings of a Euclidean plane, possessing five-fold symmetry, is applied. Of the infinitely many of variants of quasiperiodic partitions of the plane, possessing the dihedral…
Tilings are around us everywhere, and our curiosity draws us to study their properties. A tiling is a way of arranging pieces on a board, such that there is no space left uncovered, nor any space covered by more than one tile. In…
We develop the connection of Berg partitions with special substitution tilings of two tiles. We obtain a new proof that the number of Berg partitions with a fixed connectivity matrix is equal to half of the sum of its entries, \cite{S-W}.…
A brick is a 3-connected graph such that the graph obtained from it by deleting any two distinct vertices has a perfect matching. A brick is minimal if for every edge e the deletion of e results in a graph that is not a brick. We prove a…
We derive explicit rational generating functions for weighted tilings of $2k\times n$ rectangles by straight $k\times 1$ tiles. Our approach combines a decomposition by fault lines with a Hadamard-product framework. Tools from algebraic…
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…
Alon, Bohman, Holzman and Kleitman proved that any partition of a $d$-dimensional discrete box into proper sub-boxes must consist of at least $2^d$ sub-boxes. Recently, Leader, Mili\'{c}evi\'{c} and Tan considered the question of how many…
A famous result of D. Walkup is that an $m\times n$ rectangle may be tiled by T-tetrominos if and only if both $m$ and $n$ are multiples of 4. The "if" portion may be proved by tiling a $4\times 4$ block, and then copying that block to fill…
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…
We consider two number-theoretic problems arising from Fuglede's spectral set conjecture: characterizing finite sets that tile integers, and finding polynomials with (0,1) coefficients whose roots have a certain multiplicative structure. We…
The combinatorial structure of a d-dimensional simple convex polytope can be reconstructed from its abstract graph [Blind & Mani 1987, Kalai 1988]. However, no polynomial/efficient algorithm is known for this task, although a polynomially…
We construct confluent conformal blocks of the second kind of the Virasoro algebra. We also construct the Stokes transformations which map such blocks in one Stokes sector to another. In the BPZ limit, we verify explicitly that the…
We present a single, connected tile which can tile the plane but only non-periodically. The tile is hexagonal with edge markings, which impose simple rules as to how adjacent tiles are allowed to meet across edges. The first of these rules…
The Fourier transforms of polyhedral cones can be used, via Brion's theorem, to compute various geometric quantities of polytopes, such as volumes, moments, and lattice-point counts. We present a novel method of computing these conic…
In this paper, we study tilings of $\mathbb Z$, that is, coverings of $\mathbb Z$ by disjoint sets (tiles). Let $T=\{d_1,\ldots, d_s\}$ be a given multiset of distances. Is it always possible to tile $\mathbb Z$ by tiles, for which the…
The number of complete tilings of m X n floors for tiles of shape 1 X 2, 1 X 3, 1 X 4 and 2 X 3 is computed numerically for floors up to width m=9 and variable floor lengths n. Counts are obtained for two classes, for fixed tile stack…
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…
A plane tiling consisting of congruent copies of a shape is isohedral provided that for any pair of copies, there exists a symmetry of the tiling mapping one copy to the other. We give a $O(n\log^2{n})$-time algorithm for deciding if a…