On the nonexistence of k-reptile tetrahedra
From MaRDI portal
Publication:644820
DOI10.1007/S00454-011-9334-ZzbMATH Open1270.52014arXiv1006.1807OpenAlexW2112820001MaRDI QIDQ644820FDOQ644820
Authors: Zuzana Safernova, Jiří Matoušek 
Publication date: 7 November 2011
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Abstract: A d-dimensional simplex S is called a k-reptile if it can be tiled without overlaps by simplices S_1,S_2,...,S_k that are all congruent and similar to S. For d=2, k-reptile simplices (triangles) exist for many values of k and they have been completely characterized by Snover, Waiveris, and Williams. On the other hand, for d > 2, only one construction of k-reptile simplices is known, the Hill simplices, and it provides only k of the form m^d, m=2,3,.... We prove that for d=3, k-reptile simplices (tetrahedra) exist only for k=m^3. This partially confirms a conjecture of Hertel, asserting that the only k-reptile tetrahedra are the Hill tetrahedra. Our research has been motivated by the problem of probabilistic packet marking in theoretical computer science, introduced by Adler in 2002.
Full work available at URL: https://arxiv.org/abs/1006.1807
Recommendations
- scientific article; zbMATH DE number 6302986
- On the nonexistence of \(k\)-reptile simplices in \(\mathbb R^3\) and \(\mathbb R^4\)
- Nonexistence of 2-Reptile Simplices
- The non-existence of certain regular generalized polygons
- scientific article; zbMATH DE number 4126185
- On nontriangulable polyhedra
- DISCLIKE LATTICE REPTILES INDUCED BY EXACT POLYOMINOES
- The Nonexistence of Certain Topological Polygons
- scientific article; zbMATH DE number 1204373
- On the nonexistence of pseudo-generalized quadrangles
Three-dimensional polytopes (52B10) Tilings in (n) dimensions (aspects of discrete geometry) (52C22)
Cites Work
- Self-Similar Sets 5. Integer Matrices and Fractal Tilings of ℝ n
- Which Tetrahedra Fill Space?
- Title not available (Why is that?)
- Self-similar simplices
- On 2-reptiles in the plane
- Rep-tiling for triangles
- Crystallographic reptiles
- Three infinite families of tetrahedral space-fillers
- Tradeoffs in probabilistic packet marking for IP traceback
- Towards asymptotic optimality in probabilistic packet marking
- Self‐affine Lattice Reptiles with Two Pieces in IRn
- Title not available (Why is that?)
- Nonexistence of 2-Reptile Simplices
- Matrices and graphs in Euclidean geometry
- Geometry of the simplex in $E_n$. III.
Cited In (13)
- Computer geometry: rep-tiles with a hole
- Title not available (Why is that?)
- On the nonexistence of \(k\)-reptile simplices in \(\mathbb R^3\) and \(\mathbb R^4\)
- Towards asymptotic optimality in probabilistic packet marking
- A comparison between the XFEM and a boundary-fitted mesh method for the simulation of rigid particles in Cahn-Hilliard fluids
- Some replicating simplices other than Hill-simplices
- Red refinements of simplices into congruent subsimplices
- DISCLIKE LATTICE REPTILES INDUCED BY EXACT POLYOMINOES
- Title not available (Why is that?)
- Nonexistence of 2-Reptile Simplices
- On 2-reptiles in the plane
- No acute tetrahedron is an 8-reptile
- Fractal rep tiles of \(\mathbb{R}^2\) and \(\mathbb{R}^3\) using integer matrices
This page was built for publication: On the nonexistence of \(k\)-reptile tetrahedra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q644820)
