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

DOI10.1134/S0081543814020102zbMath1304.49057MaRDI QIDQ483413

N. A. Kuklin

Publication date: 17 December 2014

Published in: Proceedings of the Steklov Institute of Mathematics (Search for Journal in Brave)

zbMATH Keywords

Gegenbauer polynomialskissing numbersinfinite-dimensional linear programmingDelsarte method

Mathematics Subject Classification ID

Related Items (3)

Delsarte’s extremal problem and packing on locally compact Abelian groups ⋮ Approximation of the differentiation operator by linear bounded operators on the class of twice differentiable functions in the space \(L_2(0,\infty)\) ⋮ The extremal function in the Delsarte problem of finding an upper bound for the kissing number in the three-dimensional space

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Extremal polynomials used in bounds of code volume
• New bounds on the number of unit spheres that can touch a unit sphere in n dimensions
• A new efficient algorithm for computing Gröbner bases \((F_4)\)
• The kissing number in four dimensions
• Bruno Buchberger's PhD thesis 1965: An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal. Translation from the German
• The kissing problem in three dimensions
• Das Problem der dreizehn Kugeln
• High-Accuracy Semidefinite Programming Bounds for Kissing Numbers
• The minimum of potential energy of a System of point charges
• The problem of the twenty-five spheres
• On polynomials orthogonal on several segments with indefinite weight

This page was built for publication: Delsarte method in the problem on kissing numbers in high-dimensional spaces