← All papers
First page of Triangle Tiling: The case $3α+ 2β= π$

Triangle Tiling: The case $3α+ 2β= π$

Michael Beeson

math.MG Jun 5, 2012 · v6
All results on triangle tilings with 3α+2β=π are formalized in Lean, and related Lean-certified search proofs for non-existence of N-tilings are discussed.
An $N$-tiling of triangle $ABC$ by triangle $T$ (the “tile”) is a way of writing $ABC$ as a union of $N$ copies of $T$ overlapping only at their boundaries. Let the tile $T$ have angles $(α,β,γ)$, and sides $(a,b,c)$. This paper takes up the case when $3α+ 2β= π$. Then there are (as was already known) exactly five possible shapes of $ABC$ not similar to $T$: either $ABC$ is isosceles with base angles $α$, $β$, or $α+β$, or the angles of $ABC$ are $(2α,β,α+β)$, or the angles of $ABC$ are $(2α, α, 2β)$. We prove that the tile is rational (the ratios of its sides are rational). We then exhibit several families of previously unknown tilings. We also exhibit, for each shape, a Diophantine equation in $N$ and the parameters of the tile that must have a solution whenever there is a tiling of some triangle of that shape. By means of these Diophantine equations, some conclusions about the possible values of $N$ are drawn. We prove, for example, that there is no $N$-tiling with $N$ prime when $3α+ 2β= π$, for three of the five shapes; that question remains open for the shape $(2α,β,α+β)$ and for isosceles triangles with base angles $β$. These equations also imply that for each $N$, there is a finite set of possibilities for the tile $(a,b,c)$ and the triangle $ABC$. (Usually, but not always, there is just one possible tile.) For each of the five shapes, we give a construction method that works under certain sufficient conditions, but there remain values of $N$ that satisfy our necessary conditions and for which we do not know whether a tiling exists. All results have been formalized in Lean.

The paper classifies N-tilings of a triangle ABC by congruent copies of a tile T whose angles satisfy 3α+2β=π. Five shapes of ABC not similar to T are possible, and the open questions are which tiles and which values of N can occur for each.

Vertex-type analysis, a black-and-white coloring of tilings and a new direction-based invariant Φ yield coloring and area equations. From these the tile is shown to be rational, and a Diophantine equation in N and the tile parameters is derived for each shape. New tiling families such as the triquadratic tilings are constructed, and all results are formalized in Lean.

The tile must be rational. Three of the five shapes admit no N-tiling with N prime, and for each N only finitely many tiles and triangles are possible. Several previously unknown tiling families are exhibited, including a 28-tiling, and Lean-certified non-existence proofs are reported for specific N.