The strong thirteen spheres problem
From MaRDI portal
Publication:443916
DOI10.1007/s00454-011-9392-2zbMath1269.52015arXiv1002.1439OpenAlexW2094247393MaRDI QIDQ443916
Alexey S. Tarasov, Oleg R. Musin
Publication date: 13 August 2012
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1002.1439
Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (17)
Design theory from the viewpoint of algebraic combinatorics ⋮ \(12\)-neighbour packings of unit balls in \(\mathbb{E}^3\) ⋮ The Tammes Problem for N = 14 ⋮ The Optimal Packing of Eight Points in the Real Projective Plane ⋮ Linear programming bounds for regular graphs ⋮ Iterated dynamic neighborhood search for packing equal circles on a sphere ⋮ Tammes problem and contact number for spheres in spaces of constant curvature ⋮ Unnamed Item ⋮ Covering the sphere by equal zones ⋮ Packing, covering and tiling in two-dimensional spaces ⋮ Extremal problems of circle packings on a sphere and irreducible contact graphs ⋮ Optimal \(N\)-point configurations on the sphere: ``magic numbers and Smale's 7th problem ⋮ Enumeration of irreducible contact graphs on the sphere ⋮ Packing twelve spherical caps to maximize tangencies ⋮ Towards a proof of the 24-cell conjecture ⋮ Optimal packings of congruent circles on a square flat torus ⋮ Globally Optimizing Small Codes in Real Projective Spaces
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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 status of the Kepler conjecture
- The thirteen spheres: a new proof
- The problem of thirteen spheres -- a proof for undergraduates
- The kissing number in four dimensions
- The kissing problem in three dimensions
- Über eine Abschätzung des kürzesten Abstandes zweier Punkte eines auf einer Kugelfläche liegenden Punktsystems
- Auf welcher Kugel haben 5, 6, 7, 8 oder 9 Punkte mit Mindestabstand Eins Platz?
- Das Problem der dreizehn Kugeln
- Research Problems in Discrete Geometry
- The Problem of the Thirteen Spheres
- New upper bounds for kissing numbers from semidefinite programming
- Arrangements of 14, 15, 16 and 17 points on a sphere
This page was built for publication: The strong thirteen spheres problem