On the kissing number of the cross-polytope
Niklas Miller

TL;DR
This paper establishes new bounds on the translative and lattice kissing numbers of the n-dimensional cross-polytope, improving previous bounds and identifying unique lattice configurations in four dimensions.
Contribution
It provides improved upper and lower bounds for the translative kissing number and characterizes the unique lattice configuration achieving the maximum in four dimensions.
Findings
New upper bound for translative kissing number: 2.9162^{(1+o(1))n}
Improved lower bound for kissing configurations: 1.1637^{(1-o(1))n}
Lattice kissing number in four dimensions: 40 for D_4^+ lattice
Abstract
A new upper bound for the translative kissing number of the -dimensional cross-polytope is proved, improving on Hadwiger's bound from 1957. Furthermore, it is shown that there exist kissing configurations satisfying , which improves on the previous best lower bound by Talata. It is also shown that the lattice kissing number satisfies for all , and that the lattice is the unique lattice, up to signed permutations of coordinates, attaining the maximum lattice kissing number in four dimensions.
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
TopicsAdvanced Combinatorial Mathematics · Mathematics and Applications · Advanced Mathematical Identities
