Sphere packing bounds via spherical codes
From MaRDI portal
Abstract: The sphere packing problem asks for the greatest density of a packing of congruent balls in Euclidean space. The current best upper bound in all sufficiently high dimensions is due to Kabatiansky and Levenshtein in 1978. We revisit their argument and improve their bound by a constant factor using a simple geometric argument, and we extend the argument to packings in hyperbolic space, for which it gives an exponential improvement over the previously known bounds. Additionally, we show that the Cohn-Elkies linear programming bound is always at least as strong as the Kabatiansky-Levenshtein bound; this result is analogous to Rodemich's theorem in coding theory. Finally, we develop hyperbolic linear programming bounds and prove the analogue of Rodemich's theorem there as well.
Recommendations
Cites work
- A note on sphere packings in high dimension
- A proof of the Kepler conjecture
- Codes in spherical caps
- Densest packing of equal spheres in hyperbolic space
- Existenzsätze für Lagerungen im Euklidischen Raum
- Expansion in automorphic eigenfunctions of the Laplace-Beltrami operator in classical symmetric spaces of rank one, and the Selberg trace formula
- Foundations of Hyperbolic Manifolds
- Geometric analysis on symmetric spaces
- Harmonic analysis on commutative spaces
- Heat Kernel Bounds on Hyperbolic Space and Kleinian Groups
- scientific article; zbMATH DE number 3120273 (Why is no real title available?)
- scientific article; zbMATH DE number 3680654 (Why is no real title available?)
- scientific article; zbMATH DE number 3543912 (Why is no real title available?)
- scientific article; zbMATH DE number 1224949 (Why is no real title available?)
- scientific article; zbMATH DE number 1295599 (Why is no real title available?)
- scientific article; zbMATH DE number 1022658 (Why is no real title available?)
- scientific article; zbMATH DE number 1095994 (Why is no real title available?)
- scientific article; zbMATH DE number 6125590 (Why is no real title available?)
- scientific article; zbMATH DE number 3206556 (Why is no real title available?)
- scientific article; zbMATH DE number 3229797 (Why is no real title available?)
- scientific article; zbMATH DE number 3319746 (Why is no real title available?)
- scientific article; zbMATH DE number 3410920 (Why is no real title available?)
- Improved sphere packing lower bounds from Hurwitz lattices
- Maximal packing density of \(n\)-dimensional Euclidean space with equal balls
- Monotone Funktionen, Stieltjessche Integrale und harmonische Analyse
- New upper bounds on sphere packings. I
- New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities
- Noneuclidean Harmonic Analysis
- On Godement's characterisation of amenability
- Optimality and uniqueness of the Leech lattice among lattices
- Optimally dense packings of hyperbolic space
- Orbits of Orbs: Sphere Packing Meets Penrose Tilings
- Order and disorder in energy minimization
- Packing of spheres in spaces of constant curvature
- Periodicity and circle packings of the hyperbolic plane
- Positive definite functions on spheres
- Selberg's eigenvalue conjecture.
- Spherical codes and designs
- Spherical codes, maximal local packing density, and the Golden ratio
- Sur les représentations unitaires des groupes de Lorentz généralisés
- Systolic geometry and topology. With an appendix by Jake P. Solomon
- The densest lattice in twenty-four dimensions
- The Packing of Equal Spheres
- Universally optimal distribution of points on spheres
- Upper bounds for packings of spheres of several radii
Cited in
(39)- New upper bounds on sphere packings. I
- Improving Roger's upper bound for the density of unit ball packings via estimating the surface area of Voronoi cells from below in Euclidean \(d\)-space for all \(d\geq 8\)
- The Gaussian core model in high dimensions
- Wiener's problem for positive definite functions
- On kissing numbers and spherical codes in high dimensions
- Analogs of Steiner's porism and Soddy's hexlet in higher dimensions via spherical codes
- Free partition functions and an averaged holographic duality
- Sphere packing and quantum gravity
- Exponential improvements for superball packing upper bounds
- An optimal uncertainty principle in twelve dimensions via modular forms
- The packing density of the \(n\)-dimensional cross-polytope
- New upper bounds for the density of translative packings of three-dimensional convex bodies with tetrahedral symmetry
- High-dimensional sphere packing and the modular bootstrap
- scientific article; zbMATH DE number 1182944 (Why is no real title available?)
- scientific article; zbMATH DE number 65944 (Why is no real title available?)
- scientific article; zbMATH DE number 2063857 (Why is no real title available?)
- On the hard sphere model and sphere packings in high dimensions
- Density bounds for outer parallel domains of unit ball packings
- Asymptotic bounds for spherical codes
- Dual linear programming bounds for sphere packing via modular forms
- Integral points on the congruent number curve
- Bounds for several-disk packings of hyperbolic surfaces
- Spherically Punctured Biorthogonal Codes
- A Note on Lattice Packings via Lattice Refinements
- Six-dimensional sphere packing and linear programming
- Conic linear optimization for computer-assisted proofs. Abstracts from the workshop held April 10--16, 2022
- The magic of 8 and 24
- Small codes
- An efficient solution space exploring and descent method for packing equal spheres in a sphere
- New upper bounds for spherical codes and packings
- Dynamic space packing
- New lower bounds on kissing numbers and spherical codes in high dimensions
- New lower bound on ball packing density in high-dimensional hyperbolic spaces
- Towards a proof of the 24-cell conjecture
- Bounds on hyperbolic sphere packings: on a conjecture by Cohn and Zhao
- Error resilient space partitioning (invited talk)
- Lattice packing of spheres in high dimensions using a stochastically evolving ellipsoid
- Error resilient space partitioning
- Fourier inequalities and sign uncertainty
This page was built for publication: Sphere packing bounds via spherical codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q398996)
