Answers are grounded in this paper and cite their sources.
For every odd prime power q, we construct a finite packing of congruent balls in dimension d=q²-q+1 whose contact graph requires at least $2d$ colors. Consequently, the ball-packing chromatic number satisfies (q²-q+1)≥2(q²-q+1), and the same lower bound holds for congruent-ball packings. The construction starts from the complements of Hubaut's C₂₀ graphs and uses their Taylor extensions. We give an explicit finite-field adjacency rule for the q³-vertex graph Hq, prove its strong regularity, determine its spectrum and projection matrix, establish α(Hq)=q, and construct a two-distance embedding in q(q-1). Its Taylor extension Tq has 2(q³+1) vertices. We prove its distance-regularity, compute its intersection array, construct a three-distance embedding in ᵈ, and prove α(Tq)=q+1. The chromatic lower bound follows by realizing Tq as the contact graph of equal-radius balls and bounding the size of every color class. All coordinates, distances, and independence bounds are derived explicitly. The case $q=3$ uses the Schläfli and Gosset graphs and gives a packing of 56 congruent balls in ⁷ requiring at least 14 colors.
No takes yet. Share an insight, caveat, or question.
Ismailescu et al. (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: