New upper bounds for kissing numbers from semidefinite programming

DOI10.1090/S0894-0347-07-00589-9zbMath1223.90039arXivmath/0608426OpenAlexW2101504517MaRDI QIDQ3577299

Publication date: 22 July 2010

Published in: Journal of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0608426

zbMATH Keywords

unit sphere LP method

Mathematics Subject Classification ID

Semidefinite programming (90C22)

Related Items

Design theory from the viewpoint of algebraic combinatorics ⋮ A Safe Computational Framework for Integer Programming Applied to Chvátal’s Conjecture ⋮ Symmetry in Mathematical Programming ⋮ Computing sum of squares decompositions with rational coefficients ⋮ New Bounds for Spherical Two-Distance Sets ⋮ $k$-point semidefinite programming bounds for equiangular lines ⋮ Upper bounds for $s$-distance sets and equiangular lines ⋮ Optimization and operations research in mitigation of a pandemic ⋮ $12$-neighbour packings of unit balls in $\mathbb{E}^3$ ⋮ The Tammes Problem for N = 14 ⋮ Symmetry Reduction in AM/GM-Based Optimization ⋮ High-dimensional sphere packing and the modular bootstrap ⋮ Three-point bounds for energy minimization ⋮ On an SDP relaxation for kissing number ⋮ Approximating the cone of copositive kernels to estimate the stability number of infinite graphs ⋮ Potential theory with multivariate kernels ⋮ New Bounds for Equiangular Lines and Spherical Two-Distance Sets ⋮ Bounds for solid angles of lattices of rank three ⋮ A faster interior-point method for sum-of-squares optimization ⋮ Spherical designs and modular forms of the $D_4$ lattice ⋮ Semidefinite programming bounds for binary codes from a split Terwilliger algebra ⋮ VerifyRealRoots: a Matlab package for computing verified real solutions of polynomials systems of equations and inequalities ⋮ The smallest mono-unstable convex polyhedron with point masses has 8 faces and 11 vertices ⋮ A new relative bound for equiangular lines and nonexistence of tight spherical designs of harmonic index 4 ⋮ Conic linear optimization for computer-assisted proofs. Abstracts from the workshop held April 10--16, 2022 ⋮ Tammes problem and contact number for spheres in spaces of constant curvature ⋮ A New Sequential Optimality Condition for Constrained Nonsmooth Optimization ⋮ Upper bounds for energies of spherical codes of given cardinality and separation ⋮ Contact graphs of ball packings ⋮ Symmetric sums of squares over $k$-subset hypercubes ⋮ Group symmetry and covariance regularization ⋮ The strong thirteen spheres problem ⋮ Efficient Spherical Designs with Good Geometric Properties ⋮ DSOS and SDSOS Optimization: More Tractable Alternatives to Sum of Squares and Semidefinite Optimization ⋮ Packing, covering and tiling in two-dimensional spaces ⋮ Sum-of-Squares Optimization without Semidefinite Programming ⋮ Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017 ⋮ Expressing Combinatorial Problems by Systems of Polynomial Equations and Hilbert's Nullstellensatz ⋮ A polynomial time constraint-reduced algorithm for semidefinite optimization problems ⋮ Kissing numbers and the centered maximal operator ⋮ Symmetry in semidefinite programs ⋮ On spherical designs of some harmonic indices ⋮ Optimal $N$-point configurations on the sphere: ``magic numbers and Smale's 7th problem ⋮ Numerical block diagonalization of matrix $\ast$-algebras with application to semidefinite programming ⋮ Towards a proof of the 24-cell conjecture ⋮ On exact Reznick, Hilbert-Artin and Putinar's representations ⋮ TD-pairs and the $q$-Onsager algebra ⋮ Improving the Semidefinite Programming Bound for the Kissing Number by Exploiting Polynomial Symmetry ⋮ Invariant Semidefinite Programs ⋮ New Upper Bounds for Equiangular Lines by Pillar Decomposition ⋮ Optimality and uniqueness of the $(4,10,1/6)$ spherical code ⋮ Bounds for codes by semidefinite programming ⋮ Semidefinite programming, multivariate orthogonal polynomials, and codes in spherical caps ⋮ Moment methods in energy minimization: New bounds for Riesz minimal energy problems ⋮ Exact Semidefinite Programming Bounds for Packing Problems ⋮ A survey on spherical designs and algebraic combinatorics on spheres ⋮ Commutative association schemes ⋮ Upper bounds for packings of spheres of several radii ⋮ Exploiting special structure in semidefinite programming: a survey of theory and applications ⋮ Mixed-integer nonlinear optimization: a hatchery for modern mathematics. Abstracts from the workshop held June 2--8, 2019 ⋮ Kissing number in non-Euclidean spaces of constant sectional curvature ⋮ An Approach to the Dodecahedral Conjecture Based on Bounds for Spherical Codes ⋮ Distributing many points on spheres: minimal energy and designs

Uses Software

CSDP

Cites Work