Semidefinite programming bounds for the average kissing number

DOI10.1007/s11856-022-2288-4zbMath1493.90158arXiv2003.11832OpenAlexW3013260054MaRDI QIDQ2143250

Yanyan Li

Publication date: 31 May 2022

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

contact graphs of packings, upper bound

Mathematics Subject Classification ID

Semidefinite programming (90C22) Combinatorial optimization (90C27)

Related Items (1)

Conic linear optimization for computer-assisted proofs. Abstracts from the workshop held April 10--16, 2022

Uses Software

• SageMath
• CirclePack

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Spherical codes and designs
• New upper bounds on sphere packings. I
• Packing of incongruent circles on the sphere
• Average kissing numbers for non-congruent sphere packings
• Contact graphs of ball packings
• Remarks on my paper: ``Packing of incongruent circles on the sphere
• Improving the Semidefinite Programming Bound for the Kissing Number by Exploiting Polynomial Symmetry
• Exact Semidefinite Programming Bounds for Packing Problems
• Upper bounds for packings of spheres of several radii

This page was built for publication: Semidefinite programming bounds for the average kissing number