English

Structure of 2-step nilpotent ergodic averages for distinct-degree polynomials

Dynamical Systems 2026-07-31 v1 Combinatorics

Abstract

We investigate manifestations of the Nilpotent Heuristic, which posits that recurrence and convergence phenomena known for measure-preserving ZD\mathbb{Z}^D-systems extend to nilpotent group actions. Our main results establish seminorm estimates and limiting formulas for multiple ergodic averages arising from actions of 2-step nilpotent groups. In particular, if T1,,TT_1,\ldots,T_\ell are totally ergodic and generate a 2-step nilpotent group, then limN1Nn=1NT1nf1Tnf=j=1fjdμ \lim_{N\to\infty}\frac{1}{N}\sum_{n=1}^N T_1^n f_1 \cdots T_\ell^{n^\ell}f_\ell = \prod_{j=1}^{\ell}\int f_j\,d\mu in the L2L^{2} norm for all bounded functions f1,,ff_{1},\dots,f_{\ell}; the same holds for any distinct-degree polynomial iterates. We also obtain popular-common-difference versions of the polynomial Szeme\'edi theorem in the same setting. In a different direction, our approach allows us to completely resolve the joint ergodicity conjecture for multidimensional polynomials and ZD\mathbb Z^D-systems; we also present an example showing that, surprisingly enough, the 2-step nilpotent analog fails. We conclude with many open problems concerning joint ergodicity, seminorm estimates, and the structure theory of nilpotent systems.

Keywords

Cite

@article{arxiv.2607.29368,
  title  = {Structure of 2-step nilpotent ergodic averages for distinct-degree polynomials},
  author = {Andreas Koutsogiannis and Borys Kuca and Wenbo Sun},
  journal= {arXiv preprint arXiv:2607.29368},
  year   = {2026}
}