Related papers: The real tau-conjecture is true on average
According to the real \tau-conjecture, the number of real roots of a sum of products of sparse polynomials should be polynomially bounded in the size of such an expression. It is known that this conjecture implies a superpolynomial lower…
One can associate to any bivariate polynomial P(X,Y) its Newton polygon. This is the convex hull of the points (i,j) such that the monomial X^i Y^j appears in P with a nonzero coefficient. We conjecture that when P is expressed as a sum of…
Consider a random system $\mathfrak{f}_1(x)=0,\ldots,\mathfrak{f}_n(x)=0$ of $n$ random real polynomials in $n$ variables, where each $\mathfrak{f}_k$ has a prescribed set of exponent vectors in a set $A_k\subseteq \mathbb{Z}^n$ of size…
Polynomial identity testing and arithmetic circuit lower bounds are two central questions in algebraic complexity theory. It is an intriguing fact that these questions are actually related. One of the authors of the present paper has…
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…
We show that with high probability the number of real zeroes of a random polynomial is bounded by the number of vertices on its Newton-Hadamard polygon times the cube of the logarithm of the polynomial degree. A similar estimate holds for…
We provide an elementary geometric derivation of the Kac integral formula for the expected number of real zeros of a random polynomial with independent standard normally distributed coefficients. We show that the expected number of real…
Consider a system $f_1(x)=0,\ldots,f_n(x)=0$ of $n$ random real polynomials in $n$ variables, where each $f_i$ has a prescribed set of terms described by a set $A\subseteq \mathbb{N}^n$ of cardinality $t$. Assuming that the coefficients of…
We study the expected number of real zeros for random linear combinations of orthogonal polynomials. It is well known that Kac polynomials, spanned by monomials with i.i.d. Gaussian coefficients, have only $(2/\pi + o(1))\log{n}$ expected…
We study the expected number of real zeros for random linear combinations of orthogonal polynomials. It is well known that Kac polynomials, spanned by monomials with i.i.d. Gaussian coefficients, have only $(2/\pi + o(1))\log{n}$ expected…
The large degree asymptotics of the expected number of real zeros of a random trigonometric polynomial $$ T_n(x) = \sum_ {j=0} ^{n} a_j \cos (j x) + b_j \sin (j x), \ x \in (0,2\pi), $$ with i.i.d. real-valued standard Gaussian coefficients…
The probability that a zero of a random real polynomial of increasing degree is real tends to zero. However, passing from polynomials to Laurent polynomials yields a surprising result: the probability that a root is real tends not to zero,…
We study the expected number of real zeros for random linear combinations of orthogonal polynomials. It is well known that Kac polynomials, spanned by monomials with i.i.d. Gaussian coefficients, have only $(2/\pi + o(1))\log{n}$ expected…
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$…
It is well known that the expected number of real zeros of a random cosine polynomial $ V_n(x) = \sum_ {j=0} ^{n} a_j \cos (j x) , \ x \in (0,2\pi) $, with the $ a_j $ being standard Gaussian i.i.d. random variables is asymptotically $ 2n /…
The Shub-Smale Tau Conjecture is a hypothesis relating the number of integral roots of a polynomial f in one variable and the Straight-Line Program (SLP) complexity of f. A consequence of the truth of this conjecture is that, for the…
We show that if a real trigonometric polynomial has few real roots, then the trigonometric polynomial obtained by writing the coefficients in reverse order must have many real roots. This is used to show that a class of random trigonometric…
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…
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…
Consider a monic polynomial of degree $n$ whose subleading coefficients are independent, identically distributed, nondegenerate random variables having zero mean, unit variance, and finite moments of all orders, and let $m \geq 0$ be a…