论文信息 - Arithmetic Progressions in Sets with Small Sumsets

Arithmetic Progressions in Sets with Small Sumsets

We present an elementary proof that if $A$ is a finite set of numbers, and the sumset $A+_GA$ is small, $|A+_GA|\leq c|A|$, along a dense graph $G$, then $A$ contains $k$-term arithmetic progressions.

József Solymosi | J. Solymosi

[1] Vojtech Rödl,et al. Regularity Lemma for k‐uniform hypergraphs , 2004, Random Struct. Algorithms.

[2] V. Rödl,et al. Extremal problems on set systems , 2002 .

[3] K. F. Roth. On Certain Sets of Integers , 1953 .

[4] Noga Alon,et al. An Application of Graph Theory to Additive Number Theory , 1985, Eur. J. Comb..

[5] W. T. Gowers,et al. Hypergraph regularity and the multidimensional Szemerédi theorem , 2007, 0710.3032.

[6] Endre Szemerédi,et al. A statistical theorem of set addition , 1994, Comb..

[7] G. Freiman. Foundations of a Structural Theory of Set Addition , 2007 .

[8] Melvyn B. Nathanson,et al. Additive Number Theory: Inverse Problems and the Geometry of Sumsets , 1996 .

[9] E. Szemerédi. On sets of integers containing k elements in arithmetic progression , 1975 .

[10] V. Rödl,et al. The counting lemma for regular k-uniform hypergraphs , 2006 .

[11] József Solymosi,et al. A Note on a Question of Erdős and Graham , 2004, Combinatorics, Probability and Computing.