We consider the behavior of zeros of random polynomials of the from \begin{equation*} P_{n, m}(z) := \eta_0\varphi_m^{(m)}(z) + \eta_1 \varphi_{m+1}^{(m)}(z) + \cdots + \eta_n \varphi_{n+m}^{(m)}(z) \end{equation*} as \(n\to\infty \), where \(m \) is a non-negative integer (most of the work deal with the case \(m =0 \)), \(\{\eta_n\}_{n=0}^\infty \) is a sequence of i.i.d. Gaussian random variables, and \(\{\varphi_n(z)\}_{n=0}^\infty \) is a sequence of orthonormal polynomials on the unit circle \(\mathbb T \) for some Borel measure \(\mu \) on \(\mathbb T \) with infinitely many points in its support. Most of the work is done by manipulating the density function for the expected number of zeros of a random polynomial, which we call the intensity function.

Topics in Random Polynomials presents a rigorous and comprehensive treatment of the mathematical behavior of different types of random polynomials. These polynomials-the subject of extensive recent research-have many applications in physics, economics, and statistics. The main results are presented in such a fashion that they can be understood and used by readers whose knowledge of probability incorporates little more than basic probability theory and stochastic processes.

Probability and Mathematical Statistics: A Series of Monographs and Textbooks: Random Polynomials focuses on a comprehensive treatment of random algebraic, orthogonal, and trigonometric polynomials. The publication first offers information on the basic definitions and properties of random algebraic polynomials and random matrices. Discussions focus on Newton's formula for random algebraic polynomials, random characteristic polynomials, measurability of the zeros of a random algebraic polynomial, and random power series and random algebraic polynomials. The text then elaborates on the number and expected number of real zeros of random algebraic polynomials; number and expected number of real zeros of other random polynomials; and variance of the number of real zeros of random algebraic polynomials. Topics include the expected number of real zeros of random orthogonal polynomials and the number and expected number of real zeros of trigonometric polynomials. The book takes a look at convergence and limit theorems for random polynomials and distribution of the zeros of random algebraic polynomials, including limit theorems for random algebraic polynomials and random companion matrices and distribution of the zeros of random algebraic polynomials. The publication is a dependable reference for probabilists, statisticians, physicists, engineers, and economists.

An introduction to computational complexity theory, its connections and interactions with mathematics, and its central role in the natural and social sciences, technology, and philosophy Mathematics and Computation provides a broad, conceptual overview of computational complexity theory—the mathematical study of efficient computation. With important practical applications to computer science and industry, computational complexity theory has evolved into a highly interdisciplinary field, with strong links to most mathematical areas and to a growing number of scientific endeavors. Avi Wigderson takes a sweeping survey of complexity theory, emphasizing the field’s insights and challenges. He explains the ideas and motivations leading to key models, notions, and results. In particular, he looks at algorithms and complexity, computations and proofs, randomness and interaction, quantum and arithmetic computation, and cryptography and learning, all as parts of a cohesive whole with numerous cross-influences. Wigderson illustrates the immense breadth of the field, its beauty and richness, and its diverse and growing interactions with other areas of mathematics. He ends with a comprehensive look at the theory of computation, its methodology and aspirations, and the unique and fundamental ways in which it has shaped and will further shape science, technology, and society. For further reading, an extensive bibliography is provided for all topics covered. Mathematics and Computation is useful for undergraduate and graduate students in mathematics, computer science, and related fields, as well as researchers and teachers in these fields. Many parts require little background, and serve as an invitation to newcomers seeking an introduction to the theory of computation. Comprehensive coverage of computational complexity theory, and beyond High-level, intuitive exposition, which brings conceptual clarity to this central and dynamic scientific discipline Historical accounts of the evolution and motivations of central concepts and models A broad view of the theory of computation's influence on science, technology, and society Extensive bibliography