On the lower bound for kissing numbers of ℓ_p-spheres in high dimensions

2022/07/19 by Xie, Chengfei, Ge, Gennian
#05B40 #05D05 #11H71 #52C17 #Combinatorics (math.CO) #FOS: Mathematics #Metric Geometry (math.MG)

paper · doi:10.48550/arxiv.2207.09030

Abstract

In this paper, we give some new lower bounds for the kissing number of ℓ_p-spheres. These results improve the previous work due to Xu (2007). Our method is based on coding theory.

Related

• New lower bounds on kissing numbers and spherical codes in high dimensions
• On kissing numbers and spherical codes in high dimensions
• Improving the semidefinite programming bound for the kissing number by\n exploiting polynomial symmetry
• Improved kissing numbers in seventeen through twenty-one dimensions
• A note on five dimensional kissing arrangements