SearcharxivSearch

arXiv · 2504.11593

Zeros and exponential profiles of polynomials I: Limit distributions, finite free convolutions and repeated differentiation

Abstract

Given a sequence of polynomials $(P_n)_{n \in \mathbb{N}}$ with only nonpositive zeros, the aim of this article is to present a user-friendly approach for determining the limiting zero distribution of $P_n$ as $\mathrm{deg}\, P_n \to \infty$. The method is based on establishing an equivalence between the existence of a limiting empirical zero distribution $\mu$ and the existence of an exponential profile $g$ associated with the coefficients of the polynomials $(P_n)_{n \in \mathbb{N}}$. The exponential profile $g$, which can be roughly described by $[z^k]P_n(z) \approx \exp(n g(k/n))$, offers a direct route to computing the Cauchy transform $G$ of $\mu$: the functions $t \mapsto tG(t)$ and $\alpha \mapsto \exp(-g'(\alpha))$ are mutual inverses. This relationship, in various forms, has previously appeared in the literature, most notably in the paper [Van Assche, Fano and Ortolani, SIAM J. Math. Anal., 1987]. As a first contribution, we present a self-contained probabilistic proof of this equivalence by representing the polynomials as generating functions of sums of independent Bernoulli random variables. This probabilistic framework naturally lends itself to tools from large deviation theory, such as the exponential change of measure. The resulting theorems generalize and unify a range of previously known results, which were traditionally established through analytic or combinatorial methods. Secondly, using the profile-based approach, we investigate how the exponential profile and the limiting zero distribution behave under certain operations on polynomials, including finite free convolutions, Hadamard products, and repeated differentiation. In particular, our approach yields new proofs of the convergence results `$\boxplus_n \to \boxplus$' and `$\boxtimes_n \to \boxtimes$', extending them to cases where the distributions are not necessarily compactly supported.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jonas Jalowy, Zakhar Kabluchko, Alexander Marynych. 2025-04-15. Zeros and exponential profiles of polynomials I: Limit distributions, finite free convolutions and repeated differentiation. https://arxiv.org/abs/2504.11593

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR