Abstract
Abstract Determining the maximum number of D-dimensional spheres of radius r that can be adjacent to a central sphere of radius r is known as the Kissing Number Problem (KNP). The problem has been solved for 2 and 3 dimensions. The smallest open case is 4 dimensions: a solution with 24 spheres is known, and an upper bound of 25 has been found. We present a new nonlinear mathematical programming model for the solution of the KNP. This problem is solved using a quasi Monte Carlo variant of a multi level single linkage algorithm for global optimization. The numerical results indicate that the solution of the KNP is 24 spheres, and not 25.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
