The one-sided kissing number in four dimension

DOI10.1007/S10998-006-0033-0zbMATH Open1136.05009arXivmath/0511071OpenAlexW2056382686MaRDI QIDQ925135FDOQ925135

Authors: Oleg R. Musin 

Publication date: 29 May 2008

Published in: Periodica Mathematica Hungarica (Search for Journal in Brave)

Abstract: Let H be a closed half-space of n-dimensional Euclidean space. Suppose S is a unit sphere in H that touches the supporting hyperplane of H. The one-sided kissing number B(n) is the maximal number of unit nonoverlapping spheres in H that can touch S. Clearly, B(2)=4. It was proved that B(3)=9. Recently, K. Bezdek proved that B(4)=18 or 19, and conjectured that B(4)=18. We present a proof of this conjecture.

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

Recommendations

• The kissing number in four dimensions
• scientific article; zbMATH DE number 2115093
• The problem of the twenty-five spheres
• scientific article; zbMATH DE number 702183
• On kissing numbers and spherical codes in high dimensions

zbMATH Keywords

sphere packingsspherical codeskissing numbersDelsarte's method

Mathematics Subject Classification ID

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

Cited In (7)

• The translative kissing number of tetrahedra is 18
• Towards a proof of the 24-cell conjecture
• Enumeration of irreducible contact graphs on the sphere
• Improved Delsarte bounds for spherical codes in small dimensions
• Bounds for codes by semidefinite programming
• Semidefinite programming, multivariate orthogonal polynomials, and codes in spherical caps
• Extremal problems of circle packings on a sphere and irreducible contact graphs

This page was built for publication: The one-sided kissing number in four dimension

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