pith. sign in

arxiv: 1507.07370 · v2 · pith:MNCWGFRGnew · submitted 2015-07-27 · 🧮 math.NT · math.CO· math.DS

Combinatorial properties of Nil-Bohr sets

classification 🧮 math.NT math.COmath.DS
keywords mathrmbohrhostapplyboundedcombinatorialconjectureeffectively
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.