Recurrence transfer conjecture for nilsystems

About 12 years old · traced to

Let s≥1s\geq 1, and let R⊂NR\subset\mathbb N be a set of ss-recurrence for ss-step nilsystems. Recurrence transfer conjecture. Then RR is a set of ss-recurrence for all tt-step nilsystems for any t≥st\geq s. This conjecture asks whether recurrence for systems of the same step automatically persists for nilsystems of every higher step; the source gives no resolution beyond the related cases discussed immediately before the conjecture.

References

Primary source

Bernard Host, Bryna Kra and Alejandro Maass, “Variations on topological recurrence”, arXiv:1408.2728 (2014).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.