Papers
Topics
Authors
Recent
Search
2000 character limit reached

On van der Corput property of squares

Published 19 Mar 2010 in math.NT | (1003.3780v1)

Abstract: We prove that the upper bound for the van der Corput property of the set of perfect squares is O((log n){-1/3}), giving an answer to a problem considered by Ruzsa and Montgomery. We do it by constructing non-negative valued, normed trigonometric polynomials with spectrum in the set of perfect squares not exceeding n, and a small free coefficient a_0=O((log n){-1/3}).

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.