Deriving Finite Sphere Packings

DOI10.1137/100784424zbMath1268.52014DBLPjournals/siamdm/ArkusMB11arXiv1011.5412OpenAlexW2069907252WikidataQ58221817 ScholiaQ58221817MaRDI QIDQ3225160

Natalie Arkus, Vinothan N. Manoharan, Michael P. Brenner

Publication date: 15 March 2012

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1011.5412

zbMATH Keywords

spherepackingcolloiddistance equations

Mathematics Subject Classification ID

Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)

Related Items (7)

A graph-algorithmic approach for the study of metastability in Markov chains ⋮ On contact numbers of totally separable unit sphere packings ⋮ Unification and extension of intersection algorithms in numerical algebraic geometry ⋮ Extremal problems of circle packings on a sphere and irreducible contact graphs ⋮ Enumerating Rigid Sphere Packings ⋮ On contact graphs of totally separable domains ⋮ Selected Open Problems in Discrete Geometry and Optimization

This page was built for publication: Deriving Finite Sphere Packings