arXiv (All)
open access
The number of touching pairs of congruent sphere packings in Euclidean 3-space
A packing of $n$ congruent balls in $\mathbb{R}^3$ is a family of interior-disjoint Euclidean balls all having the same radius. The contact number of a packing is the number of touching pairs of balls. In this paper we investigate the problem of determining the maximum contact number, $c(n)$, of a p
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
- Greedy Packing of Nested Rings: Placement Rules, a Golden Counterexample, and a Tribonacci Floor#1123274
- Range of Clique Counts in Graphs#1036129
- A Central Limit Theorem for Coprime Pair Counts in Randomly Translated Disks#1083682
- Normal and Lognormal Asymptotics for Lattice-Point Counts in Random Translates of High-Dimensional Balls#818856
- Normal and Lognormal Asymptotics for Lattice-Point Counts in Random Translates of High-Dimensional Balls#808864
Record · ID 1106030
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