30 citations · 34 across the 4 of their papers we have counts for
Showing math.NTShow all
2 papers · 1 filter
math.NT2007★ 1 cited
On some power sum problems of Montgomery and Turan
Johan Andersson
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,...…
math.NT2007★ 3 cited
Lower bounds in some power sum problems
Johan Andersson
We study the power sum problem max_{v=1,...,m} | sum_{k=1}^n z_k^v | and by using features of Fejer kernels we give new lower bounds in the case of unimodular complex numbers z_k a…