English
Related papers

Related papers: Real Roots of Random Polynomials and Zero Crossing…

200 papers

The expected number of zeros of a random real polynomial of degree $N$ asymptotically equals $\frac{2}{\pi}\log N$. On the other hand, the average fraction of real zeros of a random trigonometric polynomial of increasing degree $N$…

Algebraic Geometry · Mathematics 2022-06-29 Boris Kazarnovskii

This paper extends earlier work on the distribution in the complex plane of the roots of random polynomials. In this paper, the random polynomials are generalized to random finite sums of given "basis" functions. The basis functions are…

Probability · Mathematics 2016-08-04 Robert J. Vanderbei

Let f:=(f^1,\...,f^n) be a sparse random polynomial system. This means that each f^i has fixed support (list of possibly non-zero coefficients) and each coefficient has a Gaussian probability distribution of arbitrary variance. We express…

Numerical Analysis · Mathematics 2025-10-20 Gregorio Malajovich , J. Maurice Rojas

We compute the logarithmic asymptotics of the non-existence probability (and more generally the lower-tail probability) for a wide variety of combinatorial problems for a range of parameters in the `critical regime' between the regime…

Combinatorics · Mathematics 2026-04-07 Matthew Jenssen , Will Perkins , Aditya Potukuchi , Michael Simkin

Zeros of many ensembles of polynomials with random coefficients are asymptotically equidistributed near the unit circumference. We give quantitative estimates for such equidistribution in terms of the expected discrepancy and expected…

Probability · Mathematics 2014-07-28 Igor E. Pritsker , Aaron M. Yeager

Let $\xi_0, \xi_1, \dots$ be i.i.d. random variables with zero mean and unit variance. We study the following four families of random analytic functions: $\sum_{k=0}^n \sqrt{\binom nk} \xi_k z^k$ (spherical polynomials), $\sum_{k=0}^\infty…

Probability · Mathematics 2018-07-05 Hendrik Flasche , Zakhar Kabluchko

Let $O(2n+\ell)$ be the group of orthogonal matrices of size $\left(2n+\ell\right)\times \left(2n+\ell\right)$ equipped with the probability distribution given by normalized Haar measure. We study the probability \begin{equation*}…

Probability · Mathematics 2019-05-09 Martin Gebert , Mihail Poplavskyi

Let $f_n$ be a random polynomial of degree $n\ge 2$ whose coefficients are independent and identically distributed random variables. We study the separation distances between roots of $f_n$ and prove that the set of these distances,…

Probability · Mathematics 2025-05-06 Marcus Michelen , Oren Yakir

It is well known that a random cosine polynomial $ V_n(x) = \sum_ {j=0} ^{n} a_j \cos (j x) , \ x \in (0,2 \pi) $, with the coefficients being independent and identically distributed (i.i.d.) real-valued standard Gaussian random variables…

Probability · Mathematics 2019-08-23 Ali Pirhadi

We study the asymptotic distribution of roots of Lommel polynomials as polynomials of the order with a variable and purely imaginary argument. The roots are complex and accumulate on certain curves in the complex plane. We prove existence…

Classical Analysis and ODEs · Mathematics 2021-02-02 Petr Blaschke , František Štampach

We investigate quantum persistence by analyzing amplitude and phase fluctuations of the wave function governed by the time-dependent free-particle Schr\"odinger equation. The quantum system is initialized with local random uncorrelated…

Statistical Mechanics · Physics 2025-05-09 Cheng Ma , Omar Malik , G. Korniss

In [Jalowy, Kabluchko, Marynych, arXiv:2504.11593v1, 2025], the authors discuss a user-friendly approach to determine the limiting empirical zero distribution of a sequence of real-rooted polynomials, as the degree goes to $\infty$. In this…

Classical Analysis and ODEs · Mathematics 2025-09-16 Jonas Jalowy , Zakhar Kabluchko , Alexander Marynych

We use the method of steepest descents to study the root distribution of the Ehrhart polynomial of the $d$-dimensional cross-polytope, namely $\mathcal{L}_{d}$, as $d\rightarrow \infty$. We prove that the distribution function of the roots,…

Combinatorics · Mathematics 2010-12-13 Miguel Rodriguez

Given a sequence of real rooted polynomials $\{p_n\}_{n\geq 1}$ with a fixed asymptotic root distribution, we study the asymptotic root distribution of the repeated polar derivatives of this sequence. This limiting distribution can be seen…

Probability · Mathematics 2025-08-27 Daniel Perales , Zhiyuan Yang

We investigate the number of real zeros of a univariate $k$-sparse polynomial $f$ over the reals, when the coefficients of $f$ come from independent standard normal distributions. Recently B\"urgisser, Erg\"ur and Tonelli-Cueto showed that…

Probability · Mathematics 2019-11-07 Gorav Jindal , Anurag Pandey , Himanshu Shukla , Charilaos Zisopoulos

We study the asymptotic behaviour of the probability that a weighted sum of centered i.i.d. random variables X_k does not exceed a constant barrier. For regular random walks, the results follow easily from classical fluctuation theory,…

Probability · Mathematics 2011-05-24 Frank Aurzada , Christoph Baumgarten

We start with a random polynomial $P^{N}(z)$ of degree $N$ with independent coefficients. We then consider a new polynomial $P_{t}^{N}$ obtained by $\lceil Nt\rceil$ applications of a fractional differential operator of the form $z^{a}…

Probability · Mathematics 2026-05-05 Brian C. Hall , Ching-Wei Ho , Jonas Jalowy , Zakhar Kabluchko

The Kac polynomial $$f_n(x) = \sum_{i=0}^{n} \xi_i x^i$$ with independent coefficients of variance 1 is one of the most studied models of random polynomials. It is well-known that the empirical measure of the roots converges to the uniform…

Probability · Mathematics 2023-08-23 Hoi H. Nguyen , Oanh Nguyen

Symmetric matrices with zero row sums occur in many theoretical settings and in real-life applications. When the offdiagonal elements of such matrices are i.i.d. random variables and the matrices are large, the eigenvalue distributions…

Disordered Systems and Neural Networks · Physics 2023-06-27 Pawat Akara-pipattana , Oleg Evnin

We propose an efficient algorithm to compute the real roots of a sparse polynomial $f\in\mathbb{R}[x]$ having $k$ non-zero real-valued coefficients. It is assumed that arbitrarily good approximations of the non-zero coefficients are given…

Symbolic Computation · Computer Science 2017-04-25 Gorav Jindal , Michael Sagraloff