Related papers: Keller properties for integer tiling
Tilings of a surface of negative Euler characteristic by n-gons with n\ge 7 is a finite problem. One extreme of the finite problem is single tile tilings. We develop the algorithm for finding all the single tile tilings and present the…
A tiling is said to have infinite local complexity (ILC) if it contains infinitely many two-tile patches up to rigid motions. In this work, we provide examples of substitution rules that generate tilings with ILC. The proof relies on…
Rosengren found an explicit formula for a certain weighted enumeration of lozenge tilings of a hexagon with an arbitrary triangular hole. He pointed out that a certain ratio corresponding to two such regions has a nice product formula. In…
The Hirsch Conjecture (1957) stated that the graph of a $d$-dimensional polytope with $n$ facets cannot have (combinatorial) diameter greater than $n-d$. That is, that any two vertices of the polytope can be connected by a path of at most…
Rohatgi and the author recently proved a shuffling theorem for lozenge tilings of `doubly-dented hexagons' (arXiv:1905.08311). The theorem can be considered as a hybrid between two classical theorems in the enumeration of tilings:…
The classical honeycomb conjecture asserts that any partition of the plane into regions of equal area has perimeter at least that of the regular hexagonal honeycomb tiling. Pappus discusses this problem in his preface to Book V. This paper…
This paper views the honeycomb conjecture and the Kepler problem essentially as extreme value problems and solves them by partitioning 2-space and 3-space into building blocks and determining those blocks that have the universal extreme…
We find explicit subdivision rules for all special cubulated groups. A subdivision rule for a group produces a sequence of tilings on a sphere which encode all quasi-isometric information for a group. We show how these tilings detect…
The notion of weak tiling played a key role in the proof of Fuglede's spectral set conjecture for convex domains, due to the fact that every spectral set must weakly tile its complement. In this paper, we revisit the notion of weak tiling…
This paper introduces two tiles whose tilings form a one-parameter family of tilings which can all be seen as digitization of two-dimensional planes in the four-dimensional Euclidean space. This family contains the Ammann-Beenker tilings as…
We give a computer-based proof of the following fact: If a square is divided into seven or nine convex polygons, congruent among themselves, then the tiles are rectangles.
Let $f: \mathbb{C}[x,y] \to \mathbb{C}[x,y]$ be a $\mathbb{C}$-algebra endomorphism having an invertible Jacobian. We show that for such $f$, if, in addition, the group of invertible elements of $\mathbb{C}[f(x),f(y),x][1/v] \subset…
The aim of this paper is to study certain properties of the Kullback-Leibler distance between two positive integer numbers or between two ideals. We present some results related the entropy of a positive integer number and the divergence of…
In the present paper, as we did previously in [7], we investigate the relations between the geometric properties of tilings and the algebraic properties of associated relational structures. Our study is motivated by the existence of…
In this paper, we indicate a new way to define coordinates for the tiles of the tilings $\{p,3\}$ and $\{p$$-$$2,4\}$ where the natural number $p$ satisfies $p\geq 7$.
In \cite{BCKM} it was shown that "Tiling implies Spectral" holds for a union of three intervals and the reverse implication was studied under certain restrictive hypotheses on the associated spectrum. In this paper, we reinvestigate the…
A square tiling of the unit square is said to have the minimal tile property if the smallest tile can tile all the other tiles. We show that in such a tiling, the smallest tile cannot be too small.
Convex hexagons that can tile the plane have been classified into three types. For the generic cases (not necessarily convex) of the three types and two other special cases, we classify tilings of the plane under the assumption that all…
If a finite set $A$ tiles the integers by translations, it also admits a tiling whose period $M$ has the same prime factors as $|A|$. We prove that the minimal period of such a tiling is bounded by $\exp(c(\log D)^2/\log\log D)$, where $D$…
An equilateral triangle cannot be dissected into finitely many mutually incongruent equilateral triangles [Tutte 1948]. Therefore Tuza [Tuza 1991] asked for the largest number $s=s(n)$ such that there is a tiling of an equilateral triangle…