Related papers: Hexagonal Tilings: Tutte Uniqueness
Let $T$ be a tile in $\mathbb{Z}^n$, meaning a finite subset of $\mathbb{Z}^n$. It may or may not tile $\mathbb{Z}^n$, in the sense of $\mathbb{Z}^n$ having a partition into copies of $T$. However, we prove that $T$ does tile $\mathbb{Z}^d$…
I show how to express the question of whether a polyform tiles the plane isohedrally as a Boolean formula that can be tested using a SAT solver. This approach is adaptable to a wide range of polyforms, requires no special-case code for…
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.…
In this paper we enumerate the centrally symmetric lozenge tilings of a hexagon with a shamrock removed from its center. Our proof is based on a variant of Kuo's graphical condensation method in which only three of the four involved…
In this paper, we develop the mathematical tools needed to explore isotopy classes of tilings on hyperbolic surfaces of finite genus, possibly nonorientable, with boundary, and punctured. More specifically, we generalize results on…
Integer compositions, integer partitions, Fibonacci numbers, and generalizations of these have recently been shown to be interconnected via two-toned tilings of horizontal grids. In this article, we present refinements of two-toned tilings,…
Tiling planar regions with dominoes is a classical problem in which the decision and counting problems are polynomial. We prove a variety of hardness results (both NP- and #P-completeness) for different generalizations of dominoes in three…
We consider orthogonal polynomials on the surface of a double cone or a hyperboloid of revolution, either finite or infinite in axis direction, and on the solid domain bounded by such a surface and, when the surface is finite, by…
The Tutte polynomial is the most general invariant of matroids and graphs that can be computed recursively by deleting and contracting edges. We generalize this invariant to any class of combinatorial objects with deletion and contraction…
A recent elegant result of Akrobotu et al. states that a triangulation of any convex polyomino is word-representable if and only if it is 3-colorable. In this paper, we generalize a particular case of this result by showing that the result…
This paper presents a detailed symbolic approach to the study of self-similar tilings. It uses properties of addresses associated with graph-directed iterated function systems to establish conjugacy properties of tiling spaces. Tiles may be…
A random tiling of rectangles and triangles displaying a decagonal phase is solved by Bethe Ansatz. Analogously to the solutions of the dodecagonal square triangle and the octagonal rectangle triangle tiling an exact expression for the…
We compute the number of rhombus tilings of a hexagon with sides $N,M,N,N,M,N$, which contain a fixed rhombus on the symmetry axis that cuts through the sides of length $M$.
We completely classify edge-to-edge tilings of the sphere by congruent quadrilaterals. As part of the classification, we also present a modern version of the classification of edge-to-edge tilings of the sphere by congruent triangles.…
A celebrated result of F. Jaeger states that the Tutte polynomial of a planar graph is determined by the HOMFLY polynomial of an associated link. Here we are interested in the converse of this result. We consider the question `to what…
We study here slopes of periodicity of tilings. A tiling is of slope if it is periodic along direction but has no other direction of periodicity. We characterize in this paper the set of slopes we can achieve with tilings, and prove they…
In this paper we study algorithms for tiling problems. We show that the conditions $(T1)$ and $(T2)$ of Coven and Meyerowitz, conjectured to be necessary and sufficient for a finite set $A$ to tile the integers, can be checked in time…
We study the minimal complexity of tilings of a plane with a given tile set. We note that every tile set admits either no tiling or some tiling with O(n) Kolmogorov complexity of its n-by-n squares. We construct tile sets for which this…
If every vertex in a map has one out of two face-cycle types, then the map is said to be $2$-semiequivelar. A 2-uniform tiling is an edge-to-edge tiling of regular polygons having $2$ distinct transitivity classes of vertices. Clearly, a…
We compute the number of rhombus tilings of a hexagon with sides $N,M,N,N,M,N$, which contain a fixed rhombus on the symmetry axis. A special case solves a problem posed by Jim Propp.