Solution of Erd s Problem 633
summary
The gist
It is well-known that any triangle can be tiled (cut) into any square number of congruent triangles similar to the original triangle <ref:2604.03609#pg2>.
In short
The paper classifies all triangles that can be tiled by a non-square number of congruent triangles. It shows that this set is countable up to similarity, and establishes eight specific conditions based on triangle angles for such tilings to exist. This classification settles Erdős Problem 633 by characterizing the exceptions where a triangle cannot be tiled into a square number of tiles unless it is isosceles or meets specific geometric constraints.
Key concepts
- Non-square Tilings
- This refers to tiling a triangle with congruent copies of itself such that the total number of tiles used is not a perfect square. The paper investigates which triangles allow for such tilings, moving beyond the known fact that any triangle can be tiled by an arbitrary number of similar triangles.
- Reptile Tilings
- A tiling is called 'reptile' if the resulting shape (the union of the tiles) is similar to the original triangle. The paper analyzes tilings that are *not* similar to the original triangle, linking this property to whether the number of tiles must be a square.
- Elliptic Curves and Rank
- The proof uses number theory by relating tiling parameters to Diophantine equations that define elliptic curves. Showing these curves have a rank of zero severely restricts possible solutions, proving that non-square tilings are rare and only occur under very specific, constrained conditions.
- Angle Conditions
- Theorem 1 provides eight specific geometric conditions based on the angles (A, B, C) of the triangle. These conditions dictate precisely when a triangle can be tiled into a non-square number of congruent triangles, involving relationships like C = π/3 or B = 2A.
Terminology used across episodes
This episode discusses
- Solution of Erd s Problem 633 · Paper Radio
- Triangle Tiling: The case 3 alpha + 2 beta = pi · Paper Radio
- Tiling an Equilateral Triangle · Paper Radio
- Tilings of an Isosceles Triangle · Paper Radio
- Rationality of certain triangle tilings
- Tiling Triangles with 2 pi/3 Angles
The paper
Solution of Erd s Problem 633 · Read on arXiv
We classify triangles that can be tiled only into a square number of congruent triangles, settling Erdős Problem 633.
Transcript
Introduction to the show: ident: Mathematics. The day in mathematics: new theorems, new proofs, and what they open.
Ada: I'm Ada.
Emmy: And I'm Emmy, here with Kolya.
Ada: We're looking at the paper: "Solution of Erd s Problem 633".
Emmy: Here's the gist of the paper. It is well-known that any triangle can be tiled (cut) into any square number of congruent triangles similar to the original triangle <ref:2604.03609#pg2>.
Ada: Our work shows that, aside from isosceles triangles, this set of triangles is countable (up to similarity) <ref:2604.03609#pg2>.
Emmy: Classification of Non-Square Tilings The main result settles Erd˝os Problem 633 by classifying all triangles that can be tiled into a non-square number of congruent triangles <ref:2604.03609#pg2>.
Ada: Theorem 1 states that a triangle T admits a non-square tiling if and only if it satisfies one of eight specific conditions based on its angles (A, B, C) <ref:2604.03609#pg2>.
Paper summary: Ada: So we're looking at this paper, "Solution of Erd s Problem six hundred thirty-three" and what they've done there <ref:2604.03609#pg1>. Essentially, it settles the question about whether any triangle can be tiled by a non-square number of copies of another triangle similar to it.
Emmy: Right, the main thing is that they classify all triangles that can be tiled into a non-square number of congruent triangles, and aside from isosceles triangles, this set of triangles is countable up to similarity.
Kolya: That sounds like a lot to track, Ada. What's the core claim they are trying to prove about the tiling numbers themselves?
Ada: They show that if a triangle T has any tiling into congruent triangles that aren't similar to T, then every such tiling must have a non-square number of tiles, unless one of eight specific conditions based on its angles is met <ref:2604.03609#pg2>.
Emmy: So they start by defining what a square tiling is and what a reptiling is, and then they aim to find the exceptions where you can have any square number of tiles.
Kolya: I'm curious about those conditions. Are we talking about some simple angle relationships, or something more complex involving trigonometry?
Ada: It involves specific things like being isosceles, having certain right triangles with integer side ratios, and satisfying various trigonometric rationality constraints <ref:2604.03609#pg2>.
Emmy: That's where the algebraic geometry comes in; they connect these geometric constraints to number theory to prove that for most triangles, every square tiling must be a reptiling.
Ada: Exactly, and the paper shows that if you have a non-reptile tiling of T, the number of tiles cannot be a square unless T is isosceles or it satisfies one of those eight conditions <ref:2604.03609#pg2>.
Kolya: That sounds like they are using some kind of Diophantine equation analysis to show that the number of tiles N just can't be a perfect square under those circumstances.
Emmy: They use number theory on equations derived from the area ratio, showing that the ranks of these elliptic curves are zero, which limits solutions to torsion points <ref:2604.03609#pg3>.
Ada: So they're basically saying that if you want a square number of tiles, you'd need a specific kind of solution to an equation that just doesn't exist for most triangles.
Paper summary: Kolya: That means for the vast majority of triangles, any tiling into congruent pieces is either similar or it has a non-square number of tiles.
Ada: The forward direction they prove, showing necessity, relies on analyzing non-reptile tilings and applying theorems about group types, like Group one or Group two <ref:2604.03609#pg6>.
Emmy: And Lemma twelve shows that if you have a non-isosceles triangle T with a non-reptile tiling, one of four angle conditions must hold: C equals pi over three, B equals two A, C equals A over two plus B, or C equals two A plus B over two <ref:2604.03609#pg6>.
Kolya: Those angle conditions sound very specific. What does that imply for the actual physical tiling you're seeing?
Ada: Proposition thirteen then systematically relates the angles of T to the angles of the tile R based on those four cases through a complex table <ref:2604.03609#pg7>.
Emmy: It sounds like they are mapping out all the possible ways a non-similar tiling can happen based purely on the shape's geometry.
Ada: Then they move to the right-to-left direction, which is proving sufficiency, by actually exhibiting tilings for each of those eight cases listed in Theorem one <ref:2604.03609#pg10>.
Kolya: So they're not just proving that these conditions *must* hold if you have a non-square tiling, but they are showing that if you satisfy one of those conditions, a non-square tiling actually exists.
Emmy: For cases one through eight, they use methods like refining dissections into similar triangles or biquadratic tilings where the number of tiles N is expressed as a sum of two squares <ref:2604.03609#pg24>.
Ada: And for case seven, they show that if C equals A over two plus B and two sine of A over four is rational, then the number of tiles N equals two K squared minus M squared, which is a square only when two K squared minus M squared is itself a square <ref:2604.03609#pg18>.
Kolya: That part about N equaling two to the k squared minus M squared being a square only under specific circumstances makes sense from a number theory standpoint. What happens when we look at cases where the angles are incommensurable?
Ada: In those cases, they show that the number of tiles N cannot be a square because they analyze Diophantine equations leading to elliptic curves whose rank is zero <ref:2604.03609#pg12>.
Paper summary: Emmy: Proposition twenty-one demonstrates that for certain rational values of t, N cannot be a square because the corresponding elliptic curve has only the trivial solution of zero, zero <ref:2604.03609#pg13>.
Ada: So they rule out possibilities where angles are rational multiples of pi as well, which is important for understanding the general case.
Kolya: It sounds like they've built a really robust argument here by connecting the geometric setup to hard number theoretic constraints on those tiling numbers. What about the uniqueness of the tile itself?
Ada: Theorem thirty-two asserts that for non-isosceles triangles admitting a non-square, non-reptile tiling, the tile is uniquely determined by T unless T matches specific rows in that classification table <ref:2604.03609#pg22>.
Emmy: That uniqueness argument is strong because it shows that if you try to find another tile that fits, it would imply the angles are commensurable, which contradicts the starting point of their theorem <ref:2604.03609#pg22>.
Ada: So they're not just finding a tiling; they're characterizing the specific geometric relationship between T and R for these non-square tilings.
Kolya: Looking at the examples, like the seventy-seven-tiling with N equals seventy-seven or the twenty-eight-tiling with N equals twenty-eight those are members of what they call "triquadratic tilings" <ref:2604.03609#pg31>.
Ada: Those examples illustrate that these non-square tilings can exist even when the angles are incommensurable, which is a key point for this paper.
Emmy: And the complexity of these tilings is quite high; some numbers exceed one million tiles <ref:2604.03609#pg19>.
Ada: So to wrap up, the main result of this paper is that aside from isosceles triangles, the set of triangles that can be tiled into a non-square number of congruent triangles is countable up to similarity <ref:2604.03609#pg22>.
Kolya: It settles Erd˝os Problem six hundred thirty-three by characterizing the exceptions to generic square tilings <ref:2604.03609#pg2>, showing that for most triangles, every square tiling must be a reptiling <ref:2604.03609#pg22>.
Ada: It’s a deep dive into classifying those exceptions based on eight specific conditions derived from geometric and number-theoretic constraints <ref:2604.03609#pg2>.
Emmy: So the title, "Solution of Erd s Problem six hundred thirty-three" suggests they've managed to solve that problem by providing a complete classification of which triangles can have non-square tilings <ref:2604.03609#pg1>.
Ada: It’s a comprehensive picture of what makes a triangle special in terms of its tiling properties.
Conclusion: Ada: So we've seen how they classify these triangles that can be tiled in non-square numbers, and now we're looking at what this whole paper actually means for tiling theory.
Emmy: It’s about this paper titled "Solution of Erd s Problem six hundred thirty-three" and it tackles the question of which triangles allow for a tiling by a non-square number of congruent copies.
Kolya: Basically, they've got this classification system based on eight specific angle conditions that determine if you can have any square number of tiles or not.
Ada: It seems the main achievement here is providing a complete characterization—an "if and only if"—for these non-square tilings, which settles that problem for most cases.
Emmy: They show that aside from isosceles triangles, this set of triangles is countable up to similarity, which is pretty significant because it gives us a way to measure the complexity of these shapes.
Kolya: I mean, the fact that they link these geometric constraints directly to number theory—like those elliptic curve ranks being zero—that’s where it gets interesting for probability.
Ada: Exactly. It suggests that for most triangles, if you try to tile them into a square number of pieces, you're almost certainly looking at a reptiling instead.
Emmy: It gives us a clear map of the exceptions to the generic case, so we know exactly what kind of geometry you need to look for when hunting for those non-square tilings.
More episodes
- 2509.05860-Concentration Inequalities for Branching Random Walks
- 2509.19309-Small Prime Primitive Roots in Arithmetic Progressions
- 2509.21830-Noncollapsing for Curvature Flows with Inhomogeneous Speeds
- 2510.08346-Separability and Submetrizability in Locally Convex Spaces
- 2510.27290-Borel Combinatorics of Schreier Graphs of Z-actions
- 2511.13500-Sampling Density for Gabor Phase Retrieval
- 2511.19161-Linear dynamics of random products of weighted shifts
- 2511.21548-Metastability of diffusion processes in narrow tubes
- 2512.01536-Abelian approximations for bicrossed products
- 2601.02524-Lagrangian slice disks with symplectomorphic exteriors