Cyclotomic polynomials with many primes dividing their orders (Q2567417)

Let \[ \Phi_n(z)=\prod_{a=1, (a,n)=1}^n(z-e^{2\pi ia/n}) =\sum_{m=0}^{\varphi(n)} a(m,n)z^m, \] the \(n\)th cyclotomic polynomial. There has been much interest in the coefficients \(a(m,n)\), and particularly the size of \(A(n)=\max_m| a(m,n)| \). Recently the second author [Acta Arith. 64, 227--235 (1993; Zbl 0781.11012)] has established that if \(\varepsilon(n)\to0\) and \(\psi(n)\to\infty\) as \(n\to\infty\) then \(n^{\varepsilon(n)}\leq A(n)\leq n^{\psi(n)}\) for almost all~\(n\). The number \(\omega(n)\) of prime divisors of~\(n\) is known to have normal order \(\log\log n\), so that the set \({\mathcal E}(C)=\{n:\omega(n)\geq C\log\log n\}\) may be considered to be exceptional when \(C>2/\log2\). The same author [Period. Math. Hung. 43, 155--164 (2001; Zbl 1062.11061)] then showed that, for \(D<(C\log2)/2\) and almost all \(n\in {\mathcal E}(C)\), one has \(\log A(n)\geq(\log n)^D\). In the present paper the authors now show that this estimate is valid for all \(n\in{\mathcal E}(C)\) with \(n\geq n_0(D)\). From the trivial estimate \(| \Phi_n(z)| \leq nA(n)\) the problem is reduced to finding a lower estimate for \(S(n)=\sup_{| z| =1}\log| \Phi_n(z)| \), and the authors prove that if \(B<(\log2)/2\) then \(\log S(n)\geq B\omega(n)\) when \(\omega(n)\geq k_0(B)\). Such an estimate is derived from their theorem which states that \[ \int_0^1(\log| \Phi_n(e^{2\pi i\alpha})| )^3\,d\alpha\ll1\cdot89^{\omega(n)}\qquad\text{as} \quad\omega(n)\to\infty. \]