# Maximin Polynomials and Inverse Balayage

Maximin Polynomials and Inverse Balayage For a bounded domain G in the complex plane, we focus on the problem of maximizing the minimum on the boundary ∂G of (weighted) polynomials of degree n having all zeros in a set D ⊂ G. For arbitrary unit measures μ on ∂ G and weight w:= exp{Uμ}, the n-th root asymptotics of \documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$$\matrix{{\rm sup} \cr pn} \matrix{{\rm inf} \cr z \varepsilon \partial G} \mid P_n(z)\omega^n(z) \mid$$\end{document} is considered and related to the existence and construction of an inverse balayage of μ on \documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$$\overline D$$\end{document}, i.e. of a measure such that μ is its balayage when sweeping to ∂G. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Computational Methods and Function Theory Springer Journals

# Maximin Polynomials and Inverse Balayage

, Volume 5 (1) – Aug 1, 2005
7 pages      