The Tammes Problem for N = 14

DOI10.1080/10586458.2015.1022842zbMath1327.52042arXiv1410.2536OpenAlexW1881313574MaRDI QIDQ3194582

Alexey S. Tarasov, Oleg R. Musin

Publication date: 20 October 2015

Published in: Experimental Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

sphere packingTammes problemirreducible contact graph

Mathematics Subject Classification ID

Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Combinatorial aspects of packing and covering (05B40)

Related Items (14)

Design theory from the viewpoint of algebraic combinatorics ⋮ Numerical calculation of extremal Steklov eigenvalues in 3D and 4D ⋮ A Lagrangian formulation for interacting particles on a deformable medium ⋮ The Optimal Packing of Eight Points in the Real Projective Plane ⋮ An iterative procedure for finding locally and globally optimal arrangements of particles on the unit sphere ⋮ Iterated dynamic neighborhood search for packing equal circles on a sphere ⋮ Tammes problem and contact number for spheres in spaces of constant curvature ⋮ Covering the sphere by equal zones ⋮ Extremal problems of circle packings on a sphere and irreducible contact graphs ⋮ Towards a proof of the 24-cell conjecture ⋮ Packings in Real Projective Spaces ⋮ Bounds for several-disk packings of hyperbolic surfaces ⋮ Globally Optimizing Small Codes in Real Projective Spaces ⋮ Numerical Minimization of Dirichlet Laplacian Eigenvalues of Four-Dimensional Geometries

Cites Work

• Unnamed Item
• The strong thirteen spheres problem
• Finite point-sets on S 2 with minimum distance as large as possible
• Arrangement of 24 points on a sphere
• New bounds on the number of unit spheres that can touch a unit sphere in n dimensions
• The thirteen spheres: a new proof
• The problem of thirteen spheres -- a proof for undergraduates
• The kissing number in four dimensions
• Generic global rigidity
• The kissing problem in three dimensions
• Auf welcher Kugel haben 5, 6, 7, 8 oder 9 Punkte mit Mindestabstand Eins Platz?
• Das Problem der dreizehn Kugeln
• The Problem of the Thirteen Spheres
• New upper bounds for kissing numbers from semidefinite programming

This page was built for publication: The Tammes Problem for N = 14