Papers
Topics
Authors
Recent
Search
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$.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 2 tweets with 0 likes about this paper.