Papers
Topics
Authors
Recent
Search
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.

Authors (1)
  1. Han Yu 

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.