Papers
Topics
Authors
Recent
Search
2000 character limit reached

On the kissing number of the cross-polytope

Published 16 Jan 2025 in math.MG | (2501.09245v3)

Abstract: A new upper bound $\kappa_T(K_n)\leq 2.9162{(1+o(1))n}$ for the translative kissing number of the $n$-dimensional cross-polytope $K_n$ is proved, improving on Hadwiger's bound $\kappa_T(K_n)\leq 3n-1$ from 1957. Furthermore, it is shown that there exist kissing configurations satisfying $\kappa_T(K_n)\geq 1.1637{(1-o(1))n}$, which improves on the previous best lower bound $ \kappa_T(K_n)\geq 1.1348{(1-o(1))n}$ by Talata. It is also shown that the lattice kissing number satisfies $\kappa_L(K_n)< 12(2n-1)$ for all $n\geq 1$, and that the lattice $D_4+$ is the unique lattice, up to signed permutations of coordinates, attaining the maximum lattice kissing number $\kappa_L(K_4)=40$ in four dimensions.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.