Decomposition of a cube into nearly equal smaller cubes

From MaRDI portal
Publication:4575436

DOI10.4169/AMER.MATH.MONTHLY.124.10.895zbMATH Open1391.52029arXiv1511.05301OpenAlexW2964135469MaRDI QIDQ4575436FDOQ4575436


Authors: Peter Frankl, A. Meir, János Pach Edit this on Wikidata


Publication date: 13 July 2018

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

Abstract: Let d be a fixed positive integer and let epsilon>0. It is shown that for every sufficiently large ngeqn0(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 ngeqn0, 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.


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




Recommendations



Cites Work


Cited In (5)





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)