On the clustering of Pad\'e zeros and poles of random power series

Abstract

We estimate non-asymptotically the probability of uniform clustering around the unit circle of the zeros of the [m,n]-Pad\'e approximant of a random power series f(z) = Σj=0∞ aj zj for aj independent, with finite first moment, and L\'evy function satisfying L(aj , ) ≤ K. Under the same assumptions we show that almost surely f has infinitely many zeros in the unit disc, with the unit circle serving as a natural boundary for f. For Rm the radius of the largest disc containing at most m zeros of f, a deterministic result of Edrei implies that in our setting the poles of the [m,n]-Pad\'e approximant almost surely cluster uniformly at the circle of radius Rm as n ∞ and m stays fixed, and we provide almost sure rates of converge of these Rm's to 1. We also show that our results on the clustering of the zeros hold for log-concave vectors (aj) with not necessarily independent coordinates.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…