Cube packings, second moment and holes
Abstract
We consider tilings and packings of d by integral translates of cubes [0,2[d, which are 4d-periodic. Such cube packings can be described by cliques of an associated graph, which allow us to classify them in dimension d≤ 4. For higher dimension, we use random methods for generating some examples. Such a cube packing is called non-extendible if we cannot insert a cube in the complement of the packing. In dimension 3, there is a unique non-extendible cube packing with 4 cubes. We prove that d-dimensional cube packings with more than 2d-3 cubes can be extended to cube tilings. We also give a lower bound on the number N of cubes of non-extendible cube packings. Given such a cube packing and z∈ d, we denote by Nz the number of cubes inside the \4t-cube z+[0,4[d and call second moment the average of Nz2. We prove that the regular tiling by cubes has maximal second moment and give a lower bound on the second moment of a cube packing in terms of its density and dimension.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.