$2$-large sets are sets of Bohr recurrence
Combinatorics
2025-12-25 v3 Dynamical Systems
Number Theory
Abstract
Let be real numbers, and let be the set of integers so that for some and some fixed . We prove is not \enquote{-large}, i.e. there is a -coloring of that avoids arbitrarily long arithmetic progressions with common differences in .
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!