Decomposition of a cube into nearly equal smaller cubes

DOI10.4169/AMER.MATH.MONTHLY.124.10.895MaRDI QIDQ4575436zbMATH OpenOpenAlexFDO

Authors Peter Frankl, A. Meir, János Pach

Publication date 13 July 2018

Published in The American Mathematical Monthly (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Tilings in (n) dimensions (aspects of discrete geometry) (52C22)

Abstract: Let $d$ be a fixed positive integer and let $epsilon>0$. It is shown that for every sufficiently large $ngeq{n}_0(d,epsilon)$, the $d$-dimensional unit cube can be decomposed into exactly $n$ smaller cubes such that the ratio of the side length of the largest cube to the side length of the smallest one is at most $1+epsilon$. Moreover, for every $ngeq{n}_0$, there is a decomposition with the required properties, using cubes of at most $d+2$ different side lengths. If we drop the condition that the side lengths of the cubes must be roughly equal, it is sufficient to use cubes of two different sizes.

Recommendations

• A stability theorem on cube tessellations
• Decomposing cubes into smaller cubes
• On tiling the \(n\)-dimensional cube
• Dissecting d-cubes into smaller d-cubes
• Decomposition of sets of small or large boundary

Cites work

• scientific article; zbMATH DE number 3489232 (Why is no real title available?)
• Decomposition of a Cube into Smaller Cubes
• Simple perfect squared square of lowest order
• The dissection of rectangles into squares
• Unsolved problems in geometry
• Zur Abschätzung der Mindestzahl inkongruenter Quadrate, die ein gegebenes Rechteck ausfüllen

Cited in

(5)

• scientific article; zbMATH DE number 3557813 (Why is no real title available?)
• Dissecting Cuboids into Cuboids
• A stability theorem on cube tessellations
• scientific article; zbMATH DE number 1026076 (Why is no real title available?)
• Decomposing cubes into smaller cubes

This page was built for publication: Decomposition of a cube into nearly equal smaller cubes

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