Paperlane

no. 14 · Friday 13 November 2026

$2$-Large Sets and Nil-Bohr Recurrence: A Disproof of the $2$-Large Is Large Conjecture

Ryan Alweiss and Sohail Farhangi

math.CO · v4 · 20 pp

Abstract

A set $S$ of positive integers is $r$-large if every $r$-coloring of $\mathbb{N}$ contains arbitrarily long monochromatic arithmetic progressions with common difference in $S$. We prove that every $2$-large set is a set of nil-Bohr recurrence, i.e., it meets every nil-Bohr neighborhood of $0$. This proves a conjecture of the first author and gives a sharp answer to a question of Host, Kra, and Maass. Furthermore, we show that a piecewise syndetic set is $2$-large if and only if it is nil-Bohr recurrent. From this, we show that a small modification of a set constructed by the first author is $2$-large but not $3$-large, thereby disproving the $2$-large is large conjecture of Brown, Graham, and Landman. We also deduce that the family of $2$-large sets is not partition regular, thereby answering another question of Brown, Graham, and Landman. We also show that, for every fixed nil-Bohr neighborhood $B$ of $0$ and every $\varepsilon>0$, restricting the common difference to $B$ increases the extremal number for $k$-term arithmetic progressions by at most a factor of $1+\varepsilon$, provided $k$ is sufficiently large.

comments
20 pages, 1 figure, big update to include resolution of 2-large versus large. v4 has small changes in formatting and presentation
fields
Combinatorics, Dynamical Systems, Number Theory
pdf ↗ page arXiv:2610.16605 ↗