← All problems

Glasner–Huang–Shao–Weiss–Ye polynomial odd-recurrence conjecture

1 year old · traced to

Let (X,T)(X,T) be a minimal system and let k,d∈Nk,d\in\mathbb{N}. Suppose that (X,Tk)(X,T^k) is minimal. For polynomials p1,…,pd∈Z[x]p_1,\ldots,p_d\in\mathbb{Z}[x] satisfying pi(0)=0p_i(0)=0 for i=1,…,di=1,\ldots,d, and a nonempty open set U⊆XU\subseteq X, define

R={n∈Z:T−p1(n)U∩⋯∩T−pd(n)U≠∅}.R=\{n\in\mathbb{Z}:T^{-p_1(n)}U\cap\cdots\cap T^{-p_d(n)}U\neq\emptyset\}.

Glasner–Huang–Shao–Weiss–Ye conjecture. The set RR has nonempty intersection with every infinite arithmetic progression of step size kk.

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.

References
  1. 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).

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.