An extremal decomposition problem for harmonic measure

Mathematics – Complex Variables

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

6 pages, 2 figures

Scientific paper

Let $E$ be a continuum in the closed unit disk $|z|\le 1$ of the complex $z$-plane which divides the open disk $|z| < 1$ into $n\ge 2$ pairwise non-intersecting simply connected domains $D_k,$ such that each of the domains $D_k$ contains some point $a_k$ on a prescribed circle $|z| = \rho, 0 <\rho <1, k=1,...,n\,. $ It is shown that for some increasing function $\Psi\,$ independent of $E$ and the choice of the points $a_k,$ the mean value of the harmonic measures $$ \Psi^{-1}\[ \frac{1}{n} \sum_{k=1}^{k} \Psi(\omega(a_k,E, D_k))] $$ is greater than or equal to the harmonic measure $\omega(\rho, E^*, D^*)\,,$ where $E^* = \{z: z^n \in [-1,0] \}$ and $D^* =\{z: |z|<1, |{\rm arg} z| < \pi/n\} \,.$ This implies, for instance, a solution to a problem of R.W. Barnard, L. Cole, and A. Yu. Solynin concerning a lower estimate of the quantity $\inf_{E} \max_{k=1,...,n} \omega(a_k,E, D_k)\,$ for arbitrary points of the circle $|z| = \rho \,.$ These authors stated this hypothesis in the particular case when the points are equally distributed on the circle $|z| = \rho \,.$

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

An extremal decomposition problem for harmonic measure does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An extremal decomposition problem for harmonic measure, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An extremal decomposition problem for harmonic measure will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-536781

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.