math.MG — Metric Geometry
A Fourier Consequence for Lattice Kissing Numbers and Average Contacts
We deduce a new asymptotic upper bound on the maximal lattice kissing number in dimension , using the explicit auxiliary functions constructed in OpenAI's "Ten Advances" preprint. The same bound holds for the average contact degree of a finite packing of congruent balls. The bound's base- exponential rate rounds to , matching the value extrapolated empirically by Afkhami-Jeddi, Cohn, Hartman, de Laat, and Tajdini in 2020.
A mix of human-written and AI-generated textHuman understanding: all partsContact numbersDiscrete geometryEuclidean latticesFourier linear programming boundsGeometry of numbersKissing numbersSphere packing