The Graham conjecture implies the Erdos-Turan conjecture

Abstract: Erd"{o}s and Tur'{a}n once conjectured that any set

A s u b s e t m a t h b b N

with

s u m_{a i n A} 1 / a = i n f t y

should contain infinitely many progressions of arbitrary length

k g e q 3

. For the two-dimensional case Graham conjectured that if

B s u b s e t m a t h b b N i m e s m a t h b b N

satisfies

sumlimits_{(x,y)in B}frac{1}{x^2+y^2}=infty,

then for any

s g e q 2

,

B

contains an

s i m e s s

axes-parallel grid. In this paper it is shown that if the Graham conjecture is true for some

s g e q 2

, then the Erd"{o}s-Tur'{a}n conjecture is true for

k = 2 s - 1

.

This page was built for publication: The Graham conjecture implies the Erdos-Turan conjecture