Let $P(z) = \prod\_{i = 1}^n (z - z\_i) \in \mathbb{C}[z]$ be a monic polynomial having all roots $z\_1, \dots, z\_n$ on the unit circle $\mathbb{T} := \{z \in \mathbb{C} : |z| = 1\}$.


What is known about upper bounds for
$$M(P) :=\max\_{|z| = 1} |P(z)|$$
in terms of the distribution of $z\_1, \dots, z\_n$ in $\mathbb{T}$ ?


On the one hand, if $z\_1, \dots, z\_n$ are equally spaced on $\mathbb{T}$ then we have that $|P(z)| = |z^n - 1|$ and so $M(P) \leq 2$. In other words, $M(P)$ is small.


On the other hand, if $z\_1, \dots, z\_n$ all belong to one half of $\mathbb{T}$, say $\Im(z) < 0$, then it follows easily that $M(P) \geq P(1) \geq (\sqrt{2})^n$, and so $M(P)$ is large.


My guess is that knowing that $z\_1, \dots, z\_n$ are "well distributed", in some precise quantitative way, would provide a nontrivial upper bound for $M(P)$.


I searched in the literature but I could not find anything like that. Thanks for any suggestion.


*Note.* [This](https://mathoverflow.net/questions/63525/polynomials-on-the-unit-circle) is a somehow similar question but regarding a lower bound for $M(P)$ and for "random" $P$.



Upper bound for maximum modulus of polynomial on unit circle in term of the distribution of its roots
Let me first start with the other side: does the maximum being small guarantee that the roots are equidistributed? This is indeed the case, and is a beautiful theorem of Erdos and Turan. For a recent exposition see [Equidistribution of zeros of polynomials](https://arxiv.org/abs/1802.06506) (published paper in the Amer. Math. Monthly). This shows that
$$ 
{\mathcal D}(P) \le C \sqrt{N \log M(P)}, 
$$
with $C= 8/\pi$, and ${\mathcal D}(P)$ denotes the discrepancy of the angles of the roots. That is, ${\mathcal D}(P)$ is the maximum over all intervals $(\alpha, \beta)$ of $(0, 2\pi]$ of the absolute value of the difference between $N(\beta-\alpha)/(2\pi)$ and the number of roots with argument between $\alpha$ and $\beta$. In fact the result is a bit more precise, and recently there's been progress in improving the constant $C$ by [Shu and Wang](https://arxiv.org/pdf/2109.11006.pdf) (see also [Carneiro et al](https://arxiv.org/abs/2104.00105)).


Your question is about the other direction: to bound $M(P)$ in terms of the discrepancy ${\mathcal D}(P)$. This can also be done, using a result of [Carneiro and Vaaler](https://www.ams.org/journals/tran/2010-362-11/S0002-9947-2010-04886-X/S0002-9947-2010-04886-X.pdf) for example. Their Theorem 8.1 (with small changes of notation) shows that for any $1\le K\le N$
$$ 
\log M(P) \le \frac{N\log 2}{K+1} + \sum\_{k=1}^{K} \frac 1k \Big| \sum\_{j=1}^{N} z\_j^k\Big|. 
$$
If the roots are equidistributed then the power sums $\sum\_{j=1}^{N} z\_j^k$ are small, and the desired bound would follow. In fact, with ${\mathcal D}(P)$ being the discrepancy, partial summation shows that
$$ 
\Big| \sum\_{j=1}^{N} z\_j^k \Big| \le 2\pi k {\mathcal D}(P), 
$$
so that from Carneiro--Vaaler we would get
$$ 
\log M(P) \le \frac{N\log 2}{K+1} + 2\pi K {\mathcal D}(P). 
$$
Choosing $K$ to minimize this, we obtain the complementary bound
$$
\log M(P) \le C \sqrt{N {\mathcal D}(P)}, 
$$
for a suitable constant $C$.


