Cube packings in Euclidean spaces

Abstract

In this paper we study some cube packing problems. In particular we are interested in compact subsets of Rn,n≥ 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.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…