arXiv (All)
open access
Large-Scale Autonomous Discovery of Kissing Number Constructions
The kissing-number problem is a classical problem in discrete geometry whose exact solution is known in only a few dimensions. Recent artificial-intelligence approaches have begun to discover improved configurations through large-scale numerical and combinatorial search, but converting such searches
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Matching Complexes of Outerplanar Graphs#1063729
- The Kaleidoscopic Filter, Part I : A Structural Resolution of Restricted Integer Partitions#1109782
- Integer Realization of an Equivelar Octahedron of Genus 3#1011425
- Bimanual 3D Hand Motion and Articulation Forecasting in Everyday Images#1048509
- Isoperimetric Problems on cyclic polygons#820957
Record · ID 1129653
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive