Turan's problem 10 revisited
| dc.creator | Andersson, Johan | |
| dc.date | 2006-09-11 | |
| dc.date | 2007-06-28 | |
| dc.date.accessioned | 2026-07-07T08:12:47Z | |
| dc.date.available | 2026-07-07T08:12:47Z | |
| dc.description | In this paper we prove that inf_{|z_k| => 1} max_{v=1,...,n^2} |sum_{k=1}^n z_k^v| = sqrt n+O(n^{0.2625+epsilon}). This improves on the bound O(sqrt (n log n)) of Erdos and Renyi. In the special case of $n+1$ being a prime we have previously proved the much sharper result that the quantity lies in the interval [sqrt(n),sqrt(n+1)] The method of proof combines a general lower bound (of Andersson), explicit arithmetical constructions (of Montgomery, Fabrykowski or Andersson), moments (probabilistic methods) and estimates for the difference of consecutive primes (of Baker, Harman and Pintz). We also prove some (conditional and unconditional) related results. | |
| dc.description | v1: 20 pages; v2: 22 pages. Misprints/minor errors fixed. Added some material and some references; v3: 21 pages. Minor errors fixed. Changed problem section and added reference to new paper where we solve some of the open problems of v2 | |
| dc.identifier | https://arxiv.org/abs/math/0609271 | |
| dc.identifier | http://arxiv.org/abs/math/0609271 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/132575 | |
| dc.subject | Number Theory | |
| dc.subject | 11N30 | |
| dc.title | Turan's problem 10 revisited | |
| dc.type | text |