A proof of a sumset conjecture of Erd\H{o}s

  title={A proof of a sumset conjecture of Erd\H\{o\}s},
  author={Joel Moreira and Florian Karl Richter and D. Robertson},
  journal={arXiv: Combinatorics},
In this paper we show that every set $A \subset \mathbb{N}$ with positive density contains $B+C$ for some pair $B,C$ of infinite subsets of $\mathbb{N}$, settling a conjecture of Erdős. The proof features two different decompositions of an arbitrary bounded sequence into a structured component and a pseudo-random component. Our methods are quite general, allowing us to prove a version of this conjecture for countable amenable groups. 
Sumset Configurations in Sets of Positive Density
In this section, we discuss a conjecture of Erdős, which states that a set of natural numbers of positive lower density contains the sum of two infinite sets. We begin with the history of theExpand
A short proof of a conjecture of Erd\"os proved by Moreira, Richter and Robertson
We give a short proof of a sumset conjecture of Erdos, recently proved by Moreira, Richter and Robertson: every subset of the integers of positive density contains the sum of two infinite sets. TheExpand
The largest $(k,\ell )$-sum-free subsets
Let $\mathscr{M}_{(2,1)}(N)$ denotes the infimum of the size of the largest sum-free subset of any set of $N$ positive integers. An old conjecture in additive combinatorics asserts that there are aExpand
Notions of size in a semigroup: an update from a historical perspective
Previous papers have investigated relationships among several notions of largeness in a semigroup, some of which have their origins in topological dynamics, others with pure combinatorial roots, andExpand
Partial Word and Equality Problems and Banach densities
We investigate partial Equality and Word Problems for finitely generated groups. After introducing Upper Banach (UB) density on free groups, we prove that solvability of the Equality Problem onExpand
On Supra-SIM Sets of Natural Numbers
We introduce the class of supra-SIM sets of natural numbers. We prove that this class is partition regular and closed under finite-embeddability. We also prove some results on sumsets and SIM setsExpand
Stabilizers, Measures and IP-sets
The purpose of this simple note is to provide elementary model-theoretic proofs to some existing results on sumset phenomena and IP sets, motivated by Hrushovski's work on the stabilizer theorem.


On a Sumset Conjecture of Erdős
Abstract Erdős conjectured that for any set $A\,\subseteq \,\mathbb{N}$ with positive lower asymptotic density, there are infinite sets $B,\,C\,\subseteq \,\mathbb{N}$ such that $B\,+\,C\,\subseteqExpand
In 1936, P. Erdos and P. Turan conjectured that if a set A of positive integers satisfies the condition . . M ,. hm sup --> 0, n then A contains arbitrarily long arithmetic progressions. ThisExpand
A note on sums of primes
Under the assumption of the prime /c-tuplets conjecture we show that it is possible to construct an infinite sequence of integers, such that the average of any two is prime. Recently Pomerance,Expand
Sumsets Contained in Infinite Sets of Integers
  • M. Nathanson
  • Computer Science, Mathematics
  • J. Comb. Theory, Ser. A
  • 1980
Hindman proved that there exists an infinite set B such that all finite, nonempty sums of distinct elements of B all belong to one cell of the partition, and Erdos conjectured that there exist infinite sets B and C such that B + C ⊆ A. Expand
Ramsey Theoretic Consequences of Some New Results About Algebra in the Stone-Čech Compactification
Recently [4] we have obtained some new algebraic results about βN, the Stone-Cech compactification of the discrete set of positive integers and about βW , where W is the free semigroup over aExpand
Sumset phenomenon in countable amenable groups
Jin proved that whenever A and B are sets of positive upper density in Z, A + B is piecewise syndetic. Jin’s theorem was subsequently generalized by Jin and Keisler to a certain family of abelianExpand
Ultrafilters and combinatorial number theory
Our concern is with two areas of mathematics and a, possibly surprising, intimate connection between them. One is the branch of combinatorial number theory which deals with the ability, given aExpand
Definable sets containing productsets in expansions of groups
Abstract We consider the question of when sets definable in first-order expansions of groups contain the product of two infinite sets (we refer to this as the “productset property”). We first showExpand
On Density, Translates, and Pairwise Sums of Integers
  • N. Hindman
  • Computer Science, Mathematics
  • J. Comb. Theory, Ser. A
  • 1982
If a question of Erdos about pairwise sums has a counterexample, then it has countereXamples with maximal density arbitrarily close to 1, and several results about translates of sets with positive-maximal density and with positive asymptotic-upper density are derived. Expand
A Survey of Problems in Combinatorial Number Theory
Publisher Summary This chapter presents a survey of problems in combinatorial number theory. The chapter discusses problems connected with Van der Waerden's and Szemeredi's theorem. Thus the chapterExpand