Polytopes that fill R^ n and scissors congruence
A nice connection between two problems of D. Hilbert (namely, the eighteenth and the third one) is presented. First, Hilbert asked for polyhedra that can fill the space with congruent copies and do not appear as fundamental regions of groups of motions. (An answer was given by K. Reinhardt in 1928, who described such a non-convex polyhedron in \(\mathbb{R}^ 3\).) Second, Hilbert referred to Euclidean scissors congruence of three-dimensional polyhedra of equal volume. (Two polyhedra \(P\) and \(Q\) are Euclidean scissors congruent if \(P\) can be cut up into finitely many pieces by plane cuts such that these pieces can be reassembled, by Euclidean motions, to form \(Q\). It was shown by M. Dehn in 1900 that the regular tetrahedron is not Euclidean scissors congruent to the 3-cube.) The authors prove that any convex or non-convex polyhedron \(P\), that can fill the 3-space with congruent copies, is Euclidean scissors congruent to a 3-cube. In view of his result mentioned above, M. Dehn derived invariants \(\Delta_{n,j} (P)\), \(1\leq j\leq n\), which gave necessary conditions for two (sets of) polytopes to be Euclidean scissors congruent in \(\mathbb{R}^ n\). Generalizing their necessary criterion stated above, the authors also show (by different methods) that any convex or non-convex polytope that can fill the \(n\)-space with congruent copies of itself satisfies \(\Delta_{n,j} (P) =0\) for \(1\leq j\leq n-1\). Moreover, they prove that any convex or non-convex polytope that fills \(\mathbb{R}^ n\) by translations is translation scissors congruent to an \(n\)-cube. [Editor's remarks: In an `Acknowledgment of priority' (pp. 359-360) the authors have given additional comments concerning prior work on these problems dealt with].
- A New Approach to Hilbert's Third Problem
- Non-Euclidean geometry and volumes of hyperbolic polyhedra
- Hilbert's third problem and Dehn invariant -- an elementarization with spherical triangles
- scientific article; zbMATH DE number 4088397
- Equidecomposability (scissors congruence) of polyhedra in R^3 and R^4 is algorithmically decidable: Hilbert's 3rd problem revisited
- A symmetric star body that tiles but not as a lattice
- Algebra of polytopes and homology of flag complexes
- Conditions necessaires et suffisantes pour l'équivalence des polyedres de l'espace euclidien à trois dimensions
- Convex bodies which tile space by translation
- Ergänzungsgleichheit \(k\)-dimensionaler Polyeder
- scientific article; zbMATH DE number 3128853 (Why is no real title available?)
- scientific article; zbMATH DE number 4024185 (Why is no real title available?)
- scientific article; zbMATH DE number 42879 (Why is no real title available?)
- scientific article; zbMATH DE number 3538433 (Why is no real title available?)
- scientific article; zbMATH DE number 3603927 (Why is no real title available?)
- scientific article; zbMATH DE number 3631495 (Why is no real title available?)
- scientific article; zbMATH DE number 3214168 (Why is no real title available?)
- scientific article; zbMATH DE number 3413439 (Why is no real title available?)
- scientific article; zbMATH DE number 4184301 (Why is no real title available?)
- Knotted lattice-like space fillers
- On Paving the Plane
- Quasicrystals: The view from Les Houches
- Sur la décomposition des polyedres
- Sur les tétraèdres équivalents à un cube
- Tetrahedra equivalent to cubes by dissection
- The Algebra of Polyhedra and the Dehn-Sydler Theorem.
- The algebra of polytopes in affine spaces.
- Theory of matching rules for the 3-dimensional Penrose tilings
- Three infinite families of tetrahedral space-fillers
- Three-dimensional analogs of the planar Penrose tilings and quasicrystals
- Translative Zerlegungsgleichheit der Polyeder des gewöhnlichen Raumes.
- Two more tetrahedra equivalent to cubes by dissection
- Translation scissors congruence
- Non-Euclidean geometry and volumes of hyperbolic polyhedra
- Cubic graphs, their Ehrhart quasi-polynomials, and a scissors congruence phenomenon
- On the nonexistence of \(k\)-reptile simplices in \(\mathbb R^3\) and \(\mathbb R^4\)
- A feasible algorithm for checking \(n\)-scissors congruence of polyhedra in \({\mathbb R}^d\)
- Concrete polytopes may not tile the space
- Equidecomposability (scissors congruence) of polyhedra in R^3 and R^4 is algorithmically decidable: Hilbert's 3rd problem revisited
- Scissors congruence, the golden ratio and volumes in hyperbolic 5-space
- Acute triangulations of polyhedra and \(\mathbb R^N\)
- Multi-tiling and equidecomposability of polytopes by lattice translates
- Spectral sets and weak tiling
- Hilbert's third problem and Dehn invariant -- an elementarization with spherical triangles
This page was built for publication: Polytopes that fill \(\mathbb{R}^ n\) and scissors congruence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1892432)
