Related papers: Unconstrained polarization (Chebyshev) problems: b…
The study is motivated by the known fact that, in the noncompact case, the main minimum-problem of the theory of interior capacities of condensers in a locally compact space is in general unsolvable, and this occurs even under very natural…
The study deals with the theory of interior capacities of condensers in a locally compact space, a condenser being treated here as a countable, locally finite collection of arbitrary sets with the sign +1 or -1 prescribed such that the…
There is a vast theory of Chebyshev and residual polynomials and their asymptotic behavior. The former ones maximize the leading coefficient and the latter ones maximize the point evaluation with respect to an $L^\infty$ norm. We study…
The problem of resolving the fine details of a signal from its coarse scale measurements or, as it is commonly referred to in the literature, the super-resolution problem arises naturally in engineering and physics in a variety of settings.…
The Chebyshev set of a bounded set $K$ in a normed space is the set of centers of all minimal enclosing balls of $K$. We use the concept of ball intersection and ball hull operators to derive new properties of Chebyshev sets in normed…
Uniformly distributed point sets on the unit sphere with and without symmetry constraints have been found useful in many scientific and engineering applications. Here, a novel variant of the Thomson problem is proposed and formulated as an…
We prove an asymptotic crystallization result in two dimensions for a class of nonlocal particle systems. To be precise, we consider the best approximation with respect to the 2-Wasserstein metric of a given absolutely continuous…
In this paper we study the asymptotic properties of point configurations that achieve optimal covering of sets lacking smoothness. Our results include the proofs of the existence of asymptotics of best covering and maximal polarization for…
The problem of finding the asymptotic behavior of the maximal density of sphere packings in high Euclidean dimensions is one of the most fascinating and challenging problems in discrete geometry. One century ago, Minkowski obtained a…
We consider the minimal energy problem on the unit sphere $\mathbb{S}^d$ in the Euclidean space $\mathbb{R}^{d+1}$ in the presence of an external field $Q$, where the energy arises from the Riesz potential $1/r^s$ (where $r$ is the…
We solve the nonlinear Dirichlet problem (uniquely) for functions with prescribed asymptotic singularities at a finite number of points, and with arbitrary continuous boundary data, on a domain in euclidean space. The main results apply, in…
We study a variational problem for the perimeter associated with the Grushin plane, called minimal partition problem with trace constraint. This consists in studying how to enclose three prescribed areas in the Grushin plane, using the…
We investigate properties of minimal $N$-point Riesz $s$-energy on fractal sets of non-integer dimension, as well as asymptotic behavior of $N$-point configurations that minimize this energy. For $s$ bigger than the dimension of the set…
In this paper, code decompositions (a.k.a. code nestings) are used to design binary polarization kernels. The proposed kernels are in general non-linear. They provide a better polarization exponent than the previously known kernels of the…
We investigate the behavior of a greedy sequence on the sphere $\mathbb{S}^d$ defined so that at each step the point that minimizes the Riesz $s$-energy is added to the existing set of points. We show that for $0<s<d$, the greedy sequence…
The multivariate integer Chebyshev problem is to find polynomials with integer coefficients that minimize the supremum norm over a compact set in $\C^d.$ We study this problem on general sets, but devote special attention to product sets…
Let $A$ be a compact $d$-rectifiable set embedded in Euclidean space $\RR^p$, $d\le p$. For a given continuous distribution $\sigma(x)$ with respect to $d$-dimensional Hausdorff measure on $A$, our earlier results provided a method for…
A kernelization is an efficient algorithm that given an instance of a parameterized problem returns an equivalent instance of size bounded by some function of the input parameter value. It is quite well understood which problems do or…
We study some convergence issues for a recent approach to the problem of transparent boundary conditions for the Helmholtz equation in unbounded domains. The approach is based on the minimization on an integral functional which arises from…
We study the n-dimensional problem of finding the smallest ball enclosing the intersection of p given balls, the so-called Chebyshev center problem (CCB). It is a minimax optimization problem and the inner maximization is a uniform…