The kissing number in four dimensions

From MaRDI portal
Publication:2389110

DOI10.4007/annals.2008.168.1zbMath1169.52008arXivmath/0309430OpenAlexW2028783114MaRDI QIDQ2389110

Oleg R. Musin

Publication date: 14 July 2009

Published in: Annals of Mathematics. Second Series (Search for Journal in Brave)

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




Related Items (53)

Symmetry in Mathematical ProgrammingThe problem of thirteen spheres -- a proof for undergraduatesNew formulations for the Kissing Number Problem\(k\)-point semidefinite programming bounds for equiangular linesOptimization and operations research in mitigation of a pandemicThe Tammes Problem for N = 14Numerical comparison of merit function with filter criterion in inexact restoration algorithms using hard-spheres problemsClassification of partially metric Q-polynomial association schemes with \(m_1=4\)Optimal asymptotic bounds for spherical designsHigh-dimensional sphere packing and the modular bootstrapOn kissing numbers and spherical codes in high dimensionsOn an SDP relaxation for kissing numberRandom sequential coveringBounds for solid angles of lattices of rank threeDelsarte’s extremal problem and packing on locally compact Abelian groupsSpherical designs and modular forms of the \(D_4\) latticeAbsolute minima of potentials of certain regular spherical configurationsDiagonal quinary quadratic forms with a strong regularity propertyLinear programming bounds for regular graphsA short solution of the kissing number problem in dimension threeTammes problem and contact number for spheres in spaces of constant curvatureUpper bounds for energies of spherical codes of given cardinality and separationThe magic of 8 and 24Contact graphs of ball packingsOn a planar six-neighbor theorem and its applicationOn polarization of spherical codes and designsThe strong thirteen spheres problemOn the number of weakly connected subdigraphs in random \(k\)NN digraphsRigidity of spherical codesDelsarte method in the problem on kissing numbers in high-dimensional spacesExtremal problems of circle packings on a sphere and irreducible contact graphsKissing numbers and the centered maximal operatorUniversal lower bounds on energy and LP-extremal polynomials for \((4, 24)\)-codesNew upper bounds for kissing numbers from semidefinite programmingEnumeration of irreducible contact graphs on the sphereSphere packings revisitedTowards a proof of the 24-cell conjectureTD-pairs and the $q$-Onsager algebraImproving the Semidefinite Programming Bound for the Kissing Number by Exploiting Polynomial SymmetryAnalogs of Steiner's porism and Soddy's hexlet in higher dimensions via spherical codesOptimal and non-optimal lattices for non-completely monotone interaction potentialsUniversal lower bounds for potential energy of spherical codesOn contact graphs of totally separable packings in low dimensionsBounds for codes by semidefinite programmingThe extremal function in the Delsarte problem of finding an upper bound for the kissing number in the three-dimensional spaceAugmented Lagrangian methods for nonlinear programming with possible infeasibilityGraphs and spherical two-distance setsA survey on spherical designs and algebraic combinatorics on spheresCommutative association schemesKissing number in non-Euclidean spaces of constant sectional curvatureSpherical codes, maximal local packing density, and the golden ratioBounds for spherical codes: The Levenshtein framework liftedDistributing many points on spheres: minimal energy and designs




This page was built for publication: The kissing number in four dimensions