2-large sets are sets of Bohr recurrence

Abstract

Let α1, ·s, αd be real numbers, and let S be the set of integers s so that ||αi s||R/Z>δ for some i and some fixed δ>0. We prove S is not 2-large, i.e. there is a 2-coloring of N that avoids arbitrarily long arithmetic progressions with common differences in S.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…