On the Distribution of Roots of Polynomials

@article{Erds1950OnTD,
  title={On the Distribution of Roots of Polynomials},
  author={Paul Erd{\"o}s and Paul Tur{\'a}n},
  journal={Annals of Mathematics},
  year={1950},
  volume={51},
  pages={105}
}
1. We start by explaining two groups of theorems and we shall derive both from a common source. P. Bloch and G. P6lya' investigated first the question of giving an upper estimation of the number R of real roots of (1.1) f(z) = UIJ + Olc?T +. They proved that the number of real roots is* <-41G, $1 n log log n log n * A few years later Erhardt Schmidt3 proved the sharper inequality and the still sharper one RZ 6 A& /.~'>n log F (1.2) 
The Polynomials of Mahler and Roots of Unity
TLDR
It is shown that the derivatives of the polynomials of Mahler have all their zeros inside the unit circle.
On roots of random polynomials
We study the distribution of the complex roots of random polynomials of degree n with i.i.d. coefficients. Using techniques related to Rice’s treatment of the real roots question, we derive, under
On the Distribution of Roots of Random Polynomials
In the study of algebraic and numerical properties of polynomials one occasionally introduces the notion of a random polynomial. For example, this chapter was originally motivated by investigations,
ON THE DISTRIBUTION OF ZEROS OF POLYNOMIALS
We prove a subtle “one-sided” improvement of a classical result of P. Erdős and P. Turán on the distribution of zeros of polynomials. The proof of this improvement is quite short and rather
Means of algebraic numbers in the unit disk
On the distribution of roots of polynomials in sectors. I
where an, ao E C*. P. Bloch and G. P61ya, E. Schmidt, and, finally, I. Schur [13] estimated the number of real roots of P in terms of its length L(P) , degree n, and the absolute value of the product
SOME PROPERTIES OF THE FEJAR POLYNOMIALS
were introduced, by way of their real and imaginary parts on the unit circle C, by Feje'r [6; 7]. Fejer showed that the number 2+7w is an upper bound for the modulus both of the real and of the
Coppersmith–Rivlin type inequalities and the order of vanishing of polynomials at 1
for every n ≥ 2, where Fn denotes the set of all polynomials of degree at most n with coefficients from {−1, 0, 1}. Littlewood considered minimization problems of this variety on the unit disk. His
...
...