By Douglas Hardin and others

We introduce and study the unconstrained polarization (or Chebyshev) problem which requires to find an $N$-point configuration that maximizes the minimum value of its potential over a set $A$ in $p$-dimensional Euclidean space. This problem is compared to the constrained problem in which the points are required to belong to... Show more

March 23, 2019

Loading full text...

Similar articles

Loading recommendations...

x1

Unconstrained polarization (Chebyshev) problems: basic properties and Riesz kernel asymptotics

Click on play to start listening