← All problems

Erdős Problem #1084 — Contact numbers for sphere packings

51 years old · traced to

Let d,nd,n be positive integers. For points x1,…,xn∈Rdx_1,\ldots,x_n\in\mathbb{R}^d with ∥xi−xj∥≥1\|x_i-x_j\|\geq 1 whenever i<ji<j, count the pairs at exactly the minimum allowed distance. The extremal function is

fd(n)=max⁡x1,…,xn∈Rd∥xi−xj∥≥1 (i<j)#{(i,j):1≤i<j≤n, ∥xi−xj∥=1}.f_d(n)=\max_{\substack{x_1,\ldots,x_n\in\mathbb{R}^d\\\|x_i-x_j\|\geq 1\ (i<j)}}\#\bigl\{(i,j):1\leq i<j\leq n,\ \|x_i-x_j\|=1\bigr\}.

Estimate fd(n)f_d(n) as a function of dd and nn. Equivalently, this is the largest number of contacts among packings of nn balls of radius 1/21/2 in Rd\mathbb{R}^d. Erdős Problems #1084 Contact numbers for sphere packings

Background

This is Erdős’s repeated shortest-distance problem: among nn 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 f1(n)=n−1f_1(n)=n-1. Contact numbers for sphere packings Erdős (1946)

References

Progress summary

Never refreshed

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.