Related papers: Positive definite functions in distance geometry

We study the Delsarte problem for even functions continuous on [-1,1], nonpositive on [-1/2,1/2], and representable as series with respect to the ultraspherical polynomials. The value of the Delsarte problem gives an upper bound for the…

We study the distance set problem for pairs of compact sets $A, B\subset \mathbb{R}^n$, $n\geq 2$. We show that if $B$ is contained in a hyperplane and \begin{align*} \dim_{H} A+\dim_{H} B>n, \end{align*} then the distance set $…

A finite set $X$ in the Euclidean unit sphere is called an $s$-distance set if the set of distances between any distinct two elements of $X$ has size $s$. We say that $t$ is the strength of $X$ if $X$ is a spherical $t$-design but not a…

Given a C$^*$-algebra $A$, let $S(A^+)$ denote the set of those positive elements in the unit sphere of $A$. Let $H_1$, $H_2,$ $H_3$ and $H_4$ be complex Hilbert spaces, where $H_3$ and $H_4$ are infinite-dimensional and separable. In this…

This review paper is devoted to the problems of sphere packings in 4 dimensions. The main goal is to find reasonable approaches for solutions to problems related to densest sphere packings in 4-dimensional Euclidean space. We consider two…

There is a growing interest in developing covariance functions for processes on the surface of a sphere due to wide availability of data on the globe. Utilizing the one-to-one mapping between the Euclidean distance and the great circle…

The set B of geodesic rays avoiding a suitable obstacle in a complete negatively curved Riemannian manifold determines a spectrum S. While various properties of this spectrum are known, we define and study dimension functions on S in terms…

We consider the class $\Psi_d$ of continuous functions $\psi \colon [0,\pi] \to \mathbb{R}$, with $\psi(0)=1$ such that the associated isotropic kernel $C(\xi,\eta)= \psi(\theta(\xi,\eta))$ ---with $\xi,\eta \in \mathbb{S}^d$ and $\theta$…

We prove a lower bound of $\Omega (d^{3/2} \cdot (2/\sqrt{3})^d)$ on the kissing number in dimension $d$. This improves the classical lower bound of Chabauty, Shannon, and Wyner by a linear factor in the dimension. We obtain a similar…

Since Isaac Newton first studied the Kissing Number Problem in 1694, determining the maximal number of non-overlapping spheres around a central sphere has remained a fundamental challenge. This problem is the local analogue of Hilbert's…

In this expository paper aimed at a general mathematical audience, we discuss how to combine certain classic theorems of set-theoretic inner model theory and effective descriptive set theory with work on Hilbert's tenth problem and…

We prove that the kissing number in 48 dimensions among antipodal spherical codes with certain forbidden inner products is 52\,416\,000. Constructions of attaining codes as kissing configurations of minimum vectors in even unimodular…

We establish upper bounds for the size of two-distance sets in Euclidean space and spherical two-distance sets. The main recipe for obtaining upper bounds is the spectral method. We construct Seidel matrices to encode the distance relations…

Magnitude is a numerical invariant of finite metric spaces, recently introduced by T. Leinster, which is analogous in precise senses to the cardinality of finite sets or the Euler characteristic of topological spaces. It has been extended…

We study a primal-dual interior point method specialized to clustered low-rank semidefinite programs requiring high precision numerics, which arise from certain multivariate polynomial (matrix) programs through sums-of-squares…

A subset $X$ in the $d$-dimensional Euclidean space is called a $k$-distance set if there are exactly $k$ distinct distances between two distinct points in $X$ and a subset $X$ is called a locally $k$-distance set if for any point $x$ in…

We introduce the cone of completely-positive functions, a subset of the cone of positive-type functions, and use it to fully characterize maximum-density distance-avoiding sets as the optimal solutions of a convex optimization problem. As a…

We show that isotropic positive definite functions on the $d$-dimensional sphere which are $2k$ times differentiable at zero have $2k+[(d-1)/2]$ continuous derivatives on $(0,\pi)$. This result is analogous to the result for radial positive…

We prove that the $D_4$ root system (the set of vertices of the regular $24$-cell) is the unique optimal kissing configuration in $\mathbb R^4$, and is an optimal spherical code. For this, we use semidefinite programming to compute an exact…

We show that the even- resp. odd-dimensional Schoenberg coefficients in Gegenbauer expansions of isotropic positive definite functions on the d-sphere can be expressed as linear combinations of Fourier resp. Legendre coefficients, and we…