No label defined (Q4750706)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3807690
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3807690 |
Statements
1982
0 references
size of coefficients
0 references
cyclotomic polynomial
0 references
0.8987510800361633
0 references
0.8647426962852478
0 references
0.8600409626960754
0 references
Write the \(n\)-th cyclotomic polynomial as \(\prod (1 - \rho z) = \sum a(m,n)z^n\), the product being over all primitive \(n\)-th roots, \(\rho\), of unity. Define \(A(n) = \max \vert a(m,n)\vert\). The author gives a previously unpublished proof, due to B. Saffari, of a result of \textit{R. C. Vaughan} in [Mich. Math. J. 21, 289--295 (1975; Zbl 0304.10008)] which is a sharpening of the assertion that \[ \log \log A(n) > \log 2 \log n/\log \log n \quad\text{for infinitely many }n. \] Other results of the paper are taken from a forthcoming article of the author with \textit{R. C. Vaughan} and \textit{C. Pomerance} in [Topics in classical number theory, Colloq. Budapest 1981, Vol. I, Colloq. Math. Soc. János Bolyai 34, 171--202 (1984; Zbl 0547.10010)]. For example, it is shown that \[ A(n)\le n^{f(k)} : f(k)= (2^{k-1}/k) - 1 \] for all \(n\) having exactly \(k\) distinct odd prime factors. They conjecture that this is best possible in the sense that \(A(n)\ge c_kn^{f(k)}\) for infinitely many such \(n\), but what they prove in this direction is somewhat weaker. For the entire collection see [Zbl 0545.00014].
0 references