Improved Lower Bounds for Kissing Numbers in Dimensions 25 through 31

DOI10.1137/16M1095810zbMath1373.52023arXiv1608.07270OpenAlexW3102994868MaRDI QIDQ5351869

No author found.

Publication date: 31 August 2017

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

simulated annealingLeech latticemachine learningkissing numbersspherical codessphere packing

Mathematics Subject Classification ID

Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Combinatorial aspects of packing and covering (05B40)

Related Items

High-dimensional sphere packing and the modular bootstrap

Cites Work

• Rigidity of spherical codes
• New bounds on the number of unit spheres that can touch a unit sphere in n dimensions
• Generating random elements of a finite group
• Unnamed Item
• Unnamed Item
• Unnamed Item