Skip to content
Preprint

Analysis of Conjectural Improvements to Minkowski's Lower Bound on the Sphere Packing Density

Aug 2026 · 0 citations · 31 references
Physics Mathematics

Abstract

Torquato and Stillinger conjectured an exponential improvement of Minkowski's classical lower bound on the maximal density of sphere packings in high-dimensional Euclidean space $\mathbb{R}^d$ using a pair-correlation-function optimization framework. Conditional on their realizability conjecture, we show that a simple family of hyperuniform pair correlation functions yields polynomial improvements over Minkowski's lower bound of the form $\phi_{\mathrm{max}} \gtrsim d^\beta 2^{-d}$ for every fixed $\beta>1$ in sufficiently high dimensions. As the polynomial exponent is allowed to increase with dimension, this family continuously approaches the previously conjectured exponential improvement. We further derive the same exponential asymptotic rate independently from the Cohn--Elkies dual linear programming upper bound formulation, demonstrating that its radial objective test functions cannot asymptotically exclude packings with the Torquato--Stillinger density scalings. The agreement between these alternative approaches provides new evidence that exceptionally dense disordered sphere packings may exist in high dimensions and strengthens the case for the Torquato--Stillinger conjectural lower bound.

View source

Similar papers

Preprint Aug 2026

Smale's Mean Value Conjecture and its Dual Conjecture for Complex Polynomials

For the purposes of proving Smale's mean value conjecture, one may restrict consideration to an explicitly described family of so-called Schlicht normalized polynomials. For Schlicht normalized polynomials whose leading coefficient decays sufficiently slowly, we show that the conjectured upper bound $1$ becomes asympto...

Aneesh Jatar, Tu-En-Wai Ng · 0 citations
Preprint Aug 2026

Wirsching's Positive-Predecessor-Density Program: Proofs of Conjectures 1 and 3

Wirsching (2003) reduces uniform positive predecessor density for the $3n+1$ map to a chain of five conditions, organized into three conjectures. We prove two of them. Conjecture 1 concerns his path-counting generators: in the convolution carrying them to his Elka functions the partition weights grow subexponentially w...

Renato Augusto Tavares · 0 citations
Preprint Jul 2026

On Gr\"unbaum's problem for symmetric configurations

Let $g_n$ be the largest number of Euclidean balls of diameter $1$ which may be needed to cover a set of diameter $1$ in $\mathbb{R}^n$. We study this problem for finite sets invariant under all coordinate permutations. We prove that the exponential growth rate in this symmetric problem can be characterized exactly as...

Andrii Arman, A. Bondarenko, A. Prymak et al. · 0 citations
Preprint Sep 2026

The half-rate linear programming bound for binary codes is $\frac12-\frac1\pi$

In their work on sphere packing and the modular bootstrap, Afkhami-Jeddi, Cohn, Hartman, de Laat, and Tajdini conjectured the exact high-dimensional exponent of the Cohn-Elkies sphere-packing linear program. OpenAI's Chapter 1 subsequently proved their conjecture by establishing that both Fourier sign-uncertainty radii...

Andrew Salmon · 0 citations
Preprint Aug 2026

The Uniform Gromov Hausdorff Gap Problem for Approximating Spheres by Finite Homogeneous Spaces

Let $S^n$ be the unit round sphere with its intrinsic angular metric, normalized so that $\operatorname{diam}S^n=\pi$. For finite homogeneous metric spaces $X$, put \[ \delta_n=\inf_X d_{GH}(X,S^n). \] The main open problem is whether $\inf_{n\ge2}\delta_n>0$. Gelander's theorem gives $\delta_n>0$ in each fixed dimensi...

I. Benjamini · 0 citations
Preprint Sep 2026

Dimension-free estimates for full discrete maximal functions associated with Euclidean balls and spheres

We prove that the full discrete Hardy-Littlewood maximal operator associated with Euclidean balls satisfies dimension-free bounds on $\ell^p(\mathbb Z^d)$ for every $1<p<\infty$. We also establish analogous dimension-free bounds for the full discrete spherical maximal operator when $d\geq 5$ and $2\leq p<\infty$. The m...

M. Hormozi, Jakub Niksiński, Bla.zej Wr'obel · 1 citation · ⚡1

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.