Related papers: Rudolph's Two-Step Coding Theorem and Alpern's Lem…

We provide a proof of the Alpern multi-tower theorem for Z^d actions. We reformulate the theorem as a problem of measurably tiling orbits of a Z^d action by a collection of rectangles whose corresponding sides have no non-trivial common…

We give a short combinatorial proof of the classical pointwise ergodic theorem for probability measure preserving $\mathbb{Z}$-actions. Our approach reduces the theorem to a tiling problem: tightly tile each orbit by intervals with desired…

Motivated by a question of Erd\"{o}s and inquiries by Beeson and Laczkovich, we explore the possible $N$ for which a triangle $T$ can tile into $N$ congruent copies of a triangle $R$. The \emph{reptile} cases (where $T$ is similar to $R$)…

Suppose $\Omega\subseteq\RR^d$ is a bounded and measurable set and $\Lambda \subseteq \RR^d$ is a lattice. Suppose also that $\Omega$ tiles multiply, at level $k$, when translated at the locations $\Lambda$. This means that the…

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…

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…

Let $\Omega \subseteq {\bf R}^d$ be an open set of measure 1. An open set $D \subseteq {\bf R}^d$ is called a ``tight orthogonal packing region'' for $\Omega$ if $D-D$ does not intersect the zeros of the Fourier Transform of the indicator…

In this paper, we prove that if a finite number of rectangles, every of which has at least one integer side, perfectly tile a big rectangle then there exists a strategy which reduces the number of these tiles (rectangles) without violating…

Random tilings are interesting as idealizations of atomistic models of quasicrystals and for their connection to problems in combinatorics and algorithms. Of particular interest is the tiling entropy density, which measures the relation of…

Let $X$ be a measure space with a measure-preserving action $(g,x) \mapsto g \cdot x$ of an abelian group $G$. We consider the problem of understanding the structure of measurable tilings $F \odot A = X$ of $X$ by a measurable tile $A…

We investigate tiling properties of spectra of measures, i.e., sets $\Lambda$ in $\br$ such that $\{e^{2\pi i \lambda x}: \lambda\in\Lambda\}$ forms an orthogonal basis in $L^2(\mu)$, where $\mu$ is some finite Borel measure on $\br$. Such…

In some recent papers the classical `splitting necklace theorem' is linked in an interesting way with a geometric `pattern avoidance problem'. We explore the topological constraints on the existence of a (relaxed) measurable coloring of R^d…

In the first part of this paper, we formulate a general setting in which to study the ergodic theory of differentiable $\mathbb{Z}^d$-actions preserving a Borel probability measure. This framework includes actions by $C^{1+\text{H\"older}}$…

This paper considers $n$-ribbon tilings of general regions and their per-tile entropy (the binary logarithm of the number of tilings divided by the number of tiles). We show that the per-tile entropy is bounded above by $\log_2 n$. This…

We develop a recursive formula for counting the number of rectangulations of a square, i.e the number of combinatorially distinct tilings of a square by rectangles. Our formula specializes to give a formula counting generic rectangulations,…

This study explores the properties of the function which can tile the field $\mathbb{Q}_p$ of $p$-adic numbers by translation. It is established that functions capable of tiling $\mathbb{Q}_p$ is by translation uniformly locally constancy.…

We introduce a partial decidability protocol for the Wang tiling problem (which is the prototype of undecidable problems in combinatorics and statistical physics) by constructing a suitable mapping from tilings of finite squares of…

This paper characterizes when an $m \times n$ rectangle, where $m$ and $n$ are integers, can be tiled (exactly packed) by squares where each has an integer side length of at least 2. In particular, we prove that tiling is always possible…

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…

Let n integer greater or equal to 4 and even and let T_n be the set of ribbon L-shaped n-ominoes. We study tiling problems for regions in a square lattice by T_n. Our main result shows a remarkable rigidity property: a tiling of the first…