HackerPapers

arXiv:2312.10026math.MG

A new lower bound for sphere packing

Marcelo Campos, Matthew Jenssen, Marcus Michelen, Julian Sahasrabudhe

HN submission. Found in a submission link or body. Submitters do not count as commenters in the main ranking; a submission is not an endorsement.

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.

arXiv comments
Journal reference
DOI
Subjects
math.MGMetric Geometry math.COCombinatorics math.PRProbability

On Hacker News

No comments linking this paper were found in the collected sources. Found in 1 HN submission from Dec 2023 to Dec 2023. Open submission discussions.

Comments linking this paper, per year.

Discussed in comments0 threads

No comments linking this paper were found in the collected sources. Open submission discussions.

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.