37 problems
Let and consider a packing of circular disks whose radii all lie in an interval . Stability conjecture. There exists an such that, for eve…
Let satisfy , and let be the largest power of strictly less than . A sphere packing is weakly recurrent and dense when it has the corresponding recu…
Torquato–Stillinger conjecture. The function is a pair correlation function of a translationally invariant disordered sphere packing in at number dens…
A stable representation is an -representation that is a local minimum with respect to the ordering relation defining stability. Consider a graph on the sphere and fi…
Maximum-score conjecture. The maximum of on is the constant
Self-dual relaxed lattice conjecture. In every dimension, the largest possible value of among self-dual relaxed lattices equals the smallest value of possible in Theorem…
An FM-tetrahedron is a tetrahedron formed by four pairwise disjoint spheres, with a support sphere tangent to all four and satisfying the FM-tetrahedron conditions described in the…
Let and . Consider an arbitrary TS-packing of unit balls in . Fejes Tóth's sausage conjecture. The volume of their convex hull is at least t…
FCC truncated-density conjecture. For all , among packings of unit balls in , the $$ -truncated density has a maximum at the corresponding FCC lattice.
Let be a compact set with . A sphere packing is -admissible if all distances between distinct centers avoid in the paper's normalization, and a…
Let be a lattice with minimal norm . Covolume conjecture. If there is with , then has covolume greater than…
A sphere packing in dimension is a set of congruent non-overlapping balls whose centers form a discrete subset of Euclidean space. An extremal lattice in dimension is an…
Let be a lattice in the notation of the paper, and let be a frame lattice corresponding to . A root is a lattice vector of minimal norm as defined in the…
A graph is a generic-radii sphere-packing contact graph if it is the contact graph of a sphere packing whose radii are generic. NP-hardness conjecture. Determining whether a graph…
Let be the contact graph of a sphere packing with generic radii, where generic means that the radii form an algebraically independent set. Regard as a bar-and-joi…
Ball number conjecture. For any nontrivial and nonsplittable link ,
Consecutive-curvature sequence conjecture. There is a sequence of consecutive tangent spheres
Curvature realization conjecture. The set of curvatures of is .
Let and let be an edge-scribable -polytope. A polytope is Möbius unique if its edge-scribed realizations are equivalent under Möbius transformations. Möbius uni…
Let be the radius- ball, let be the uniform measure on , and set . Define … Let denote the grid-ce…
Kertész's density conjecture. If contains a TS-packing of unit balls, then
Let be the unit ball in -dimensional Euclidean space, let be the optimal parametric density for a finite packing of balls with parameter ,…
Linear-programming and sign uncertainty conjecture.
Let be a container, let denote the optimal density of unit-sphere packings in the -fold magnification , and define … For a large class of con…
For , let satisfy , and let denote the ball of radius centered at . The union-of-balls simplex conj…