The Local Optimality of the Double Lattice Packing

نویسندگان

  • Yoav Kallus
  • Wöden Kusner
چکیده

This paper introduces a new technique for proving the local optimality of packing configurations of Euclidean space. Applying this technique to a general convex polygon, we prove that under mild assumptions satisfied generically, the construction of the optimal double lattice packing by Kuperberg and Kuperberg is also locally optimal in the full space of packings.

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

ثبت نام

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

منابع مشابه

Perfect, Strongly Eutactic Lattices Are Periodic Extreme

We introduce a parameter space for periodic point sets, given as a union of m translates of a point lattice. In it we investigate the behavior of the sphere packing density function and derive sufficient conditions for local optimality. Using these criteria we prove that perfect, strongly eutactic lattices cannot be locally improved to yield a denser periodic sphere packing. This in particular ...

متن کامل

Pessimal Packing Shapes

We address the question of which convex shapes, when packed as densely as possible under certain restrictions, fill the least space and leave the most empty space. In each different dimension and under each different set of restrictions, this question is expected to have a different answer or perhaps no answer at all. As the problem of identifying global minima in most cases appears to be beyon...

متن کامل

Local Covering Optimality of Lattices : Leech Lattice versus Root Lattice E 8

The Leech lattice is the exceptional lattice in dimension 24. Soon after its discovery by Leech [9], it was conjectured that it is extremal for several geometric problems in R: the kissing number problem, the sphere packing problem, and the sphere covering problem. In 1979, Odlyzko and Sloane and independently Levenshtein solved the kissing number problem in dimension 24 by showing that the Lee...

متن کامل

Uniform connectedness and uniform local connectedness for lattice-valued uniform convergence spaces

We apply Preuss' concept of $mbbe$-connectedness to the categories of lattice-valued uniform convergence spaces and of lattice-valued uniform spaces. A space is uniformly $mbbe$-connected if the only uniformly continuous mappings from the space to a space in the class $mbbe$ are the constant mappings. We develop the basic theory for $mbbe$-connected sets, including the product theorem. Furtherm...

متن کامل

COMPUTATIONAL ENUMERATION OF POINT DEFECT CLUSTERS IN DOUBLE- LATTICE CRYSTALS

The cluster representation matrices have already been successfully used to enumerate close-packed vacancy clusters in all single-lattice crystals [I, 2]. Point defect clusters in double-lattice crystals may have identical geometry but are distinct due to unique atomic postions enclosing them. The method of representation matrices is extended to make it applicable to represent and enumerate ...

متن کامل

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


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

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

ثبت نام

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

عنوان ژورنال:
  • Discrete & Computational Geometry

دوره 56  شماره 

صفحات  -

تاریخ انتشار 2016