Bounding the density of binary sphere packing

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Fernique, Thomas, Pchelina, Daria
Format: Preprint
Published: 2025
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866916746116464640
author Fernique, Thomas
Pchelina, Daria
author_facet Fernique, Thomas
Pchelina, Daria
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2505_14110
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Bounding the density of binary sphere packing
Fernique, Thomas
Pchelina, Daria
Metric Geometry
Computational Geometry
68V05, 52C17, 65G30
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.
title Bounding the density of binary sphere packing
topic Metric Geometry
Computational Geometry
68V05, 52C17, 65G30
url https://arxiv.org/abs/2505.14110