Sphere packing in five dimensions
How densely can identical nonoverlapping spheres fill five-dimensional Euclidean space?
Packing, covering, distances and other limits set by geometry.
Subjects: Discrete geometry · Convex geometry · Algebra and geometry · Analysis and dynamics
How densely can identical nonoverlapping spheres fill five-dimensional Euclidean space?
How many equal five-dimensional balls can touch one central ball without overlapping each other?
Can every convex body in n dimensions have its entire boundary illuminated from at most 2ⁿ directions?
Do cubes and their dual shapes minimize a symmetric body’s volume multiplied by its polar’s volume?
Can every bounded four-dimensional set be split into five pieces of strictly smaller diameter?
What is the smallest-area convex region that can contain every planar curve of length one after repositioning it?
How little total barrier length can intercept every straight line that passes through a unit square?
Must a region in a nonpositively curved space have at least the boundary area of a Euclidean ball with the same volume?
For many representative points in a uniform three-dimensional region, is a body-centered cubic arrangement asymptotically best at minimizing squared distance to the nearest representative?
What periodic partition of three-dimensional space into equal-volume cells uses the least shared surface area?
Must every set of n distinct points in the plane determine at least a constant times n/√log n different distances?