Related papers: A Comparison of Popular Point Configurations on $\…
We consider the equilibria of point particles under the action of two body central forces in which there are both repulsive and attractive interactions, often known as central configurations, with diverse applications in physics, in…
Approximation/interpolation from spaces of positive definite or conditionally positive definite kernels is an increasingly popular tool for the analysis and synthesis of scattered data, and is central to many meshless methods. For a set of…
We consider the logarithmic Fekete problem, which consists of placing a fixed number of points on the unit sphere in $\mathbb{R}^d$, in such a way that the product of all pairs of mutual Euclidean distances is maximized or, equivalently, so…
We introduce a projective Riesz $s$-kernel for the unit sphere $\mathbb{S}^{d-1}$ and investigate properties of $N$-point energy minimizing configurations for such a kernel. We show that these configurations, for $s$ and $N$ sufficiently…
Alternative iterative methods for a nonexpansive mapping in a Banach space are proposed and proved to be convergent to a common solution to a fixed point problem and a variational inequality. We give rates of asymptotic regularity for such…
The search for optimal configurations of pointsets, the most notable examples being the problems of Kepler and Thompson, have an extremely rich history with diverse applications in physics, chemistry, communication theory, and scientific…
We consider fixed-point equations for probability distributions on isometry classes of measured metric spaces. The construction is required to be recursive and tree-like, but we allow loops for the geodesics between points in the support of…
We derive the complete asymptotic expansion in terms of powers of $N$ for the Riesz $s$-energy of $N$ equally spaced points on the unit circle as $N\to \infty$. For $s\ge -2$, such points form optimal energy $N$-point configurations with…
For Riesz $s$-potentials $K(x,y)=|x-y|^{-s}$, $s>0$, we investigate separation and covering properties of $N$-point configurations $\omega^*_N=\{x_1, \ldots, x_N\}$ on a $d$-dimensional compact set $A\subset \mathbb{R}^\ell$ for which the…
In this paper, we study the expected value of the pair correlation statistics of randomized point configurations on the sphere, with the emphasis on point configurations generated by determinantal point processes. We study the cases of the…
The problem of interpolation at $(n+1)^2$ points on the unit sphere $\mathbb{S}^2$ by spherical polynomials of degree at most $n$ is proved to have a unique solution for several sets of points. The points are located on a number of circles…
This article is concerned with the problem of placing seven or eight points on the unit sphere $\mathbb{S}^2$ in $\mathbb{R}^3$ so that the surface area of the convex hull of the points is maximized. In each case, the solution is given for…
This work, which may be seen as a companion paper to \cite{RS2}, handles the way the intersection points made by the diagonals of a regular polygon are distributed. It was stated recently by the authors that these points lie exclusively on…
We study combinatorial configurations with the associated point and line graphs being strongly regular. Examples not belonging to known classes such as partial geometries and their generalizations or elliptic semiplanes are constructed.…
We establish sharp pointwise inequalities for the Riesz potential and its gradient in $\mathbb{R}^{n}$ and indicate their usefulness for potential analysis, moment theory and other applications.
We propose algorithms to take point sets for kernel-based interpolation of functions in reproducing kernel Hilbert spaces (RKHSs) by convex optimization. We consider the case of kernels with the Mercer expansion and propose an algorithm by…
Kim defined a very general combinatorial abstraction of the diameter of polytopes called subset partition graphs to study how certain combinatorial properties of such graphs may be achieved in lower bound constructions. Using Lov\'asz'…
We present an algorithm for producing discrete distributions with a prescribed nearest-neighbor distance function. Our approach is a combination of quasi-Monte Carlo (Q-MC) methods and weighted Riesz energy minimization: the initial…
Projection methods are popular algorithms for iteratively solving feasibility problems in Euclidean or even Hilbert spaces. They employ (selections of) nearest point mappings to generate sequences that are designed to approximate a point in…
We consider rational points on the sphere and investigate their equidistribution in shrinking spherical caps. For the two-dimensional sphere, we leverage Hecke operators to obtain a significantly improved small-scale equidistribution bound,…