The problem of the twenty-five spheres

DOI10.1070/RM2003v058n04ABEH000651zbMath1059.52023WikidataQ29541777 ScholiaQ29541777MaRDI QIDQ4829637

Oleg R. Musin

Publication date: 29 November 2004

Published in: Russian Mathematical Surveys (Search for Journal in Brave)

zbMATH Keywords

spherical codesDelsarte's methodkissing number of spheres

Mathematics Subject Classification ID

Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Combinatorial aspects of packing and covering (05B40)

Related Items (14)

Apollonian ball packings and stacked polytopes ⋮ Моделирование графов ближайших соседей для оценки вероятности независимости выборочных данных;Modeling of nearest neighbor graphs to estimate the probability of independence of data ⋮ Delsarte method in the problem on kissing numbers in high-dimensional spaces ⋮ Extremal problems of circle packings on a sphere and irreducible contact graphs ⋮ Enumeration of irreducible contact graphs on the sphere ⋮ Sphere packings revisited ⋮ Towards a proof of the 24-cell conjecture ⋮ Bounds for codes by semidefinite programming ⋮ The extremal function in the Delsarte problem of finding an upper bound for the kissing number in the three-dimensional space ⋮ INFINITE SYSTEM OF BROWNIAN BALLS: EQUILIBRIUM MEASURES ARE CANONICAL GIBBS ⋮ A Combinatorial Approach to Small Ball Inequalities for Sums and Differences ⋮ A survey on spherical designs and algebraic combinatorics on spheres ⋮ Detecting a botnet in a network ⋮ Kissing numbers for balls with varying radii

This page was built for publication: The problem of the twenty-five spheres