A stability theorem on cube tessellations

DOI10.20382/JOCG.V9I1A13MaRDI QIDQ4626299zbMATH OpenOpenAlexFDO

Authors János Pach, Peter Frankl

Publication date 27 February 2019

Full work available at URL https://arxiv.org/abs/1807.05055

Mathematics Subject Classification ID

Tilings in (n) dimensions (aspects of discrete geometry) (52C22) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Abstract: It is shown that if a $d$-dimensional cube is decomposed into n cubes, the side lengths of which belong to the interval $left(1-frac1n^{1/d}+1,1ight],then$n$isaperfect$d$-th power and all cubes are of the same size. This result is essentially tight.

Recommendations

• Decomposition of a cube into nearly equal smaller cubes
• Decomposing cubes into smaller cubes
• Dissecting d-cubes into smaller d-cubes
• On the structure of cube tilings and unextendible systems of cubes in low dimensions
• A cube-covering problem.

Cited in

(7)

• Dissecting d-cubes into smaller d-cubes
• Decomposing cubes into smaller cubes
• On tiling the n-dimensional cube
• Casting light on cube dissections
• A stability theorem on fractional covering of triangles by edges
• Decomposition of a cube into nearly equal smaller cubes
• Sphere decompositions of hypercubes

This page was built for publication: A stability theorem on cube tessellations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4626299)