On a sumset conjecture of Erd\H{o}s

Erd\H{o}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\subseteq A$. We verify Erd\H{o}s' conjecture in the case that $A$ has Banach density exceeding $\frac{1}{2}$. As a consequence, we prove that, for $A\subseteq \mathbb{N}$ with positive Banach density (a much weaker assumption than positive lower density), we can find infinite $B,C\subseteq \mathbb{N}$ such that $B+C$ is contained in the union of $A$ and a translate of $A$. Both of the aforementioned results are generalized to arbitrary countable amenable groups. We also provide a positive solution to Erd\H{o}s' conjecture for subsets of the natural numbers that are pseudorandom.Comment: 17 pages; new version has a slightly different title, some minor typos are fixed, and the exposition of Lemma 4.6 has been improved. To appear in the Canadian Journal of Mathematic

Problems on infinite sumset configurations in the integers and beyond

In contrast to finite arithmetic configurations, relatively little is known about which infinite patterns can be found in every set of natural numbers with positive density. Building on recent advances showing infinite sumsets can be found, we explore numerous open problems and obstructions to finding other infinite configurations in every set of natural numbers with positive density.Comment: 37 page

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

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\H{o}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.Comment: 54 pages. Corrected proof of Theorem 3.22 and added Example 3.27 Keywords: sum sets, almost periodic functions, ultrafilter

Nonstandard Methods in Ramsey Theory and Combinatorial Number Theory

The goal of this present manuscript is to introduce the reader to the nonstandard method and to provide an overview of its most prominent applications in Ramsey theory and combinatorial number theory.Comment: 126 pages. Comments welcom