Finding Kissing Numbers with Game-theoretic Reinforcement Learning 事件

Finding Kissing Numbers with Game-theoretic Reinforcement Learning arXiv:2511.13391v4 Announce Type: replace-cross Abstract: Since Isaac Newton first studied the Kissing Number Problem in 1694, determining the maximal number of non-overlapping spheres around a central sphere has remained a defining challenge in discrete geometry. As the local analogue of Hilbert's 18th problem, it has profound implications across geometry, number theory and information theory. Although lattices and codes have a