Related papers: Roots of random trigonometric polynomials with gen…

This paper seeks to further explore the distribution of the real roots of random polynomials with non-centered coefficients. We focus on polynomials where the typical values of the coefficients have power growth and count the average number…

Mark Kac gave one of the first results analyzing random polynomial zeros. He considered the case of independent standard normal coefficients and was able to show that the expected number of real zeros for a degree n polynomial is on the…

In this work, we study asymptotic zero distribution of random multi-variable polynomials which are random linear combinations $\sum_{j}a_jP_j(z)$ with i.i.d coefficients relative to a basis of orthonormal polynomials $\{P_j\}_j$ induced by…

The purpose of this note is to study asymptotic zero distribution of multivariate random polynomials as their degrees grow. For a smooth weight function with super logarithmic growth at infinity, we consider random linear combinations of…

We consider asymptotics of ratios of random characteristic polynomials associated with orthogonal polynomial ensembles. Under some natural conditions on the measure in the definition of the orthogonal polynomial ensemble we establish a…

The expected number of real zeros of an algebraic polynomial $a_0+a_1x+a_2x^2+a_3x^3+....+a_{n-1}x^{n-1}$ depends on the types of random coefficients, with large $n.$ In this article, we show that when the random coefficients…

In this article we study asymptotic behavior of the probability that a random monic polynomial with integer coefficients is irreducible over the integers. We consider the cases where the coefficients grow together with the degree of the…

We review some recent results on random polynomials and their generalizations in complex and symplectic geometry. The main theme is the universality of statistics of zeros and critical points of (generalized) polynomials of degree $N$ on…

Using the formalism of polynomials with positive coefficients, the fact that exactly half of all subsets of a finite set have even cardinality can be generalized asymptotically.

We study global distribution of zeros for a wide range of ensembles of random polynomials. Two main directions are related to almost sure limits of the zero counting measures, and to quantitative results on the expected number of zeros in…

Let $\mu$ be a probability measure on $\mathbb C$, and let $P_n$ be the random polynomial whose zeros are sampled independently from $\mu$. We study the asymptotic distribution of zeros of high-order derivatives of $P_n$. We show that, for…

We consider random orthonormal polynomials $$ F_{n}(x)=\sum_{i=0}^{n}\xi_{i}p_{i}(x), $$ where $\xi_{0}$, \dots, $\xi_{n}$ are independent random variables with zero mean, unit variance and uniformly bounded $(2+\ep)$ moments, and…

We investigate the mean number of real zeros over an interval $[a,b]$ of a random trigonometric polynomial of the form $\sum_{k=1}^n a_k \cos(kt)+b_k \sin(kt)$ where the coefficients are i.i.d. random variables. Under mild assumptions on…

On a probability space $(\Omega, \mathcal F, \mathbb P)$ we consider two independent sequences $(a_k)_{k \geq 1}$ and $(b_k)_{k \geq 1}$ of i.i.d. random variables that are centered with unit variance and which admit a moment strictly…

We show that the zeros of random sequences of Gaussian systems of polynomials of increasing degree almost surely converge to the expected limit distribution under very general hypotheses. In particular, the normalized distribution of zeros…

We investigate average gradient degree of normal random polynomials of fixed algebraic degree n. In particular, for polynomials of two variables, asymptotics of the average gradient degree for large values of n is determined.

We consider the zeros of the sum of independent random polynomials as their degrees tend to infinity. Namely, let $p$ and $q$ be two independent random polynomials of degree $n$, whose roots are chosen independently from the probability…

We study the zero sets of the independence polynomial on recursive sequences of graphs. We prove that for a maximally independent starting graph and a stable and expanding recursion algorithm, the zeros of the independence polynomial are…

Hayes equivalence is defined on monic polynomials over a finite field $\fq$ in terms of the prescribed leading coefficients and the residue classes modulo a given monic polynomial $Q$. We study the distribution of the number of zeros in a…

The roots of a complex polynomial depend continuously on the coefficients; that is, an infinitesimal perturbation of the coefficients results in an infinitesimal perturbation of the roots. A short, straightforward proof of this is possible…