Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
120 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

Abundant configurations in sumsets with one dense summand (1011.4657v1)

Published 21 Nov 2010 in math.DS

Abstract: We analyze sumsets A+B = {a+b : a in A, b in B} where A,B are sets of integers, A is infinite, and B has positive upper Banach density. For each k, we show that A+B contains at least the expected density of k-term arithmetic progressions based on the density of B, in contrast with an example of Bergelson, Host, Kra, and Ruzsa. Furthermore, we show that A+B must contain finite configurations not necessarily found in arbitrary sets of positive density, in contrast with results of Frantzikinakis, Lesigne, and Wierdl on sets of k-recurrence.

Summary

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