Related papers: How many zeros of a random sparse polynomial are r…

We compute the variance asymptotics for the number of real zeros of trigonometric polynomials with random dependent Gaussian coefficients and show that under mild conditions, the asymptotic behavior is the same as in the independent…

In this paper, we quantify the rate of convergence between the distribution of number of zeros of random trigonometric polynomials (RTP) with i.i.d. centered random coefficients and the number of zeros of a stationary centered Gaussian…

We introduce a family of real random polynomials of degree n whose coefficients a_k are symmetric independent Gaussian variables with variance <a_k^2> = e^{-k^\alpha}, indexed by a real \alpha \geq 0. We compute exactly the mean number of…

We study the asymptotic distribution of zeros for the random polynomials $P_n(z) = \sum_{k=0}^n A_k B_k(z)$, where $\{A_k\}_{k=0}^{\infty}$ are non-trivial i.i.d. complex random variables. Polynomials $\{B_k\}_{k=0}^{\infty}$ are…

We explore two questions about pseudo-polynomials, which are functions $f:\mathbb N \to \mathbb Z$ such that $k$ divides $f(n+k) - f(n)$ for all $n,k$. First, for certain arbitrarily sparse sets $R$, we construct pseudo-polynomials $f$ with…

We study the repartition of the roots of a random p-adic polynomial in an algebraic closure of Qp.We prove that the mean number of roots generating a fixed finite extension K of Qp depends mostly on the discriminant of K, an extension…

Consider a polynomial of large degree n whose coefficients are independent, identically distributed, nondegenerate random variables having zero mean and finite moments of all orders. We show that such a polynomial has exactly k real zeros…

In this paper, we study the number of real roots of random trigonometric polynomials with iid coefficients. When the coefficients have zero mean, unit variance and some finite high moments, we show that the variance of the number of real…

The expected number of real projective roots of orthogonally invariant random homogeneous real polynomial systems is known to be equal to the square root of the B\'ezout number. A similar result is known for random multi-homogeneous…

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…

In this paper, we investigate the number of real zeros of random Weyl polynomials of degree \(n \to \infty\) with general coefficient distributions. Motivated by the results of arXiv:1409.4128 and arXiv:1402.4628 as well as arXiv:1711.03316…

We show that detecting real roots for honestly n-variate (n+2)-nomials (with integer exponents and coefficients) can be done in time polynomial in the sparse encoding for any fixed n. The best previous complexity bounds were exponential in…

In this note we study asymptotic isotopy of random real algebraic plane curves. More precisely, we obtain a Kac-Rice type formula that gives the expected number of two-sided components (i.e.\ ovals) of a random real algebraic plane curve…

In a recent paper (Cucker, Krick, Malajovich and Wschebor, A Numerical Algorithm for Zero Counting. I: Complexity and accuracy, J. Compl.,24:582-605, 2008) we analyzed a numerical algorithm for computing the number of real zeros of a…

Given a finite set of points $S\subset\mathbb{R}^d$, a $k$-set of $S$ is a subset $A \subset S$ of size $k$ which can be strictly separated from $S \setminus A $ by a hyperplane. Similarly, a $k$-facet of a point set $S$ in general position…

Let $\{f_j\}_{j=0}^n$ be a sequence of orthonormal polynomials where the orthogonality relation is satisfied on either the real line or on the unit circle. We study zero distribution of random linear combinations of the form…

We use a method based on the division algorithm to determine all the values of the real parameters $b$ and $c$ for which the hypergeometric polynomials $_2F_1(-n, b; c; z)$ have $n$ real, simple zeros. Furthermore, we use the…

We consider random trigonometric polynomials of the form \[ f_n(t):=\sum_{1\le k \le n} a_{k} \cos(kt) + b_{k} \sin(kt), \] whose entries $(a_{k})_{k\ge 1}$ and $(b_{k})_{k\ge 1}$ are given by two independent stationary Gaussian processes…

For a regular compact set $K$ in $C^m$ and a measure $\mu$ on $K$ satisfying the Bernstein-Markov inequality, we consider the ensemble $P_N$ of polynomials of degree $N$, endowed with the Gaussian probability measure induced by $L^2(\mu)$.…

We obtain the asymptotic variance, as the degree goes to infinity, of the normalized number of real roots of a square Kostlan-Shub-Smale random polynomial system of any size. Our main tools are the Kac-Rice formula for the second factorial…