UPDF AI

On the Clustering of Padé Zeros and Poles of Random Power Series

S. Dostoglou,P. Valettas

2025 · DOI: 10.1093/imrn/rnaf007
International mathematics research notices · 1 Citations

Abstract

We estimate non-asymptotically the probability of uniform clustering around the unit circle of the zeros of the [m,n][m,n]-Padé approximant of a random power series f(z)=∑j=0∞ajzjf(z) = \sum _{j=0}^\infty a_{j} z^{j} for aja_{j} independent, with finite first moment, and Lévy function L(aj,ε)=sup⁡t∈RP(∣aj−t∣<ε) {\mathcal L}(a_{j}, \varepsilon ) =\sup _{t\in \mathbb R} \mathbb{P}(|a_{j} -t|<\varepsilon ) satisfying L(aj,ε)≤Kε{\mathcal L}(a_{j}, \varepsilon ) \leq K\varepsilon . Under the same assumptions we show that almost surely ff has infinitely many zeros in the unit disc, with the unit circle serving as a natural boundary for ff. For RmR_{m} the radius of the largest disc containing at most mm zeros of ff, the poles of the [m,n][m,n]-Padé approximant almost surely cluster uniformly at the circle of radius RmR_{m} as n→∞n \to \infty and mm stays fixed, and we provide almost sure rates of converge of these RmR_{m}’s to 11. We also show that our results on the clustering of the zeros hold for log-concave vectors (aj)(a_{j}) with not necessarily independent coordinates.