Related papers: A pentagonal number theorem for tribone tilings

A Heron triangle is one that has all integer side lengths and integer area, which takes its name from Heron of Alexandria's area formula. From a more relaxed point of view, if rescaling is allowed, then one can define a Heron triangle to be…

Suppose $P$ is a symmetric convex polygon in the plane. We give a polynomial time algorithm that decides if $P$ can tile the plane by transations at some level (not necessarily at level one; this is multiple tiling). The main technical…

We consider tilings of the plane with 12-fold symmetry obtained by the cut and projection method. We compute their cohomology groups using the techniques introduced by the second author, Hunton and Kellendonk. To do this we completely…

We use the Cayley Trick to study polyhedral subdivisions of the product of two simplices. For arbitrary (fixed) $l$, we show that the numbers of regular and non-regular triangulations of $\Delta^l\times\Delta^k$ grow, respectively, as…

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…

A classic result of Brooks, Smith, Stone and Tutte associates to any finite planar network with distinguished source and sink vertices, a tiling of a rectangle by smaller subrectangles whose aspect ratios are given by the conductances of…

This paper addresses the question of whether a single tile with nearest neighbor matching rules can force a tiling in which the tiles fall into a large number of isohedral classes. A single tile is exhibited that can fill the Euclidean…

We introduce {\em quadri-tilings} and show that they are in bijection with dimer models on a {\em family} of graphs $\{R^*\}$ arising from rhombus tilings. Using two height functions, we interpret a sub-family of all quadri-tilings, called…

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…

Triangle presentations are combinatorial structures on finite projective geometries which characterize groups acting simply transitively on the vertices of a locally finite building of type $\tilde{\text{A}}_{n-1}$ ($n\ge3$). From a type…

In this paper, we consider domino tilings of regions of the form $\mathcal{D} \times [0,n]$, where $\mathcal{D}$ is a simply connected planar region and $n \in \mathbb{N}$. It turns out that, in nontrivial examples, the set of such tilings…

Tilings of a surface of negative Euler characteristic by n-gons with n\ge 7 is a finite problem. We develop the algorithm for finding all the tilings for fixed number of tiles and present the calculation for tilings of surfaces of small…

Can you decide if there is a coincidence in the numbers counting two different combinatorial objects? For example, can you decide if two regions in $\mathbb{R}^3$ have the same number of domino tilings? There are two versions of the…

The relevance of this paper lies in the fact that it resolves two previously unsolved open problems. In the first part of the paper, a new lemma is proved, from which it follows that if there exists a triangle with integer sides and…

We show that the following problem is undecidable: given two polygonal prototiles, determine whether the plane can be tiled with rotated and translated copies of them. This improves a result of Demaine and Langerman [SoCG 2025], who showed…

Kedlaya, Kolpakov, Poonen, and Rubinstein classified tetrahedra all of whose dihedral angles are rational multiples of $\pi$ into two one-parameter families (a Hill family and a new family) and $59$ sporadic tetrahedra. In this paper, we…

In 2022, Olivier Longuet, a French mathematics teacher, created a game called the \textit{calissons puzzle}. Given a triangular grid in a hexagon and some given edges of the grid, the problem is to find a calisson tiling such that no input…

We show how to determine if a given simple rectilinear polygon can be tiled with rectangles, each having an integer side.

Proctor's work on staircase plane partitions yields an enumeration of lozenge tilings of a halved hexagon on the triangular lattice. Rohatgi later extended this tiling enumeration to a halved hexagon with a triangle cut off from the…

We study the problem of perfect tiling in the plane and exploring the possibility of tiling a rectangle using integral distinct squares. Assume a set of distinguishable squares (or equivalently a set of distinct natural numbers) is given,…