On the discretised ABC sum-product problem

Abstract: Let

, and let

A, B, C s u b s e t [0, 1]

be finite sets with

| A | = d e l t a^{- a l p h a}

,

, and

| C | = d e l t a^{- g a m m a}

for some small

d e l t a i n 2^{- m a t h b b N}

. It follows from the Szemer'edi-Trotter theorem that if

, then there exists

c i n C

with

| A + c B | g g | A |

. This paper studies the

d e l t a

-discretised version of the problem above, where every occurrence of

| c d o t |

(cardinality) is replaced by

| c d o t |_{d e l t a}

(

d e l t a

-covering number). Bourgain already solved the problem in the case

. Roughly speaking, he showed that if

g a m m a > 0

, and

B, C

satisfy suitable non-concentration conditions, then

| A + c B |_{d e l t a} g g | A |_{d e l t a}

for some

c i n C

. I extend Bourgain's theorem to the case

, under the assumption

. I conjecture that the sharp assumption would be

.

This page was built for publication: On the discretised $ABC$ sum-product problem