arXiv (All)
open access
An Improved Lower Bound for Packing 203 Equal Spheres in a Unit Cube
This paper reports an improved numerical lower bound for packing 203 equal spheres in a unit cube. Let r denote the maximum common radius of equal non-overlapping spheres that can be packed in a unit cube. For N = 203, the configuration currently listed in Packomania has a feasible radius of approxi
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
- Maximum packing for perfect four-triple configurations#955115
- Spectral bipartiteness in generalized odd graphs of diameter three#999419
- New lower bounds on domination--packing ratios in connected subcubic and cubic graphs#616684
- New lower bounds on domination--packing ratios in connected subcubic and cubic graphs#616184
- Geometric Graph Representations via Compact SAT Encodings#1357896
Record · ID 1324579
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