{"id":"hexagon/2611.00376","pdf":"https://hexagonmath.org/pdf/2611.00376v1","url":"https://hexagonmath.org/abs/2611.00376v1","tags":["math.OC","math.CO","msc:52C17","msc:05B40","msc:90C22","msc:68V20"],"score":0,"title":"The kissing numbers in dimensions five and seven are at most 43 and 132","domain":"math.MG","origin":"ai-generated","source":"hexagon","authors":["Tejasvi Singh Tomar"],"reviews":0,"subject":"math.MG","summary":"The kissing number $\\tau_n$ is the largest number of non-overlapping unit balls in $\\mathbb{R}^n$ that can touch a common unit ball. The best bounds so far were $40\\le\\tau_5\\le44$ and $126\\le\\tau_7\\le134$; both upper bounds come from high-precision floating-point computations of the three-point bound by Mittelmann and Vallentin. We prove $\\tau_5\\le 43$ and $\\tau_7\\le132$. Each proof is an exact rational solution of the second level of the Lasserre hierarchy for spherical codes at degrees $(d_1,d_2,\\delta)=(14,20,20)$. We use the formulation of de Laat, Leijenhorst and de Muinck Keizer and…","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"discussed":0,"published":"2026-11-12","reactions":{},"withdrawn":false,"authorship":"mixed","formalized":false,"human_understanding":"all"}