Two-sided bounds for the logarithmic capacity of multiple intervals

From MaRDI portal



Abstract: Potential theory on the complement of a subset of the real axis attracts a lot of attention both in function theory and applied sciences. The paper discusses one aspect of the theory - the logarithmic capacity of closed subsets of the real line. We give simple but precise upper and lower bounds for the logarithmic capacity of multiple intervals and a lower bound valid also for closed sets comprising an infinite number of intervals. Using some known methods to compute the exact values of capacity we demonstrate graphically how our estimates compare with them. The main machinery behind our results are separating transformation and dissymmetrization developed by V.N. Dubinin and a version of the latter by K. Haliste as well as some classical symmetrization and projection result for logarithmic capacity. The results of the paper improve some previous achievements by A.Yu. Solynin and K. Shiefermayr.


Let \(E\) be the disjoint union of finitely many closed subintervals of \([-1,1]\). This paper gives sharp upper and lower bounds for the logarithmic capacity, \(\text{cap\,}E\), of \(E\) that improve several known estimates. For example, if \[ E=\bigcup _{1}^{n}[a_{k},b_{k}],\quad\text{where}\quad -1=a_{1}<b_{1}<a_{2}<...<b_{n}=1\quad\text{and}\quad n\geq 2, \] then \(\text{cap\,}E\) is at most \[ \frac{1}{2}\left\{ \cos \left[ 2^{-1}\sum_{1}^{n-1}\left( \cos^{-1}(a_{k+1})-\cos^{-1}(b_{k})\right) \right] \right\} ^{1/(n-1)}, \] and examples are provided where equality occurs. One of the lower estimates established for \(\text{cap\,}E\) is valid even for arbitrary closed subsets \(E\) of \([-1,1]\). The bounds provided are compared graphically with the results of numerical computations.











This page was built for publication: Two-sided bounds for the logarithmic capacity of multiple intervals

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q542040)