A note on perfect packing of d-dimensional cubes
From MaRDI portal
Publication:2200981
It is shown that the \(d\)-cubes \(C_n^t=[0,n^{-t}]^d\), \(n=1,2,\dots\), can be packed into the box \(B=[0,1]^{d-1} \times \left[0,\sum_{n=1}^\infty n^{-dt}\right]\) whenever \(1/d < t \le 2^{d-1}/(d2^{d-1}-1)\). That is, there exist images of all \(C_n^t\), \(n \ge 1\), under suitable translations or rotations that are subsets of \(B\) and have pairwise disjoint interiors. These packings are called perfect, since they cover \(B\) up to a remainder of measure zero.
Recommendations
Cited in
(16)- On the impossibility of packing space with different cubes
- A note on perfect packing of squares and cubes
- Guillotine cutting is asymptotically optimal for packing consecutive squares
- Efficient 1-space bounded hypercube packing algorithm
- Perfectly packing a square by squares of sidelength \(f(n)^{-t}\)
- Minimization of the container for packing of three cubes in dimension 4
- Packing copies of the n-cube into its third power
- Packing cubes into a block
- Perfectly packing a cube by cubes of nearly harmonic sidelength
- CUBE PACKINGS IN EUCLIDEAN SPACES
- Reserve in packing cubes into the unit cube
- Packing lines in a hypercube
- Packing isosceles right triangles of legs of harmonic lengths
- Perfect packing of \(d\)-cubes
- Cube packings, second moment and holes
- Random packings by cubes
This page was built for publication: A note on perfect packing of \(d\)-dimensional cubes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2200981)
