Delsarte method in the problem on kissing numbers in high-dimensional spaces
type: Item
instance of: scholarly article
title: Delsarte method in the problem on kissing numbers in high-dimensional spaces
zbMATH Open document ID: 1304.49057
DOI: 10.1134/S0081543814020102
author: N. A. Kuklin
published in: Proceedings of the Steklov Institute of Mathematics
publication date: 2014-12-17T00:00:00Z
Mathematics Subject Classification ID: 49M30
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 6381068
zbMATH Keywords: Delsarte method
zbMATH Keywords: Gegenbauer polynomials
zbMATH Keywords: kissing numbers
zbMATH Keywords: infinite-dimensional linear programming
MaRDI profile type: Publication
cites work: Q4231082
cites work: Q4039784
cites work: The problem of the twenty-five spheres
cites work: Extremal polynomials used in bounds of code volume
cites work: On polynomials orthogonal on several segments with indefinite weight
cites work: Q5754144
cites work: The minimum of potential energy of a System of point charges
cites work: Q3770273
cites work: 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
cites work: Q4119093
cites work: A new efficient algorithm for computing Gröbner bases \((F_4)\)
cites work: High-Accuracy Semidefinite Programming Bounds for Kissing Numbers
cites work: The kissing problem in three dimensions
cites work: The kissing number in four dimensions
cites work: New bounds on the number of unit spheres that can touch a unit sphere in n dimensions
cites work: Das Problem der dreizehn Kugeln
description: scientific article; zbMATH DE number 6381068