Combinatorial properties of Nil-Bohr sets
Abstract
In this paper we study the relation between two notions of largeness that apply to a set of positive integers, namely Nild-Bohr and SGk, as introduced by Host and Kra. We prove that any Nild-Bohr0 set is necessarily SGk where k is effectively bounded in terms of d. This partially resolves a conjecture of Host and Kra.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.