The extremal function in the Delsarte problem of finding an upper bound for the kissing number in the three-dimensional space
From MaRDI portal
Publication:2516599
DOI10.1134/S008154381502011XzbMath1321.52023MaRDI QIDQ2516599
Publication date: 3 August 2015
Published in: Proceedings of the Steklov Institute of Mathematics (Search for Journal in Brave)
Linear programming (90C05) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)
Cites Work
- Delsarte method in the problem on kissing numbers in high-dimensional spaces
- 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
- The kissing number in four dimensions
- The kissing problem in three dimensions
- The problem of the twenty-five spheres
- On polynomials orthogonal on several segments with indefinite weight
- Estimates of the maximal value of angular code distance for 24 and 25 points on the unit sphere in \(\mathbb{R}^4\)
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The extremal function in the Delsarte problem of finding an upper bound for the kissing number in the three-dimensional space
