Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 124 tok/s
Gemini 2.5 Pro 52 tok/s Pro
GPT-5 Medium 25 tok/s Pro
GPT-5 High 31 tok/s Pro
GPT-4o 79 tok/s Pro
Kimi K2 206 tok/s Pro
GPT OSS 120B 435 tok/s Pro
Claude Sonnet 4.5 36 tok/s Pro
2000 character limit reached

Bounding the density of binary sphere packing (2505.14110v1)

Published 20 May 2025 in math.MG and cs.CG

Abstract: This paper provides the currently best known upper bound on the density of a packing in three-dimensional Euclidean space of two types of spheres whose size ratio is the largest one that allows the insertion of a small sphere in each octahedral hole of a hexagonal compact packing of large spheres. This upper bound is obtained by bounding from above the density of the tetrahedra which can appear in the additively-weighted Delaunay decomposition of the sphere centers of such packings. The proof relies on challenging computer calculations in interval arithmetic and may be of interest by their own.

Summary

We haven't generated a summary for this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

X Twitter Logo Streamline Icon: https://streamlinehq.com

Tweets

This paper has been mentioned in 1 tweet and received 4 likes.

Upgrade to Pro to view all of the tweets about this paper: