English

$2$-large sets are sets of Bohr recurrence

Combinatorics 2025-12-25 v3 Dynamical Systems Number Theory

Abstract

Let α1,,αd\alpha_1, \cdots, \alpha_d be real numbers, and let SS be the set of integers ss so that αisR/Z>δ||\alpha_i s||_{\mathbb{R}/\mathbb{Z}}>\delta for some ii and some fixed δ>0\delta>0. We prove SS is not \enquote{22-large}, i.e. there is a 22-coloring of N\mathbb{N} that avoids arbitrarily long arithmetic progressions with common differences in SS.

Keywords

Cite

@article{arxiv.2512.01997,
  title  = {$2$-large sets are sets of Bohr recurrence},
  author = {Ryan Alweiss},
  journal= {arXiv preprint arXiv:2512.01997},
  year   = {2025}
}

Comments

6 pages, 1 figure, comments welcome!

R2 v1 2026-07-01T08:04:17.809Z