{"id":"palomar/PALOMAR-2026-09-05-000002","url":"https://github.com/sebastienpalcoux/sqrt6-kissing-bound/tree/cc87870ad897f0fe15e3cdffd3d7acd15f0c1ba9","json":"https://data.palomar-registry.org/entries/PALOMAR-2026-09-05-000002-v1.json","repo":"https://github.com/sebastienpalcoux/sqrt6-kissing-bound","tags":["math.MG","math.CO","msc:52C17","msc:52C35","kissing-numbers","euclidean-geometry","sphere-packing"],"score":0,"title":"The optimal universal exponential base for Euclidean kissing numbers","trust":"high","domain":"math.MG","source":"palomar","authors":["Sébastien Palcoux"],"reviews":0,"subject":"math.MG","summary":"For every positive integer n, the Euclidean kissing number tau_n is an attained maximum and satisfies tau_n = sqrt(6), and the supremum of tau_n^(1/n) over positive dimensions equals sqrt(6). No asymptotic-optimality claim is made.","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"verified":true,"discussed":0,"published":"2026-09-05","reactions":{},"formalized":true,"formalizes":[{"title":"A Universal Square-Root-of-Six Bound for Kissing Numbers","identifier":"","relationship":"formalizes"}]}