On some power sum problems of Montgomery and Turan
classification
🧮 math.NT
keywords
montgomeryorderproblemssqrtturanboundcharactererdos-renyi
read the original abstract
We use an estimate for character sums over finite fields of Katz to solve open problems of Montgomery and Turan. Let h=>2 be an integer. We prove that inf_{|z_k| => 1} max_{v=1,...,n^h} |sum_{k=1}^n z_k^v| <= (h-1+o(1)) sqrt n. This gives the right order of magnitude for the quantity and improves on a bound of Erdos-Renyi by a factor of the order sqrt log n.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.