An extremal problem for the Bergman kernel of orthogonal polynomials
S. Charpentier, N. Levenberg, F. Wielonsky

TL;DR
This paper investigates the asymptotic behavior of probability measures minimizing the Bergman function on a curve, showing they converge to a balayage measure, with implications for orthogonal polynomials and potential theory.
Contribution
It establishes the weak-* convergence of extremal measures to the balayage of a point mass, linking Bergman kernel optimization to measures on the unit circle and Faber polynomial estimates.
Findings
Extremal measures $ u_n$ tend to the balayage measure $ ilde{ u}$ as n increases.
The convergence is shown via a connection to an optimization problem on the unit circle.
The proof utilizes estimates for Faber polynomials associated with the curve $\Gamma$.
Abstract
Let be a curve of class . For in the unbounded component of , and for , let be a probability measure with supp which minimizes the Bergman function at among all probability measures on (here, are an orthonormal basis in for the holomorphic polynomials of degree at most ). We show that tends weak-* to , the balayage of the point mass at onto , by relating this to an optimization problem for probability measures on the unit circle. Our proof makes use of estimates for Faber polynomials associated to .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsHolomorphic and Operator Theory · Meromorphic and Entire Functions · Mathematical functions and polynomials
