Problems on infinite sumset configurations in the integers and beyond
Bryna Kra, Joel Moreira, Florian K. Richter, Donald Robertson
TL;DR
This survey investigates which infinite sumset configurations are guaranteed in sets of positive density and extends the inquiry to primes, random sets, and general amenable groups. It develops density analogs of Hindman-type results, refines sumset patterns (including $B+C$, $B_1+\cdots+B_k$, and ordered variants), and employs ergodic theory, uniformity norms, Følner sequences, and ultrafilters to map the landscape of possibilities and obstructions. Key contributions include the density-Hindman results of KMRR and related refinements (e.g., constraints on summands, density Ramsey properties, and recurrence-based constructions), along with a suite of obstacles such as Straus-type counterexamples and higher-order obstructions. The work also surveys breakthroughs in the primes (Green–Tao, Maynard–Zhang–Tao–Ziegler) and random-model contexts, and it outlines numerous open problems and conjectures that guide future research in infinitary density combinatorics and its extensions to general groups and ultrafilter frameworks.
Abstract
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.
