On some power sum problems of Montgomery and Turan
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|zk| => 1 maxv=1,...,nh |sumk=1n zkv| <= (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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.