RUS  ENG
Full version
JOURNALS // Trudy Instituta Matematiki i Mekhaniki UrO RAN // Archive

Trudy Inst. Mat. i Mekh. UrO RAN, 2012 Volume 18, Number 4, Pages 224–239 (Mi timm881)

This article is cited in 5 papers

Delsarte method in the problem on kissing numbers in high-dimensional spaces

N. A. Kuklinab

a Institute of Mathematics and Mechanics, Ural Branch of the Russian Academy of Sciences
b Ural Federal University

Abstract: We consider extremal problems for continuous functions that are nonpositive on a closed interval and can be represented as series in Gegenbauer polynomials with nonnegative coefficients. These problems arise from the Delsarte method of finding an upper bound for the kissing number in the Euclidean space. We develop a general method for solving such problems. Using this method, we reproduce results of previous authors and find a solution in the following 11 new dimensions: 147, 157, 158, 159, 160, 162, 163, 164, 165, 167, and 173. The arising extremal polynomials are of a new type.

Keywords: Delsarte method, infinite-dimensional linear programming, Gegenbauer polynomials, kissing numbers.

UDC: 517.518.86+519.147

Received: 29.02.2012


 English version:
Proceedings of the Steklov Institute of Mathematics (Supplement Issues), 2014, 284, suppl. 1, S108–S123

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2025