2000 character limit reached
Perfectly packing a cube by cubes of nearly harmonic sidelength
Published 12 Apr 2022 in math.MG | (2204.06038v3)
Abstract: Let $d$ be an integer greater than $1$, and let $t$ be fixed such that $\frac{1}{d} < t < \frac{1}{d-1}$. We prove that for any $n_0$ chosen sufficiently large depending upon $t$, the $d$-dimensional cubes of sidelength $n{-t}$ for $n \geq n_0$ can perfectly pack a cube of volume $\sum_{n=n_0}\infty \frac{1}{n{dt}}$. Our work improves upon a previously known result in the three-dimensional case for when $1/3 < t \leq 4/11 $ and $n_0 = 1$ and builds upon recent work of Terence Tao in the two-dimensional case.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.