Glasner–Huang–Shao–Weiss–Ye polynomial odd-recurrence conjecture
Glasner–Huang–Shao–Weiss–Ye polynomial odd-recurrence conjecture
Let be a minimal system and let . Suppose that is minimal. For polynomials satisfying for , and a nonempty open set , define
Glasner–Huang–Shao–Weiss–Ye conjecture. The set has nonempty intersection with every infinite arithmetic progression of step size .
This conjecture generalizes polynomial recurrence in minimal systems and is equivalent in the paper to a conjecture describing connected orbit closures in totally minimal nilsystems. Its resolution is not supplied here.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Daniel Glasscock, Andreas Koutsogiannis, Anh N. Le, Joel Moreira, Florian K. Richter and Donald Robertson, “A structure theorem for polynomial return-time sets in minimal systems”, arXiv:2511.02080 (2026).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.