Decomposition of a cube into nearly equal smaller cubes
From MaRDI portal
Abstract: Let be a fixed positive integer and let . It is shown that for every sufficiently large , the -dimensional unit cube can be decomposed into exactly 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 . Moreover, for every , there is a decomposition with the required properties, using cubes of at most 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
Cites work
- Decomposition of a Cube into Smaller Cubes
- scientific article; zbMATH DE number 3489232 (Why is no real title available?)
- 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
(6)- Dissecting d-cubes into smaller d-cubes
- Decomposing cubes into smaller cubes
- scientific article; zbMATH DE number 3557813 (Why is no real title available?)
- scientific article; zbMATH DE number 1026076 (Why is no real title available?)
- A stability theorem on cube tessellations
- Dissecting Cuboids into Cuboids
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)