Physics:Polarization constants
In potential theory and optimization, polarization constants (also known as Chebyshev constants) are solutions to a max-min problem for potentials. Originally, these problems were introduced by a Japanese mathematician Makoto Ohtsuka.[1] Recently these problems got some attention as they can help to generate random points on smooth manifolds (in particular, unit sphere) with prescribed probability density function. The problem of finding the polarization constant is connected to the problem of energy minimization and, in particular to the Thomson problem.[2][3]
Practical motivation
From the practical point of view, these problems can be used to answer the following question: if [math]\displaystyle{ K(x,x_j) }[/math] denotes the amount of a substance received at [math]\displaystyle{ x }[/math] due to an injector of the substance located at [math]\displaystyle{ x_j }[/math], what is the smallest number of like injectors and their optimal locations on [math]\displaystyle{ A }[/math] so that a prescribed minimal amount of the substance reaches every point of [math]\displaystyle{ A }[/math]? For example, one can relate this question to treating tumors with radioactive seeds.
Formal Definition
More precisely, for a compact set [math]\displaystyle{ A }[/math] and kernel [math]\displaystyle{ K:A\times A \to \mathbb{R}\cup\{+\infty\} }[/math], the discrete polarization problem is the following: determine [math]\displaystyle{ N }[/math]-point configurations [math]\displaystyle{ \{x_j\}_{j=1}^N }[/math] on [math]\displaystyle{ A }[/math] so that the minimum of [math]\displaystyle{ \sum_{j=1}^N K(x,x_j) }[/math] for [math]\displaystyle{ x\in A }[/math] is as large as possible.
Classical kernels
The Chebyshev nomenclature for this max-min problem emanates from the case when [math]\displaystyle{ K }[/math] is the logarithmic kernel, [math]\displaystyle{ K(x,y)=\log |x-y|^{-1}, }[/math] for when [math]\displaystyle{ A }[/math] is a subset of the complex plane, the problem is equivalent to finding the constrained [math]\displaystyle{ N }[/math]-th degree Chebyshev polynomial for [math]\displaystyle{ A }[/math]; that is, the monic polynomial in the complex variable [math]\displaystyle{ z }[/math] with all its zeros on [math]\displaystyle{ A }[/math] having minimal uniform norm on [math]\displaystyle{ A }[/math].
If [math]\displaystyle{ A }[/math] is the unit circle in the plane and [math]\displaystyle{ K(x,y)=|x-y|^{-s} }[/math], [math]\displaystyle{ s\gt 0 }[/math] (i.e., kernel of a Riesz potential), then [math]\displaystyle{ N }[/math] equally spaced points on the circle solve the [math]\displaystyle{ N }[/math] point polarization problem.[4][5]
References
- ↑ Ohtsuka, Makoto (1967). "On various definitions of capacity and related notions". Nagoya Mathematical Journal 30: 121–127. doi:10.1017/S0027763000012411.
- ↑ Farkas, Bálint; Révész, Szilárd Gy. (2006). "Potential theoretic approach to rendezvous numbers". Monatshefte für Mathematik 148 (4): 309–331. doi:10.1007/s00605-006-0397-5.
- ↑ Borodachov, Sergiy V.; Hardin, Douglas P.; Reznikov, Alexander; Saff, Edward B. (2018). "Optimal discrete measures for Riesz potentials". Transactions of the American Mathematical Society 370 (10): 6973–6993. doi:10.1090/tran/7224.
- ↑ Ambrus, Gergely (2013). "Chebyshev constants for the unit circle". Bulletin of the London Mathematical Society 45 (2): 236–248. doi:10.1112/blms/bds082.
- ↑ Hardin, Douglas P.; Kendall, Amos P.; Saff, Edward B. (2013). "Polarization optimality of equally spaced points on the circle for discrete potentials". Discrete & Computational Geometry 50 (1): 236–243. doi:10.1007/s00454-013-9502-4.
 |  |
