Recurrence transfer conjecture for nilsystems
Recurrence transfer conjecture for nilsystems
Let , and let be a set of -recurrence for -step nilsystems. Recurrence transfer conjecture. Then is a set of -recurrence for all -step nilsystems for any . 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.
Sources & referencesView supporting material
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
Sign in to submit a solution.
No solutions have been posted yet.