Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

On arithmetic progressions in A + B + C (1211.4917v2)

Published 21 Nov 2012 in math.NT and math.CO

Abstract: Our main result states that when A, B, C are subsets of Z/NZ of respective densities \alpha,\beta,\gamma, the sumset A + B + C contains an arithmetic progression of length at least e{c(\log N)c} for densities \alpha > (\log N){-2 + \epsilon} and \beta,\gamma > e{-c(\log N)c}, where c depends on \epsilon. Previous results of this type required one set to have density at least (\log N){-1 + o(1)}. Our argument relies on the method of Croot, Laba and Sisask to establish a similar estimate for the sumset A + B and on the recent advances on Roth's theorem by Sanders. We also obtain new estimates for the analogous problem in the primes studied by Cui, Li and Xue.

Summary

We haven't generated a summary for this paper yet.