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/π + o(1)) logn expected real zeros in terms of the degree n. On the other hand, if the basis is given by Legendre (or more generally by Jacobi) polynomials, then random linear combinations...

Abstract. 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 order of 2 π logn, as n → ∞. Several years later, Sambandham considered two cases with some dependence assumed among the coefficients. The first case ...

The expected number of real zeros of an algebraic polynomial ao a1x a2x · · · anx with random coefficient aj , j 0, 1, 2, . . . , n is known. The distribution of the coefficients is often assumed to be identical albeit allowed to have different classes of distributions. For the nonidentical case, there has been much interest where the variance of the jth coefficient is var aj ( n j ) . It is sh...

Characteristic polynomials of unitary matrices are extremely useful models for the Riemann zeta-function ζ(s). The distribution of their eigenvalues give insight into the distribution of zeros of the Riemann zeta-function and the values of these characteristic polynomials give a model for the value distribution of ζ(s). See the works [KS] and [CFKRS] for detailed descriptions of how these model...