Towards a proof of the 24-cell conjecture

DOI10.1007/s10474-018-0828-5zbMath1413.52026arXiv1712.04099OpenAlexW2963352128WikidataQ123365200 ScholiaQ123365200MaRDI QIDQ722369

Oleg R. Musin

Publication date: 23 July 2018

Published in: Acta Mathematica Hungarica (Search for Journal in Brave)

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

zbMATH Keywords

kissing numbersphere packing24-cell conjectureKepler conjectureLP and SDP bounds on spherical codes

Mathematics Subject Classification ID

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

Related Items (3)

The two-distance sets in dimension four ⋮ Graphs and spherical two-distance sets ⋮ Kissing number in non-Euclidean spaces of constant sectional curvature

Uses Software

• Flyspeck
• kepler98

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sperner type lemma for quadrangulations
• Generalizations of Tucker-Fan-Shashkin lemmas
• \(12\)-neighbour packings of unit balls in \(\mathbb{E}^3\)
• Optimal asymptotic bounds for spherical designs
• Sphere packing bounds via spherical codes
• The strong thirteen spheres problem
• Contact numbers for congruent sphere packings in Euclidean 3-space
• Extremal problems of circle packings on a sphere and irreducible contact graphs
• Bounds on three- and higher-distance sets
• A formulation of the Kepler conjecture
• Sphere packings. III: Extremal cases
• Bounds for codes by semidefinite programming
• The one-sided kissing number in four dimension
• Optimality and uniqueness of the Leech lattice among lattices
• Optimality and uniqueness of the \((4,10,1/6)\) spherical code
• Semidefinite programming, multivariate orthogonal polynomials, and codes in spherical caps
• Spherical two-distance sets
• A survey on spherical designs and algebraic combinatorics on spheres
• Finite point-sets on S 2 with minimum distance as large as possible
• Arrangement of 24 points on a sphere
• Designs as maximum codes in polynomial metric spaces
• Spherical codes and designs
• New bounds on the number of unit spheres that can touch a unit sphere in n dimensions
• New maximal two-distance sets
• Sphere packings. II
• New upper bounds on sphere packings. I
• KKM type theorems with boundary conditions
• Contact graphs of unit sphere packings revisited
• Extensions of Sperner and Tucker's lemma for manifolds
• Enumeration of irreducible contact graphs on the sphere
• The sphere packing problem in dimension 8
• The sphere packing problem in dimension \(24\)
• Sphere packings. I
• The problem of thirteen spheres -- a proof for undergraduates
• The kissing number in four dimensions
• Study of the Kepler's conjecture: the problem of the closest packing
• Bounds on sets with few distances
• The kissing problem in three dimensions
• A proof of the Kepler conjecture
• Homotopy invariants of covers and KKM-type lemmas
• Hilbert distances and positive definite functions
• Auf welcher Kugel haben 5, 6, 7, 8 oder 9 Punkte mit Mindestabstand Eins Platz?
• Das Problem der dreizehn Kugeln
• Positive definite functions on spheres
• Invariant Semidefinite Programs
• Borsuk - Ulam Type spaces
• Borsuk-Ulam type theorems for manifolds
• A Conceptual Breakthrough in Sphere Packing
• The Tammes Problem for N = 14
• The Problem of the Thirteen Spheres
• Universally optimal distribution of points on spheres
• New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
• Positive definite functions in distance geometry
• New upper bounds for kissing numbers from semidefinite programming
• High-Accuracy Semidefinite Programming Bounds for Kissing Numbers
• The dodecahedral conjecture
• Packing of spheres in spaces of constant curvature
• Uniqueness of Certain Spherical Codes
• Packing, coding, and ground states
• Improving the Semidefinite Programming Bound for the Kissing Number by Exploiting Polynomial Symmetry
• Arrangements of 14, 15, 16 and 17 points on a sphere
• The problem of the twenty-five spheres
• A survey on the kissing numbers
• TheD₄Root System Is Not Universally Optimal
• Upper bounds for packings of spheres of several radii
• The sphere packing problem
• Optimal packings of congruent circles on a square flat torus

This page was built for publication: Towards a proof of the 24-cell conjecture