Related papers: Unconstrained polarization (Chebyshev) problems: b…
Finding point configurations, that yield the maximum polarization (Chebyshev constant) is gaining interest in the field of geometric optimization. In the present article, we study the problem of unconstrained maximum polarization on compact…
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…
For $s\geqslant d$, we obtain the leading term as $N\to \infty$ of the maximal weighted $N$-point Riesz $s$-polarization (or Chebyshev constant) for a certain class of $d$-rectifiable compact subsets of $\mathbb{R}^p$. This class includes…
We derive bounds and asymptotics for the maximum Riesz polarization quantity $$M_n^p(A) := \max_{{\bold x}_1, {\bold x}_2, \ldots, {\bold x}_n \in A} {\min_{{\bold x} \in A}{\sum_{j=1}^n{\frac{1}{|{\bold x} - {\bold x}_j|^{p}}}}}$$ (which…
Given a compact $d$-rectifiable set $A$ embedded in Euclidean space and a distribution $\rho(x)$ with respect to $d$-dimensional Hausdorff measure on $A$, we address the following question: how can one generate optimal configurations of $N$…
For a compact set A in Euclidean space we consider the asymptotic behavior of optimal (and near optimal) N-point configurations that minimize the Riesz s-energy (corresponding to the potential 1/t^s) over all N-point subsets of A, where…
Our main result shows that if a lower-semicontinuous kernel K satisfies some mild additional hypotheses, then asympotitically polarization optimal configurations are precisely those that are asymptotically distributed according to the…
We study the computational complexity of exact cardinality-constrained minimum Riesz $s$-energy subset selection in finite metric spaces: given $n$ points, select $k<n$ points of minimum Riesz $s$-energy. The objective sums inverse-power…
For a compact $ d $-dimensional rectifiable subset of $ \mathbb{R}^{p} $ we study asymptotic properties as $ N\to\infty $ of $N$-point configurations minimizing the energy arising from a Riesz $ s $-potential $ 1/r^s $ and an external field…
We study systems of $n$ points in the Euclidean space of dimension $d \ge 1$ interacting via a Riesz kernel $|x|^{-s}$ and confined by an external potential, in the regime where $d-2\le s<d$. We also treat the case of logarithmic…
We investigate the asymptotic behavior, as $N$ grows, of the largest minimal pairwise distance of $N$ points restricted to an arbitrary compact rectifiable set embedded in Euclidean space, and we find the limit distribution of such optimal…
We study a constrained minimum energy problem with an external field relative to the Riesz kernel of an arbitrary order for a generalized condenser with touching oppositely-charged plates. Conditions sufficient for the solvability of the…
In this article we investigate the $N$-point min-max and the max-min polarization problems on the sphere for a large class of potentials in $\mathbb{R}^n$. We derive universal lower and upper bounds on the polarization of spherical designs…
Given a compact subset of a Banach space, the Chebyshev center problem consists of finding a minimal circumscribing ball containing the set. In this article we establish a numerically tractable algorithm for solving the Chebyshev center…
We study the constrained minimum energy problem with an external field relative to the $\alpha$-Riesz kernel $|x-y|^{\alpha-n}$ of order $\alpha\in(0,n)$ for a generalized condenser $\mathbf A=(A_i)_{i\in I}$ in $\mathbb R^n$, $n\geqslant…
Utilizing frameworks developed by Delsarte, Yudin and Levenshtein, we deduce linear programming lower bounds (as $N\to \infty$) for the Riesz energy of $N$-point configurations on the $d$-dimensional unit sphere in the so-called…
We consider the extremal pointset configuration problem of maximizing a kernel-based energy subject to the geometric constraints that the points are contained in a fixed set, the pairwise distances are bounded below, and that every closed…
A kernelization algorithm for a computational problem is a procedure which compresses an instance into an equivalent instance whose size is bounded with respect to a complexity parameter. For the Boolean satisfiability problem (SAT), and…
The Riesz $s$-energy of an $N$-point configuration in the Euclidean space $\mathbb{R}^{p}$ is defined as the sum of reciprocal $s$-powers of all mutual distances in this system. In the limit $s\to0$ the Riesz $s$-potential $1/r^s$ ($r$ the…
We study the solution set to multivariate Chebyshev approximation problem, focussing on the ill-posed case when the uniqueness of solutions can not be established via strict polynomial separation. We obtain an upper bound on the dimension…