2000 character limit reached
Cube packings in Euclidean spaces
Published 17 Nov 2017 in math.CA | (1711.06544v3)
Abstract: In this paper we study some cube packing problems. In particular we are interested in compact subsets of $\mathbb{R}n,n\geq 2$, which contain boundaries of cubes with all side lengths in $(0,1)$. We show here that such sets must have lower box dimension at least $n-0.5$ and we will also provide sharp examples. We also show here that such sets must be large in general in a precise sense which is also introduced in this paper.
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.