Difference Sets and Polynomials

Publication date 19 April 2015

Abstract: We provide upper bounds on the largest subsets of

1, 2, d o t s, N

with no differences of the form

h_{1} (n_{1}) + c d o t s + h_{e l l} (n_{e l l})

with

n_{i} i n m a t h b b N

or

h_{1} (p_{1}) + c d o t s + h_{e l l} (p_{e l l})

with

p_{i}

prime, where

h_{i} i n m a t h b b Z [x]

lie in in the classes of so-called intersective and

m a t h c a l P

-intersective polynomials, respectively. For example, we show that a subset of

1, 2, d o t s, N

free of nonzero differences of the form

n^{j} + m^{k}

for fixed

j, k i n m a t h b b N

has density at most

e^{- (l o g N)^{m u}}

for some

m u = m u (j, k) > 0

. Our results, obtained by adapting two Fourier analytic, circle method-driven strategies, either recover or improve upon all previous results for a single polynomial. UPDATE: While the results and proofs in this preprint are correct, the main result (Theorem 1.1) has been superseded prior to publication by a new paper ( https://arxiv.org/abs/1612.01760 ) that provides better results with considerably less technicality, to which the interested reader should refer.

This page was built for publication: Difference Sets and Polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6261020)