Dual Linear Programming Bounds for Sphere Packing via Discrete Reductions

06/20/2022
by   Rupert Li, et al.
0

The Cohn-Elkies linear program for sphere packing, which was used to solve the 8 and 24 dimensional cases, is conjectured to not be sharp in any other dimension d>2. By mapping feasible points of this infinite-dimensional linear program into a finite-dimensional problem via discrete reduction, we provide a general method to obtain dual bounds on the Cohn-Elkies linear program. This reduces the number of variables to be finite, enabling computer optimization techniques to be applied. Using this method, we prove that the Cohn-Elkies bound cannot come close to the best packing densities known in dimensions 3 ≤ d ≤ 13 except for the solved case d=8. In particular, our dual bounds show the Cohn-Elkies bound is unable to solve the 3 and 4 dimensional sphere packing problems.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/29/2018

The Sphere Packing Bound for DSPCs with Feedback a la Augustin

The sphere packing bound is proved for codes on discrete stationary prod...
research
02/09/2018

The b-bibranching Problem: TDI System, Packing, and Discrete Convexity

In this paper, we introduce the b-bibranching problem in digraphs, which...
research
08/20/2019

Optimization Bounds from the Branching Dual

We present a general method for obtaining strong bounds for discrete opt...
research
01/02/2019

Generalized Sphere-Packing Bound for Subblock-Constrained Codes

We apply the generalized sphere-packing bound to two classes of subblock...
research
08/13/2019

Pair correlation for Dedekind zeta functions of abelian extensions

Here we study problems related to the proportions of zeros, especially s...
research
02/06/2019

Restriction enzymes use a 24 dimensional coding space to recognize 6 base long DNA sequences

Restriction enzymes recognize and bind to specific sequences on invading...
research
11/08/2022

Multiple Packing: Lower Bounds via Infinite Constellations

We study the problem of high-dimensional multiple packing in Euclidean s...

Please sign up or login with your details

Forgot password? Click here to reset