Papers
Topics
Authors
Recent
Search
2000 character limit reached

On solution-free sets for simultaneous diagonal polynomials

Published 8 Oct 2010 in math.NT | (1010.1575v1)

Abstract: We consider a translation and dilation invariant system consisting of k diagonal equations of degrees 1,2,...,k with integer coefficients in s variables, where s is sufficiently large in terms of k. We show via the Hardy-Littlewood circle method that if a subset A of the natural numbers restricted to the interval [1,N] satisfies Gowers' definition of uniformity of degree k, then it furnishes roughly the expected number of simultaneous solutions to the given equations. If A furnishes no non-trivial solutions to the given system, then we show that the number of elements of A in [1,N] grows no faster than a constant multiple of N/(log log N){-c} as N grows to infinity, where c>0 is a constant dependent only on k. In particular, we show that the density of A in [1,N] tends to 0 as N tends to infinity.

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.

Authors (1)

Collections

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