Papers
Topics
Authors
Recent
Search
2000 character limit reached

Combinatorial properties of Nil-Bohr sets

Published 27 Jul 2015 in math.NT, math.CO, and math.DS | (1507.07370v2)

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.

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.