Related papers: Positive definite functions in distance geometry
In 1942 I. J. Schoenberg proved that a function is positive definite in the unit sphere if and only if this function is a positive linear combination of the Gegenbauer polynomials. In this paper we extend Schoenberg's theorem for…
We develop a theory of partially defined complete positivity preservers, extending Schoenberg's classical characterization to functions defined only on discrete subsets or constrained domains. We frame the extension problem through the…
These lecture notes treat the solution of the kissing number problem in four dimesions which is based on an extension of the Delsarte method for spherical codes.
We present an extension of the Delsarte linear programming method. For several dimensions it yields improved upper bounds for kissing numbers and for spherical codes. Musin's recent work on kissing numbers in dimensions three and four can…
We present an overview of a classical theme in analysis and matrix positivity: the question of which functions preserve positive semidefiniteness when applied entrywise. In addition to drawing the attention of experts such as Schoenberg,…
The kissing number problem asks for the maximal number k(n) of equal size nonoverlapping spheres in n-dimensional space that can touch another sphere of the same size. This problem in dimension three was the subject of a famous discussion…
Delsarte's method and its extensions allow to consider the upper bound problem for codes in 2-point-homogeneous spaces as a linear programming problem with perhaps infinitely many variables, which are the distance distribution. We show that…
Positive definite functions on spheres have received an increasing interest in many branches of mathematics and statistics. In particular, the Schoenberg sequences in the spectral representation of positive definite functions have been…
Pfender \textit{[J. Combin. Theory Ser. A, 2007]} provided a one-line proof for a variant of the Delsarte-Goethals-Seidel-Kabatianskii-Levenshtein upper bound for spherical codes, which offers an upper bound for the celebrated…
In this paper, we investigate the relationship between positive definite functions on the unit sphere $\sph$ and on the Euclidean space $\RR^d$. For the dimension $d$ to be odd, a new technique is developed to establish the inheritance of…
We consider bounds on codes in spherical caps and related problems in geometry and coding theory. An extension of the Delsarte method is presented that relates upper bounds on the size of spherical codes to upper bounds on codes in caps.…
It is shown that the integrals of the Jacobi polynomials \begin{equation*}%\label{eq:Fn^J} \int_0^t (t-\theta)^\delta P_n^{(\alpha-\frac12,\beta-\frac12)}(\cos \theta) \left(\sin \tfrac{\theta}2\right)^{2 \alpha} \left(\cos…
Positive definite functions are very important in both theory and applications of approximation theory, probability and statistics. In particular, identifying strictly positive definite kernels is of great interest as interpolation problems…
The kissing number k(3) is the maximal number of equal size nonoverlapping spheres in three dimensions that can touch another sphere of the same size. This number was the subject of a famous discussion between Isaac Newton and David Gregory…
Spherical codes, with a rich history spanning nearly five centuries, remain an area of active mathematical exploration and are far from being fully understood. These codes, which arise naturally in problems of geometry, combinatorics, and…
Isotropic positive definite functions on spheres play important roles in spatial statistics, where they occur as the correlation functions of homogeneous random fields and star-shaped random particles. In approximation theory, strictly…
The kissing number of $\mathbb{R}^n$ is the maximum number of pairwise-nonoverlapping unit spheres that can simultaneously touch a central unit sphere. Mittelmann and Vallentin (2010), based on the semidefinite programming bound of Bachoc…
We present an extension of known semidefinite and linear programming upper bounds for spherical codes. We apply the main result for the distance distribution of a spherical code and show that this method can work effectively In particular,…
It has been shown that the maximum stable set problem in some infinite graphs, and the kissing number problem in particular, reduces to a minimization problem over the cone of copositive kernels. Optimizing over this infinite dimensional…
Schoenberg's theorem for the complex Hilbert sphere proved by Christensen and Ressel in 1982 by Choquet theory is extended to the following result: Let L denote a locally compact group and let \overline{\D} denote the closed unit disc in…