On the nonexistence of $k$-reptile simplices in $\mathbb R^3$ and $\mathbb R^4$
Jan Kyn\v{c}l, Zuzana Pat\'akov\'a

TL;DR
This paper proves that in three and four dimensions, $k$-reptile simplices can only exist for specific values of $k$, specifically perfect cubes in 3D and perfect squares in 4D, simplifying previous proofs.
Contribution
The authors simplify the proof that $k$-reptile tetrahedra in 3D only exist for $k=m^3$ and establish a similar result for 4D, where such simplices only exist for $k=m^2$.
Findings
In 3D, $k$-reptile tetrahedra exist only for $k=m^3$.
In 4D, $k$-reptile simplices exist only for $k=m^2$.
Simplified previous proofs for the 3D case.
Abstract
A -dimensional simplex is called a -reptile (or a -reptile simplex) if it can be tiled by simplices with disjoint interiors that are all mutually congruent and similar to . For , triangular -reptiles exist for all of the form or and they have been completely characterized by Snover, Waiveris, and Williams. On the other hand, the only -reptile simplices that are known for , have , where is a positive integer. We substantially simplify the proof by Matou\v{s}ek and the second author that for , -reptile tetrahedra can exist only for . We then prove a weaker analogue of this result for by showing that four-dimensional -reptile simplices can exist only for .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
