A survey on the kissing numbers

zbMATH Open1324.52013arXiv1507.03631MaRDI QIDQ5261748FDOQ5261748

O. Musin, Peter Boyvalenkov, Stefan Dodunekov

Publication date: 7 July 2015

Abstract: The maximum possible number of non-overlapping unit spheres that can touch a unit sphere in $n$ dimensions is called kissing number. The problem for finding kissing numbers is closely connected to the more general problems of finding bounds for spherical codes and sphere packings. We survey old and recent results on the kissing numbers keeping the generality of spherical codes.

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

zbMATH Keywords

linear programmingsphere packingkissing numbersbounds for codes

Mathematics Subject Classification ID

Linear programming (90C05) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Bounds on codes (94B65) Research exposition (monographs, survey articles) pertaining to convex and discrete geometry (52-02)

Cited In (21)

• Towards a proof of the 24-cell conjecture
• Enumeration of irreducible contact graphs on the sphere
• Delsarte’s extremal problem and packing on locally compact Abelian groups
• ON CONTACT NUMBERS OF LOCALLY SEPARABLE UNIT SPHERE PACKINGS
• Tammes problem and contact number for spheres in spaces of constant curvature
• Antipodal Hadwiger numbers of finite-dimensional Banach spaces
• On an SDP relaxation for kissing number
• Analogs of Steiner's porism and Soddy's hexlet in higher dimensions via spherical codes
• On the extremality of the polynomials used for obtaining the best known upper bounds for the kissing numbers
• On contact graphs of totally separable packings in low dimensions
• Online unit covering in Euclidean space
• Uniformly Perfect Sets, Hausdorff Dimension, and Conformal Capacity
• Kissing numbers for balls with varying radii
• An upper bound for the contact number in dimension 9
• The kissing number in 48 dimensions for codes with certain forbidden distances is 52 416 000
• A New Sequential Optimality Condition for Constrained Nonsmooth Optimization
• Extremal problems of circle packings on a sphere and irreducible contact graphs
• Lattices with exponentially large kissing numbers
• On kissing numbers and spherical codes in high dimensions
• Upper bounds for energies of spherical codes of given cardinality and separation
• On contact graphs of totally separable domains

This page was built for publication: A survey on the kissing numbers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5261748)