Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Dissections and valuations (Hilbert's third problem, etc.) (52B45) Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Tilings in (n) dimensions (aspects of discrete geometry) (52C22)
Abstract: Brandolini et al. conjectured that all concrete lattice polytopes can multitile the space. We disprove this conjecture in a strong form, by constructing an infinite family of counterexamples in .
Recommendations
Cites work
- A brief introduction to valuations on lattice polytopes
- Acute triangulations of polyhedra and \(\mathbb R^N\)
- Aperiodic tilings of the hyperbolic plane by convex polygons
- Computing the Continuous Discretely
- Convex Bodies The Brunn-MinkowskiTheory
- Convex Polygons that Cannot Tile the Plane
- scientific article; zbMATH DE number 3968590 (Why is no real title available?)
- scientific article; zbMATH DE number 3522749 (Why is no real title available?)
- scientific article; zbMATH DE number 1405493 (Why is no real title available?)
- scientific article; zbMATH DE number 3027936 (Why is no real title available?)
- Integer points in polyhedra
- Lectures on Polytopes
- Minkowski valuations on lattice polytopes
- Perspectives on scissors congruence
- Pick's theorem and convergence of multiple Fourier series
- Polynomials Associated with Finite Gell-Complexes
- Polytopes that fill \(\mathbb{R}^ n\) and scissors congruence
- Scissors congruences, group homology and characteristic classes
- Structure results for multiple tilings in 3D
- The century of Hilbert's third problem
- Translational tilings by a polytope, with multiplicity
- Valuations and Euler-Type Relations on Certain Classes of Convex Polytopes
- Valuations on lattice polytopes
Cited in
(4)
This page was built for publication: Concrete polytopes may not tile the space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3299379)