Related papers: Tiling Parity Results and the Holey Square Solutio…
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…
In this paper we consider the problem of finding pairs of triangles whose sides are perfect squares of integers, and which have a common perimeter and common area. We find two such pairs of triangles, and prove that there exist infinitely…
Conway and Lagarias showed that certain roughly triangular regions in the hexagonal grid cannot be tiled by shapes Thurston later dubbed tribones. Here we study a two-parameter family of roughly hexagonal regions in the hexagonal grid and…
In this thesis we will present and discuss various results pertaining to tiling problems and mathematical logic, specifically computability theory. We focus on Wang prototiles, as defined in [32]. We begin by studying Domino Problems, and…
Answering a question of Benjamini & Schramm [8], we show that the Poisson boundary of any planar, uniquely absorbing (e.g. one-ended and transient) graph with bounded degrees can be realised geometrically as a circle, namely as the boundary…
In contrast to many known results concerning periodic tilings of the Euclidean plane with pentagons, here tilings with rotational symmetry are investigated. A certain class of convex pentagons is introduced. It can be shown that for any…
A semi-regular tiling of the hyperbolic plane is a tessellation by regular geodesic polygons with the property that each vertex has the same vertex-type, which is a cyclic tuple of integers that determine the number of sides of the polygons…
Translational tiling problems are among the most fundamental and representative undecidable problems in all fields of mathematics. Greenfeld and Tao obtained two remarkable results on the undecidability of translational tiling in recent…
TThe prototypical problem we study here is the following. Given a $2L\times 2L$ square, there are approximately $\exp(4KL^2/\pi )$ ways to tile it with dominos, i.e. with horizontal or vertical $2\times 1$ rectangles, where $K\approx 0.916$…
We use the subgraph replacement method to prove a simple product formula for the tilings of an 8-vertex counterpart of Propp's quasi-hexagons (Problem 16 in New Perspectives in Geometric Combinatorics, Cambridge University Press, 1999),…
A finite set of integers $A$ tiles the integers by translations if $\mathbb{Z}$ can be covered by pairwise disjoint translated copies of $A$. Restricting attention to one tiling period, we have $A\oplus B=\mathbb{Z}_M$ for some…
We compute the rational cohomology of the universal family of smooth cubic surfaces using Vassiliev's method of simplicial resolution. Modulo embedding, the universal family has cohomology isomorphic to that of $\mathbb{P}^2$. A consequence…
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…
We use the method of tiling to give elementary combinatorial proofs of some celebrated $q$-series identities, such as Jacobi triple product identity, Rogers-Ramanujan identities, and some identities of Rogers. We give a tiling proof of the…
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…
Edge-to-edge tilings of the sphere by congruent quadrilaterals are completely classified in a series of three papers. This second one applies the powerful tool of trigonometric Diophantine equations to classify the case of…
This article is dedicated to domino tilings of square grids. In each of these grids domino tilings are represented using linear-recurrent sequences. For different grids are determined new dependencies.
Several articles deal with tilings with various shapes, and also a very frequent type of combinatorics is to examine the walks on graphs or on grids. We combine these two things and give the numbers of the shortest walks crossing the tiled…
Every Latin square has three attributes that can be even or odd, but any two of these attributes determines the third. Hence the parity of a Latin square has an information content of 2 bits. We extend the definition of parity from Latin…
We consider the subgroup of the abelian sandpile group of the grid graph consisting of configurations of sand that are symmetric with respect to central vertical and horizontal axes. We show that the size of this group is (i) the number of…