arXiv:1507.07370 [math.NT]AbstractReferencesReviewsResources
Combinatorial properties of Nil-Bohr sets
Published 2015-07-27Version 1
In this paper we study the relation between two notions of largeness that apply to a set of positive integers, namely $\mathrm{Nil}_d{-}\mathrm{Bohr}$ and $\mathrm{SG}_k$, as introduced by Host and Kra. We prove that any $\mathrm{Nil}_d{-}\mathrm{Bohr}_0$ set is necessarily $\mathrm{SG}_k$ where ${k}$ is effectively bounded in terms of $d$. This partially resolves a conjecture of Host and Kra.
Comments: 25 pages
Related articles: Most relevant | Search more
Problems on combinatorial properties of primes
On a conjecture of Deutsch, Sagan, and Wilson
arXiv:1303.7337 [math.NT] (Published 2013-03-29)
The Cohen-Lenstra heuristics, moments and $p^j$-ranks of some groups