Erdős Problem #1084 — Contact numbers for sphere packings
Let be positive integers. For points with whenever , count the pairs at exactly the minimum allowed distance. The extremal function is
Estimate as a function of and . Equivalently, this is the largest number of contacts among packings of balls of radius in . Erdős Problems #1084 Contact numbers for sphere packings
Background
This is Erdős’s repeated shortest-distance problem: among points whose mutual distances are at least one, how many pairs can realize that shortest distance? It is also the contact-number problem for congruent-ball packings, where each point is the center of a ball and an edge joins two centers at distance one. The planar question was raised by Erdős in 1946; the problem is also viewed as a combinatorial counterpart of maximizing packing density. In one dimension, ordering the points immediately gives . Contact numbers for sphere packings Erdős (1946)
References
UnsolvedMath, Erdős Problems set, ULAM AI, licensed CC BY 4.0.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.