An extension of Delsarte's method. The kissing problem in three and four dimensions
Oleg R. Musin
TL;DR
This paper discusses an extension of Delsarte's method to solve the kissing number problem in three and four dimensions, providing new insights into spherical codes and their optimal arrangements.
Contribution
It introduces an extended Delsarte approach specifically tailored for the kissing problem in 3D and 4D, advancing the understanding of spherical code bounds.
Findings
Kissing number in four dimensions is established.
Extension of Delsarte's method improves bounds for spherical codes.
Provides a framework for analyzing spherical arrangements in higher dimensions.
Abstract
These lecture notes treat the solution of the kissing number problem in four dimesions which is based on an extension of the Delsarte method for spherical codes.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical Approximation and Integration · Electromagnetic Scattering and Analysis · Coding theory and cryptography