Packing twelve spherical caps to maximize tangencies

DOI10.1016/j.cam.2013.03.036zbMath1292.52019OpenAlexW2129322983MaRDI QIDQ2016417

Yanyan Li

Publication date: 20 June 2014

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2013.03.036

zbMATH Keywords

linear programmingdiscrete geometrycomputer aided proof

Mathematics Subject Classification ID

Linear programming (90C05) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)

Related Items (10)

Maximal fluctuations on periodic lattices: an approach via quantitative Wulff inequalities ⋮ A proof of finite crystallization via stratification ⋮ Crystallization in two dimensions and a discrete Gauss-Bonnet theorem ⋮ Extremal problems of circle packings on a sphere and irreducible contact graphs ⋮ Face-centered cubic crystallization of atomistic configurations ⋮ Crystallization in carbon nanostructures ⋮ Finite Crystallization and Wulff shape emergence for ionic compounds in the square lattice ⋮ Crystallization in the hexagonal lattice for ionic dimers ⋮ The Geometry of $C_{60}$: A Rigorous Approach via Molecular Mechanics ⋮ Some recent results on 2D crystallization for sticky disc models and generalizations for systems of oriented particles

Uses Software

• plantri
• kepler98

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The strong thirteen spheres problem
• Face-centered cubic crystallization of atomistic configurations
• Radial basis functions: developments and applications to planetary scale flows
• Rotational transport on a sphere: local node refinement with radial basis functions
• A proof of the Kepler conjecture
• Das Problem der dreizehn Kugeln
• The Five-Electron Case of Thomson’s Problem

This page was built for publication: Packing twelve spherical caps to maximize tangencies