New upper bounds on sphere packings I

Abstract

We develop an analogue for sphere packing of the linear programming bounds for error-correcting codes, and use it to prove upper bounds for the density of sphere packings, which are the best bounds known at least for dimensions 4 through 36. We conjecture that our approach can be used to solve the sphere packing problem in dimensions 8 and 24.

26 pages, 1 figure

References in corpus (1)

• New upper bounds on sphere packings II

Cited by in corpus (118)

• Jammed Hard-Particle Packings: From Kepler to Bernal and Beyond
• Dense Packings of the Platonic and Archimedean Solids
• The sphere packing problem in dimension 24
• The sphere packing problem in dimension 8
• Universally optimal distribution of points on spheres
• Dense Packings of Polyhedra: Platonic and Archimedean Solids
• Random Sequential Addition of Hard Spheres in High Euclidean Dimensions
• Optimal Packings of Superballs
• Free partition functions and an averaged holographic duality
• Basic Understanding of Condensed Phases of Matter via Packing Models
• Precise Algorithm to Generate Random Sequential Addition of Hard Hyperspheres at Saturation
• Robust Algorithm to Generate a Diverse Class of Dense Disordered and Ordered Sphere Packings via Linear Programming
• Distributing many points on spheres: minimal energy and designs
• New upper bounds on sphere packings II
• Next Order Asymptotics and Renormalized Energy for Riesz Interactions
• Sphere Packing and Quantum Gravity
• Exactly Solvable Disordered Sphere-Packing Model in Arbitrary-Dimension Euclidean Spaces
• Optimality and uniqueness of the Leech lattice among lattices
• Toward the Jamming Threshold of Sphere Packings: Tunneled Crystals
• Hard sphere packings within cylinders
• Reformulation of the Covering and Quantizer Problems as Ground States of Interacting Particles
• A conceptual breakthrough in sphere packing
• Organizing Principles for Dense Packings of Nonspherical Hard Particles: Not All Shapes Are Created Equal
• Enumerating rigid sphere packings
• Exact Constructions of a Family of Dense Periodic Packings of Tetrahedra
• Structural Characterization of Many-Particle Systems on Approach to Hyperuniform States
• Sphere packing bounds via spherical codes
• Fourier optimization and prime gaps
• Upper bounds for packings of spheres of several radii
• Estimates of the optimal density and kissing number of sphere packings in high dimensions
• Bounds on the density of states and the spectral gap in CFT${}_2$
• Fourier interpolation on the real line
• Non-rational Narain CFTs from codes over $F_4$
• A semidefinite programming hierarchy for packing problems in discrete geometry
• On the most compact regular lattice in large dimensions: A statistical mechanical approach
• Random perfect lattices and the sphere packing problem
• The densest lattice in twenty-four dimensions
• Quantum stabilizer codes, lattices, and CFTs
• Effect of Dimensionality on the Percolation Thresholds of Various $d$-Dimensional Lattices
• 50 Years of the Golomb--Welch Conjecture
• Densest local packing diversity. II. Application to three dimensions
• Densest local sphere-packing diversity: General concepts and application to two dimensions
• New upper bounds for the density of translative packings of three-dimensional convex bodies with tetrahedral symmetry
• Coding Theory and Algebraic Combinatorics
• High-dimensional generalizations of the kagome and diamond crystals and the decorrelation principle for periodic sphere packings
• Structural characterization and statistical-mechanical model of epidermal patterns
• Dense sphere packings from optimized correlation functions
• Dense periodic packings of tori
• Thermodynamic stability of hard sphere crystals in dimensions 3 through 10
• The Gaussian core model in high dimensions
• Perfect, strongly eutactic lattices are periodic extreme
• Optimal lattice configurations for interacting spatially extended particles
• Complete positivity and distance-avoiding sets
• Spherical codes, maximal local packing density, and the golden ratio
• On classifying Minkowskian sublattices
• Lecture notes: Semidefinite programs and harmonic analysis
• An improvement on the Delsarte-type LP-bound with application to MUBs
• Some properties of optimal functions for sphere packing in dimensions 8 and 24
• Low dimensional strongly perfect lattices. I: The 12-dimensional case
• No lattice tiling of ${\mathbb{Z}}^n$ by Lee Sphere of radius 2
• Automorphic Spectra and the Conformal Bootstrap
• Mesh-free error integration in arbitrary dimensions: a numerical study of discrepancy functions
• Almost Perfect Metals in One Dimension
• The packing density of the $n$-dimensional cross-polytope
• Computing upper bounds for the packing density of congruent copies of a convex body
• On projections of arbitrary lattices
• Three-dimensional lattice ground states for Riesz and Lennard-Jones type energies
• The local optimality of the double lattice packing
• Solving clustered low-rank semidefinite programs arising from polynomial optimization
• A Breakthrough in Sphere Packing: The Search for Magic Functions
• Estimates of the asymptotic Nikolskii constants for spherical polynomials
• Fluid-fluid versus fluid-solid demixing in mixtures of parallel hard hypercubes
• New Sign Uncertainty Principles
• Moments of isotropic measures and optimal projective codes
• Restriction enzymes use a 24 dimensional coding space to recognize 6 base long DNA sequences
• Eigenfunctions of the Fourier Transform with specified zeros
• On percolation of two-dimensional hard disks
• Higher Fourier interpolation on the plane
• Packing Squares in a Torus
• Sphere Packings in 3 Dimensions
• Equidistribution and inequalities for partitions into powers
• Computing dimensions of spaces of Arakelov divisors of number fields
• Maximal polarization for periodic configurations on the real line
• Six-dimensional sphere packing and linear programming
• On Conjectures of Minkowski and Woods for n=9
• Sphere Packings in Euclidean Space with Forbidden Distances
• Semidefinite programming bounds for error-correcting codes
• Pair correlation for Dedekind zeta functions of abelian extensions
• Upper Bounds for Non-Congruent Sphere Packings
• Perfect codes in the lp metric
• Construction $C^{\star }$ from Self-Dual Codes
• A recursive Lovász theta number for simplex-avoiding sets
• Dual Linear Programming Bounds for Sphere Packing via Discrete Reductions
• New lattice sphere packings denser than Mordell-Weil lattices
• Dynamic Space Packing
• Sphere packing bounds via rescaling
• The Transport-based Mesh-free Method (TMM) and its applications in finance: a review
• Dense packing on uniform lattices
• Representation Learning for Scale-free Networks
• On integral estimates of non-negative positive definite functions
• A Mordell Inequality for Lattices over Maximal Orders
• Asymptotic bounds for spherical codes
• Optimal Narain CFTs from Codes
• Prony's method under an almost sharp multivariate Ingham inequality
• Optimal order Jackson type inequality for scaled Shepard approximation
• Zeros of Optimal Functions in the Cohn-Elkies Linear Program
• Minimal $N$-Point Diameters and $f$-Best-Packing Constants in $R^d$
• Low dimensional strongly perfect lattices IV: The dual strongly perfect lattices of dimension 16
• Refined Estimates on Conjectures of Woods and Minkowski
• Multiplicity of nontrivial zeros of primitive L-functions via higher-level correlations
• Spherical designs and lattices
• Errata and Addenda to Mathematical Constants
• A ternary construction of lattices
• New Conjectural Lower Bounds on the Optimal Density of Sphere Packings
• Mesh ratios for best-packing and limits of minimal energy configurations
• Bounds on hyperbolic sphere packings: On a conjecture by Cohn and Zhao
• From sphere packing to Fourier interpolation
• On Gauss sums and the evaluation of Stechkin's constant