The kissing number in four dimensions
From MaRDI portal
Publication:2389110
Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Combinatorial complexity of geometric structures (52C45) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)
Abstract: The kissing number problem asks for the maximal number k(n) of equal size nonoverlapping spheres in n-dimensional space that can touch another sphere of the same size. This problem in dimension three was the subject of a famous discussion between Isaac Newton and David Gregory in 1694. In three dimensions the problem was finally solved only in 1953 by Sch"utte and van der Waerden. In this paper we present a solution of a long-standing problem about the kissing number in four dimensions. Namely, the equality k(4)=24 is proved. The proof is based on a modification of Delsarte's method.
Recommendations
Cited in
(70)- The translative kissing number of tetrahedra is 18
- The Tammes problem for \(N = 14\)
- A survey on the kissing numbers.
- Towards a proof of the 24-cell conjecture
- Improving the Semidefinite Programming Bound for the Kissing Number by Exploiting Polynomial Symmetry
- On the number of weakly connected subdigraphs in random \(k\)NN digraphs
- Enumeration of irreducible contact graphs on the sphere
- Optimizers of three-point energies and nearly orthogonal sets
- Random sequential covering
- Universal lower bounds on energy and LP-extremal polynomials for \((4, 24)\)-codes
- Numerical comparison of merit function with filter criterion in inexact restoration algorithms using hard-spheres problems
- TD-pairs and the \(q\)-Onsager algebra
- Augmented Lagrangian methods for nonlinear programming with possible infeasibility
- The problem of the twenty-five spheres
- Bounds for codes by semidefinite programming
- scientific article; zbMATH DE number 2115094 (Why is no real title available?)
- New upper bounds for kissing numbers from semidefinite programming
- Kissing number in non-Euclidean spaces of constant sectional curvature
- Spherical codes, maximal local packing density, and the Golden ratio
- Optimal and non-optimal lattices for non-completely monotone interaction potentials
- Delsarte’s extremal problem and packing on locally compact Abelian groups
- Contact graphs of ball packings
- Bounds for spherical codes: the Levenshtein framework lifted
- High-dimensional sphere packing and the modular bootstrap
- \(k\)-point semidefinite programming bounds for equiangular lines
- Linear programming bounds for regular graphs
- On polarization of spherical codes and designs
- Dynamic space packing
- A note on five dimensional kissing arrangements
- A survey on spherical designs and algebraic combinatorics on spheres
- Graphs and spherical two-distance sets
- Classification of partially metric Q-polynomial association schemes with \(m_1=4\)
- Absolute minima of potentials of certain regular spherical configurations
- Tammes problem and contact number for spheres in spaces of constant curvature
- Bounds for solid angles of lattices of rank three
- On an SDP relaxation for kissing number
- Diagonal quinary quadratic forms with a strong regularity property
- Analogs of Steiner's porism and Soddy's hexlet in higher dimensions via spherical codes
- scientific article; zbMATH DE number 2115093 (Why is no real title available?)
- On contact graphs of totally separable packings in low dimensions
- A generalization on the kissing number of square
- The magic of 8 and 24
- Delsarte method in the problem on kissing numbers in high-dimensional spaces
- The strong thirteen spheres problem
- scientific article; zbMATH DE number 2068101 (Why is no real title available?)
- Solving clustered low-rank semidefinite programs arising from polynomial optimization
- Extremal problems of circle packings on a sphere and irreducible contact graphs
- The kissing number in 48 dimensions for codes with certain forbidden distances is 52 416 000
- Optimal asymptotic bounds for spherical designs
- The extremal function in the Delsarte problem of finding an upper bound for the kissing number in the three-dimensional space
- Symmetry in mathematical programming
- New formulations for the Kissing Number Problem
- A short solution of the kissing number problem in dimension three
- Spherical designs and modular forms of the \(D_4\) lattice
- The problem of thirteen spheres -- a proof for undergraduates
- The one-sided kissing number in four dimension
- On a planar six-neighbor theorem and its application
- The kissing problem in three dimensions
- The Kissing Number Problem: A New Result from Global Optimization
- Rigidity of spherical codes
- Commutative association schemes
- Sphere packings revisited
- Universal lower bounds for potential energy of spherical codes
- Positive definite functions in distance geometry
- On kissing numbers and spherical codes in high dimensions
- Upper bounds for energies of spherical codes of given cardinality and separation
- Kissing numbers and the centered maximal operator
- The Delsarte method in the problem of the contact numbers of Euclidean spaces of high dimensions
- Distributing many points on spheres: minimal energy and designs
- Optimization and operations research in mitigation of a pandemic
This page was built for publication: The kissing number in four dimensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2389110)
