2000 character limit reached
$2$-large sets are sets of Bohr recurrence
Published 1 Dec 2025 in math.CO, math.DS, and math.NT | (2512.01997v1)
Abstract: Let $α1, \cdots, α_d$ be real numbers, and let $S$ be the set of integers $s$ so that $||α_i s||{\mathbb{R}/\mathbb{Z}}>δ$ for some $i$ and some fixed $δ>0$. We prove $S$ is not \enquote{$2$-large}, i.e. there is a $2$-coloring of $\mathbb{N}$ that avoids arbitrarily long arithmetic progressions with common differences in $S$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.