On some power sum problems of Montgomery and Turan

@article{Andersson2007OnSP,
  title={On some power sum problems of Montgomery and Turan},
  author={John Andersson},
  journal={arXiv: Number Theory},
  year={2007}
}
  • J. Andersson
  • Published 28 June 2007
  • Mathematics, Computer Science
  • arXiv: Number Theory
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. 
View PDF on arXiv
3 Citations
Background Citations
3

3 Citations

Turan's problem 10 revisited
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…
Chui’s conjecture in Bergman spaces
We solve an analog of Chui’s conjecture on the simplest fractions (i.e., sums of Cauchy kernels with unit coefficients) in weighted (Hilbert) Bergman spaces. Namely, for a wide class of weights, we…
Explicit constructions of RIP matrices and related problems
TLDR
A new explicit construction of n×N matrices satisfying the Restricted Isometry Property is given, which overcomes the natural barrier k = O(n1/2) for proofs based on small coherence, which is used in all previous explicit constructions of RIP matrices.

References

SHOWING 1-10 OF 19 REFERENCES
Turan's problem 10 revisited
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…
Lower bounds in some power sum problems
TLDR
New lower bounds in the case of unimodular complex numbers z_k and m cn^2 for constants c>1 are given by using features of Fejer kernels.
Explicit solutions to certain inf max problems from Turán power sum theory
The Difference Between Consecutive Primes, II
The authors sharpen a result of Baker and Harman (1995), showing that [x, x + x0.525] contains prime numbers for large x. An important step in the proof is the application of a theorem of Watt (1995)…
Ten lectures on the interface between analytic number theory and harmonic analysis
Uniform distribution van der Corput sets Exponential sums I: The methods of Weyl and van der Corput Exponential sums II: Vinogradov's method An introduction to Turan's method Irregularities of…
An Affine Analogue of Singer's Theorem
James Singer by using the Finite Projective Geometry PG(2,p n ), proved the following theorem of the 'theory of numbers': Given an integer m≥2 of the form p n (p being a prime) we can find m+I…
Diameters and eigenvalues
We derive a new upper bound for the diameter of a k-regular graph G as a function of the eigenvalues of the adjacency matrix. Namely, suppose the adjacency matrix of G has eigenvalues AI, A2,)A,,…
Theorems in the additive theory of numbers
SummaryThis paper extends some earlier results on difference sets andB2 sequences bySinger, Bose, Erdös andTuran, andChowla.
An estimate for character sums
It turns out to be easier to consider the following more general situation. F is a finite field, n ~ 1 is an integer, and B is a finite etale F -algebra of dimension n over F (i,e., over a finite…
On a certain limitation of eigenvalues of matrices
...
...