Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Statement
Setting (pp. 1, 4). is the largest number of touching pairs among non-overlapping unit balls in . is the largest contact number of a packing of unit balls whose centers are all lattice points of the face-centered cubic lattice with shortest non-zero lattice vector of length .
Theorem 4.1 (p. 5).
(i) for all .
(ii) for all .
(iii) for all with .
The survey attributes (i) to Bezdek and Reid (its reference [12], J. Geom. 104 (2013)), proved with the method of Bezdek (its reference [11], Discrete Comput. Geom. 48 (2012)), and (ii) and (iii) to that 2012 paper. It derives (2) (p. 5): for all with .
Proof pointer
Not proved in the survey; the proofs are in the cited papers.
Read depth
Claims checked: the definitions and the three parts were read on the page images of the print, with (2). The cited proofs were not read here. Nothing here is independently reviewed.
Dependencies
None in the corpus. External inputs: the cited papers of Bezdek (2012) and Bezdek and Reid (2013); the latter has its own source card.
Source. K. Bezdek and M. A. Khan, Contact numbers for sphere packings, in New Trends in Intuitive Geometry, Bolyai Society Mathematical Studies, Springer (2018), 25--47, doi:10.1007/978-3-662-57413-3_2; the label and page are those of arXiv:1601.00145v2, the edition read, named on the source card.
Bears on
- Problem 1084: after scaling by , is . Part (i) restates the upper bound for , credited on the problem's claim page to Bezdek and Reid; part (iii) gives only for the octahedral numbers , . On those the two bounds have the order of Erdős's estimate for ; the survey does not give the lower bound for other .