Cube packings, second moment and holes

DOI10.1016/J.EJC.2006.01.008zbMATH Open1111.52017arXivmath/0509100OpenAlexW2005258255WikidataQ56699787 ScholiaQ56699787MaRDI QIDQ872026FDOQ872026

Authors: Mathieu Dutour Sikirić, Yoshiaki Itoh, Alexei Poyarkov 

Publication date: 27 March 2007

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Abstract: We consider tilings and packings of $R{R}^d$ by integral translates of cubes $[0,2{[}^d$, which are $$-periodic. Such cube packings can be described by cliques of an associated graph, which allow us to classify them in dimension $dleq4$. For higher dimension, we use random methods for generating some examples. Such a cube packing is called {em 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 $2^d-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 $$, we denote by $N_z$ the number of cubes inside the $4t$-cube $z+[0,4{[}^d$ and call {em second moment} the average of $N_z^2$. 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.

Full work available at URL: https://arxiv.org/abs/math/0509100

Recommendations

• CUBE PACKINGS IN EUCLIDEAN SPACES
• On 2D packings of cubes in the torus
• On the densest packing of sections of a cube
• Combinatorial cube packings in the cube and the torus
• Random packings by cubes
• Perfect packing of \(d\)-cubes
• scientific article; zbMATH DE number 5593210
• Homogeneous cubic cylinder packings revisited
• Packing cubes into a cube in \((D>3)\)-dimensions
• A note on perfect packing of \(d\)-dimensional cubes

Mathematics Subject Classification ID

Combinatorial aspects of tessellation and tiling problems (05B45) Sub-Riemannian geometry (53C17) Combinatorial aspects of packing and covering (05B40) Tilings in (n) dimensions (aspects of discrete geometry) (52C22)

Cites Work

• Monte Carlo strategies in scientific computing
• Orthonormal bases of exponentials for the \(n\)-cube
• Keller’s cube-tiling conjecture is false in high dimensions
• A cube tiling of dimension eight with no facesharing
• Cube-tilings of \(\mathbb{R}^ n\) and nonlinear codes
• A combinatorial approach for Keller's conjecture
• A reduction of Keller's conjecture
• What is known about unit cubes
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (12)

• Enumerating cube tilings
• The structure of cube tilings under symmetry conditions
• Combinatorial cube packings in the cube and the torus
• Rigid polyboxes and Keller's conjecture
• Rigidity and the chessboard theorem for cube packings
• Towards resolving Keller's cube tiling conjecture in dimension seven
• On the structure of cube tilings and unextendible systems of cubes in low dimensions
• Gluing and cutting cube tiling codes in dimension six
• On hypercube packings, blocking sets and a covering problem
• New results on torus cube packings and tilings
• On the structure of cube tiling codes
• A note on a flip-connected class of generalized domino tilings of the box \([0,2]^n\)

Uses Software

• GAP

This page was built for publication: Cube packings, second moment and holes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q872026)