Cube packings, second moment and holes

نویسندگان

  • Mathieu Dutour Sikiric
  • Yoshiaki Itoh
  • Alexei Poyarkov
چکیده

We consider tilings and packings of R by integral translates of cubes [0, 2[, which are 4Z-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 2 − 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 ∈ Z, we denote by Nz the number of cubes inside the 4-cube z +[0, 4[ and call second moment the average of N2 z . 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.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Influence of insertion of holes in the middle of obstacles on the flow around a surface-mounted cube

The aim of our study is to analyze the impact of insertion holes in the middle of obstacles on the flow around a surface-mounted cube, In order to do this; we studied four configurations of obstacles in a channel with a Reynods number based on obstacle height ReH = 40000. The hexahedral structured meshes were used to solve the fluid dynamics equations .The finite volume method are employed to s...

متن کامل

On k-neighbour Packings and One-sided Hadwiger Configurations

We show that in d-dimensional Euclidean space the maximum number of non-overlapping translates of a d-dimensional convex body K that can touch K and can lie in a closed supporting half-space of K is always at most 2 ·3d−1−1, with this bound to be reached only if K is an affine image of a d-cube. Such onesided Hadwiger configurations occur at the boundary of finite packings or near the holes in ...

متن کامل

Penny-Packings with Minimal Second Moments

We consider the problem of packing n disks of unit diameter in the plane so as to minimize the second moment about their centroid. Our main result is an algorithm which constructs packings that are optimal among hexagonal packings. Using the algorithm, we prove that, except for n = 212, the n-point packings obtained by Graham and Sloane [1] are optimal among hexagonal packings. We also prove a ...

متن کامل

Combinatorial Algorithms for Packings, Coverings and Tilings of Hypercubes

Aalto University, P.O. Box 11000, FI-00076 Aalto www.aalto.fi Author Ashik Mathew Kizhakkepallathu Name of the doctoral dissertation Combinatorial Algorithms for Packings, Coverings and Tilings of Hypercubes Publisher School of Electrical Engineering Unit Department of Communications and Networking Series Aalto University publication series DOCTORAL DISSERTATIONS 112/2015 Field of research Info...

متن کامل

Dense Packings of Equal Spheres in a Cube

We describe an adaptation of the billiard algorithm for finding dense packings of equal spheres inside a domain of the euclidean space. In order to improve the convergence of this stochastic algorithm, we introduce systematic perturbations in it. We apply this perturbed billiard algorithm in the case of n spheres in a cube and display all the optimal and best known packings up to n = 32. We imp...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Eur. J. Comb.

دوره 28  شماره 

صفحات  -

تاریخ انتشار 2007