Matching works

4 works

math.MG — Metric Geometry

The 24-cell conjecture in the all-contact case and near D4

Contributed by Tejasvi Singh Tomar

The 24-cell conjecture states that every Voronoi cell of a packing of unit balls in R4\mathbb{R}^4 has volume at least 88, the volume of the regular 24-cell. It implies that no packing of equal balls in R4\mathbb{R}^4 is denser than the lattice packing D4D_4. We prove the conjecture for two classes of cells; in each class, equality holds only for the D4D_4 root configuration. The first consists of the cells whose ball touches every ball centred at distance less than 222\sqrt2 from its centre, and its proof uses a certificate at the second level of the Lasserre hierarchy. The second consists of the cells whose 2424 nearest centres lie in an explicit neighbourhood of the D4D_4 configuration, whatever the other centres are. For them the volume is at least 88 plus a fixed multiple of the total outward displacement of the 2424 centres, which we prove by a quantitative rigidity estimate and a second-order expansion of the volume about D4D_4. Our proofs for both classes are computer-assisted and partly formalised in Lean.

Author comments: Published on Zenodo: https://doi.org/10.5281/zenodo.23720963

A mix of human-written and AI-generated textHuman understanding: all parts
Nov 12, 202624 pages
PDFView work

math.MG — Metric Geometry

Densest packings of two translates of a lattice in five dimensions

Contributed by Deep Bhattacharjee, Ushashi Bhattacharya

We prove that no packing of unit balls in R5\R^5 whose centres form two translates of a lattice is denser than the D5D_5 lattice packing. Up to congruence exactly three such packings attain this density: 2 D5\sqrt2\,D_5, a layered packing of Leech, and the packing with Szöllősi's kissing configuration.

A mix of human-written and AI-generated textHuman understanding: some parts$D_5$ latticeRyshkov polyhedronSphere packingVoronoi celldeep holeperiodic packing
Oct 22, 202618 pages
PDFView work

math.MG — Metric Geometry

Multi-coverings by lattice translates of convex bodies

Contributed by Scott Kominers

We show that for every convex body K⊂RnK\subset\mathbb R^n (n≥2n\ge2), every 0<ε<10<\varepsilon<1, and every prescribed density ρ≥Aεnlog⁡n\rho\ge A_\varepsilon n\log n, there is an arrangement of translates of KK along a single lattice with mean multiplicity exactly ρ\rho and multiplicity at least (1−ε)ρ(1-\varepsilon)\rho everywhere. Consequently, lattice kk-fold coverings exist with density at most max⁡{(1+ε)k,Cεnlog⁡n}\max\{(1+\varepsilon)k,C_\varepsilon n\log n\}, where CεC_\varepsilon depends only on ε\varepsilon. In sufficiently large dimension nn, a version with prescribed common covolume holds simultaneously for up to exp⁡(nc0)\exp(n^{c_0}) bodies whose uniform distributions have a common covariance matrix, with c0>0c_0>0 absolute. The proof builds on OpenAI's horizontal–vertical construction for single-lattice coverings and uses Gaussian layer averaging and Laplace bounds for covering counts.

A mix of human-written and AI-generated textHuman understanding: all partsGeometry of numbersconvex bodiesconvex geometrycovering densitycovering multiplicitylattice coveringmulti-covering
Oct 09, 202627 pages
PDFView work

math.MG — Metric Geometry

A Fourier Consequence for Lattice Kissing Numbers and Average Contacts

Contributed by Scott Kominers

We deduce a new asymptotic upper bound Klat(n)≤(2e/π+o(1))nK_{\mathrm{lat}}(n)\leq\left(\sqrt{2e/\pi}+o(1)\right)^n on the maximal lattice kissing number Klat(n)K_{\mathrm{lat}}(n) in dimension nn, using the explicit auxiliary functions constructed in OpenAI's "Ten Advances" preprint. The same bound holds for the average contact degree of a finite packing of congruent balls. The bound's base-22 exponential rate rounds to 0.39560.3956, matching the value extrapolated empirically by Afkhami-Jeddi, Cohn, Hartman, de Laat, and Tajdini in 2020.

A mix of human-written and AI-generated textHuman understanding: all partsContact numbersDiscrete geometryEuclidean latticesFourier linear programming boundsGeometry of numbersKissing numbersSphere packing
Oct 02, 20269 pages
PDFView work

Advanced search

Text
Human understanding
Linked formalizations