Pith. sign in

REVIEW 4 cited by

A new lower bound for sphere packing

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2312.10026 v1 pith:EN56ZT4K submitted 2023-12-15 math.MG math.COmath.PR

classification math.MGmath.COmath.PR
keywords boundpackingasymptoticallyboundsdensityexistsfactorfirst
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

We show there exists a packing of identical spheres in $\mathbb{R}^d$ with density at least \[ (1-o(1))\frac{d \log d}{2^{d+1}}\, , \] as $d\to\infty$. This improves upon previous bounds for general $d$ by a factor of order $\log d$ and is the first asymptotically growing improvement to Rogers' bound from 1947.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 4 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. A phase transition for the hard sphere model on the hyperbolic plane

    math-ph 2026-07 accept novelty 8.0 of 10

    For an unbounded open set of radii, the hard-sphere model on the hyperbolic plane has non-unique Gibbs measures at large activity, hence a phase transition.

  2. Sharp bounds for the fractional chromatic number of high-girth $d$-degenerate graphs

    math.CO 2026-07 conditional novelty 7.0 of 10

    For d-degenerate C4-free graphs, the fractional chromatic number is at most (1+o(1))d/log d, and for every fixed girth at least 4 there are d-degenerate graphs with fractional chromatic number at least (1−o(1))d/log d.

  3. Optimal Reconstruction Codes with Given Reads in Multiple Burst-Substitutions Channels

    cs.IT 2025-06 conditional novelty 7.0 of 10

    For the multiple-burst substitution channel, the paper shows that error-correction capability, the read-count exponent, and the list-size exponent can be traded freely, with t-1 = epsilon + rho + lambda.

  4. Linear programming bounds in homogeneous spaces, I: Optimal packing density

    math.MG 2025-05 conditional novelty 7.0 of 10

    Linear programming upper bounds for sphere packing densities are proven for homogeneous spaces, including a hyperbolic bound conjectured by Cohn and Zhao.

Pith tools