Abstract
The average kissing number in $${\mathbb{R}^n}$$ is the supremum of the average degrees of contact graphs of packings of finitely many balls (of any radii) in $${\mathbb{R}^n}$$ . We provide an upper bound for the average kissing number based on semidefinite programming that improves previous bounds in dimensions 3,..., 9. A very simple upper bound for the average kissing number is twice the kissing number; in dimensions 6,..., 9 our new bound is the first to improve on this simple upper bound.
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.
