Improving the Semidefinite Programming Bound for the Kissing Number by Exploiting Polynomial Symmetry
From MaRDI portal
Publication:4689862
DOI10.1080/10586458.2017.1286273zbMath1401.52028arXiv1609.05167OpenAlexW2963419410WikidataQ111288233 ScholiaQ111288233MaRDI QIDQ4689862
Fabrício Caluza Machado, Fernando Mário de Oliveira Filho
Publication date: 22 October 2018
Published in: Experimental Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1609.05167
Semidefinite programming (90C22) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)
Related Items
Semidefinite programming bounds for the average kissing number, High-dimensional sphere packing and the modular bootstrap, Dimension reduction for semidefinite programs via Jordan algebras, Semidefinite programming bounds for binary codes from a split Terwilliger algebra, On the fulfillment of the complementary approximate Karush-Kuhn-Tucker conditions and algorithmic applications, Conic linear optimization for computer-assisted proofs. Abstracts from the workshop held April 10--16, 2022, A New Sequential Optimality Condition for Constrained Nonsmooth Optimization, Upper bounds for energies of spherical codes of given cardinality and separation, Towards a proof of the 24-cell conjecture, Exact Semidefinite Programming Bounds for Packing Problems, Kissing number in non-Euclidean spaces of constant sectional curvature
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Spherical codes and designs
- New bounds on the number of unit spheres that can touch a unit sphere in n dimensions
- New lower bounds for contact numbers in small dimensions
- Symmetry groups, semidefinite programs, and sums of squares
- The kissing number in four dimensions
- Motivations for an arbitrary precision interval arithmetic and the MPFI library
- Das Problem der dreizehn Kugeln
- Invariant Semidefinite Programs
- New upper bounds for kissing numbers from semidefinite programming
- High-Accuracy Semidefinite Programming Bounds for Kissing Numbers
- Algorithms in invariant theory