New upper bounds for kissing numbers from semidefinite programming
From MaRDI portal
Publication:3577299
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.
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
- scientific article; zbMATH DE number 3121286 (Why is no real title available?)
- scientific article; zbMATH DE number 192896 (Why is no real title available?)
- scientific article; zbMATH DE number 1231230 (Why is no real title available?)
- scientific article; zbMATH DE number 527343 (Why is no real title available?)
- scientific article; zbMATH DE number 653407 (Why is no real title available?)
- scientific article; zbMATH DE number 2068102 (Why is no real title available?)
- scientific article; zbMATH DE number 2115093 (Why is no real title available?)
- scientific article; zbMATH DE number 2115094 (Why is no real title available?)
- scientific article; zbMATH DE number 2232233 (Why is no real title available?)
- An upper bound for the contact number in dimension 9
- Arrangements of 14, 15, 16 and 17 points on a sphere
- CSDP, A C library for semidefinite programming
- Das Problem der dreizehn Kugeln
- Global optimization with polynomials and the problem of moments
- Improved Delsarte bounds for spherical codes in small dimensions
- 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
- New upper bounds for nonbinary codes based on the Terwilliger algebra and semidefinite programming
- Semidefinite programming relaxations for semialgebraic problems
- Spherical codes and designs
- The kissing number in four dimensions
Cited in
(75)- A polynomial time constraint-reduced algorithm for semidefinite optimization problems
- Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017
- New formulations for the Kissing Number Problem
- Moment methods in energy minimization: new bounds for Riesz minimal energy problems
- Group symmetry and covariance regularization
- Packing, covering and tiling in two-dimensional spaces
- Invariant Semidefinite Programs
- A Safe Computational Framework for Integer Programming Applied to Chvátal’s Conjecture
- Semidefinite programming bounds for the average kissing number
- Upper bounds for energies of spherical codes of given cardinality and separation
- Improving the Semidefinite Programming Bound for the Kissing Number by Exploiting Polynomial Symmetry
- \(12\)-neighbour packings of unit balls in \(\mathbb{E}^3\)
- Exploiting special structure in semidefinite programming: a survey of theory and applications
- DSOS and SDSOS optimization: more tractable alternatives to sum of squares and semidefinite optimization
- Upper bounds for packings of spheres of several radii
- Bounds for solid angles of lattices of rank three
- On an SDP relaxation for kissing number
- High-Accuracy Semidefinite Programming Bounds for Kissing Numbers
- Design theory from the viewpoint of algebraic combinatorics
- A semidefinite programming hierarchy for packing problems in discrete geometry
- Mixed-integer nonlinear optimization: a hatchery for modern mathematics. Abstracts from the workshop held June 2--8, 2019
- Optimization and operations research in mitigation of a pandemic
- On exact Reznick, Hilbert-Artin and Putinar's representations
- Optimality and uniqueness of the \((4,10,1/6)\) spherical code
- High-dimensional sphere packing and the modular bootstrap
- A new relative bound for equiangular lines and nonexistence of tight spherical designs of harmonic index 4
- Sum-of-squares optimization without semidefinite programming
- Symmetry in mathematical programming
- Kissing numbers and the centered maximal operator
- Exact Semidefinite Programming Bounds for Packing Problems
- Expressing combinatorial problems by systems of polynomial equations and Hilbert's Nullstellensatz
- Symmetric sums of squares over \(k\)-subset hypercubes
- Approximating the cone of copositive kernels to estimate the stability number of infinite graphs
- Contact graphs of ball packings
- Semidefinite programming, multivariate orthogonal polynomials, and codes in spherical caps
- New Bounds for Spherical Two-Distance Sets
- TD-pairs and the \(q\)-Onsager algebra
- Towards a proof of the 24-cell conjecture
- New bounds for equiangular lines and spherical two-distance sets
- New upper bounds for equiangular lines by pillar decomposition
- Potential theory with multivariate kernels
- Upper bounds for \(s\)-distance sets and equiangular lines
- Symmetry in semidefinite programs
- A new sequential optimality condition for constrained nonsmooth optimization
- Three-point bounds for energy minimization
- Computing sum of squares decompositions with rational coefficients
- Commutative association schemes
- Bounds for codes by semidefinite programming
- Semidefinite programming bounds for binary codes from a split Terwilliger algebra
- On spherical designs of some harmonic indices
- Efficient spherical designs with good geometric properties
- The strong thirteen spheres problem
- Numerical block diagonalization of matrix \(\ast\)-algebras with application to semidefinite programming
- \(k\)-point semidefinite programming bounds for equiangular lines
- Optimal \(N\)-point configurations on the sphere: ``magic numbers and Smale's 7th problem
- The Tammes problem for \(N = 14\)
- An approach to the dodecahedral conjecture based on bounds for spherical codes
- Distributing many points on spheres: minimal energy and designs
- A survey on spherical designs and algebraic combinatorics on spheres
- The smallest mono-unstable convex polyhedron with point masses has 8 faces and 11 vertices
- 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
- Verified reductions for optimization
- New upper bounds for spherical codes and packings
- Spherical designs and modular forms of the \(D_4\) lattice
- A faster interior-point method for sum-of-squares optimization
- 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
- VerifyRealRoots: a Matlab package for computing verified real solutions of polynomials systems of equations and inequalities
- Conic linear optimization for computer-assisted proofs. Abstracts from the workshop held April 10--16, 2022
- Semidefinite programming bounds for spherical three-distance sets
- Symmetry reduction in AM/GM-based optimization
- Dual linear programming bounds for sphere packing via discrete reductions
- Tammes problem and contact number for spheres in spaces of constant curvature
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)
