New upper bounds for kissing numbers from semidefinite programming
From MaRDI portal
Publication:3577299
DOI10.1090/S0894-0347-07-00589-9zbMATH Open1223.90039arXivmath/0608426OpenAlexW2101504517MaRDI QIDQ3577299FDOQ3577299
Authors: Christine Bachoc, Frank Vallentin 
Publication date: 22 July 2010
Published in: Journal of the American Mathematical Society (Search for Journal in Brave)
Abstract: Recently A. Schrijver derived new upper bounds for binary codes using semidefinite programming. In this paper we adapt this approach to codes on the unit sphere and we compute new upper bounds for the kissing number in several dimensions. In particular our computations give the (known) values for the cases n = 3, 4, 8, 24.
Full work available at URL: https://arxiv.org/abs/math/0608426
Recommendations
- Bounds for codes by semidefinite programming
- Semidefinite programming, multivariate orthogonal polynomials, and codes in spherical caps
- Improved Delsarte bounds for spherical codes in small dimensions
- On an SDP relaxation for kissing number
- High-Accuracy Semidefinite Programming Bounds for Kissing Numbers
Cites Work
- CSDP, A C library for semidefinite programming
- Global optimization with polynomials and the problem of moments
- Title not available (Why is that?)
- Semidefinite programming relaxations for semialgebraic problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Spherical codes and designs
- New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
- New bounds on the number of unit spheres that can touch a unit sphere in n dimensions
- Das Problem der dreizehn Kugeln
- Improved Delsarte bounds for spherical codes in small dimensions
- Title not available (Why is that?)
- Title not available (Why is that?)
- The kissing number in four dimensions
- New upper bounds for nonbinary codes based on the Terwilliger algebra and semidefinite programming
- Arrangements of 14, 15, 16 and 17 points on a sphere
- Title not available (Why is that?)
- Title not available (Why is that?)
- An upper bound for the contact number in dimension 9
Cited In (75)
- New upper bounds for spherical codes and packings
- Optimizers of three-point energies and nearly orthogonal sets
- The moment-SOS hierarchy: applications and related topics
- Kissing number in non-Euclidean spaces of constant sectional curvature
- Conic linear optimization for computer-assisted proofs. Abstracts from the workshop held April 10--16, 2022
- Symmetry reduction in AM/GM-based optimization
- A faster interior-point method for sum-of-squares optimization
- Tammes problem and contact number for spheres in spaces of constant curvature
- VerifyRealRoots: a Matlab package for computing verified real solutions of polynomials systems of equations and inequalities
- Semidefinite programming bounds for spherical three-distance sets
- Solving clustered low-rank semidefinite programs arising from polynomial optimization
- The kissing number in 48 dimensions for codes with certain forbidden distances is 52 416 000
- The smallest mono-unstable convex polyhedron with point masses has 8 faces and 11 vertices
- Dual linear programming bounds for sphere packing via discrete reductions
- Verified reductions for optimization
- The Tammes problem for \(N = 14\)
- A new relative bound for equiangular lines and nonexistence of tight spherical designs of harmonic index 4
- Three-point bounds for energy minimization
- Group symmetry and covariance regularization
- Improving the Semidefinite Programming Bound for the Kissing Number by Exploiting Polynomial Symmetry
- A semidefinite programming hierarchy for packing problems in discrete geometry
- Towards a proof of the 24-cell conjecture
- A new sequential optimality condition for constrained nonsmooth optimization
- Computing sum of squares decompositions with rational coefficients
- Efficient spherical designs with good geometric properties
- Exploiting special structure in semidefinite programming: a survey of theory and applications
- TD-pairs and the \(q\)-Onsager algebra
- Semidefinite programming bounds for binary codes from a split Terwilliger algebra
- Design theory from the viewpoint of algebraic combinatorics
- Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017
- Bounds for codes by semidefinite programming
- High-Accuracy Semidefinite Programming Bounds for Kissing Numbers
- Symmetric sums of squares over \(k\)-subset hypercubes
- Semidefinite programming, multivariate orthogonal polynomials, and codes in spherical caps
- Moment methods in energy minimization: new bounds for Riesz minimal energy problems
- Semidefinite programming bounds for the average kissing number
- On exact Reznick, Hilbert-Artin and Putinar's representations
- Contact graphs of ball packings
- Numerical block diagonalization of matrix \(\ast\)-algebras with application to semidefinite programming
- A polynomial time constraint-reduced algorithm for semidefinite optimization problems
- High-dimensional sphere packing and the modular bootstrap
- Sum-of-squares optimization without semidefinite programming
- \(k\)-point semidefinite programming bounds for equiangular lines
- Potential theory with multivariate kernels
- A survey on spherical designs and algebraic combinatorics on spheres
- DSOS and SDSOS optimization: more tractable alternatives to sum of squares and semidefinite optimization
- A Safe Computational Framework for Integer Programming Applied to Chvátal’s Conjecture
- Optimality and uniqueness of the \((4,10,1/6)\) spherical code
- Packing, covering and tiling in two-dimensional spaces
- On an SDP relaxation for kissing number
- Bounds for solid angles of lattices of rank three
- An approach to the dodecahedral conjecture based on bounds for spherical codes
- Symmetry in semidefinite programs
- Optimal \(N\)-point configurations on the sphere: ``magic numbers and Smale's 7th problem
- \(12\)-neighbour packings of unit balls in \(\mathbb{E}^3\)
- The strong thirteen spheres problem
- Upper bounds for packings of spheres of several radii
- New upper bounds for equiangular lines by pillar decomposition
- Mixed-integer nonlinear optimization: a hatchery for modern mathematics. Abstracts from the workshop held June 2--8, 2019
- Symmetry in mathematical programming
- New Bounds for Spherical Two-Distance Sets
- New formulations for the Kissing Number Problem
- Spherical designs and modular forms of the \(D_4\) lattice
- New bounds for equiangular lines and spherical two-distance sets
- Approximating the cone of copositive kernels to estimate the stability number of infinite graphs
- Commutative association schemes
- Exact Semidefinite Programming Bounds for Packing Problems
- Upper bounds for \(s\)-distance sets and equiangular lines
- Invariant Semidefinite Programs
- Upper bounds for energies of spherical codes of given cardinality and separation
- Kissing numbers and the centered maximal operator
- Expressing combinatorial problems by systems of polynomial equations and Hilbert's Nullstellensatz
- Distributing many points on spheres: minimal energy and designs
- Optimization and operations research in mitigation of a pandemic
- On spherical designs of some harmonic indices
Uses Software
This page was built for publication: New upper bounds for kissing numbers from semidefinite programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3577299)
