Degree lowering for ergodic averages along arithmetic progressions
Nikos Frantzikinakis, Borys Kuca

TL;DR
This paper investigates the limiting behavior of multiple ergodic averages along arithmetic progressions with restricted differences, establishing conditions for their limits and relating them to Gowers-Host-Kra seminorms.
Contribution
It introduces a degree lowering technique for controlling ergodic averages via Gowers-Host-Kra seminorms, with new estimates and inverse theorems.
Findings
Necessary and sufficient conditions for averages to have the same limit as standard arithmetic progressions.
A new higher order degree lowering argument for ergodic averages.
Derived conditions for the existence of arithmetic progressions with restricted differences.
Abstract
We examine the limiting behavior of multiple ergodic averages associated with arithmetic progressions whose differences are elements of a fixed integer sequence. For each , we give necessary and sufficient conditions under which averages of length of the aforementioned form have the same limit as averages of -term arithmetic progressions. As a corollary, we derive a sufficient condition for the presence of arithmetic progressions with length and restricted differences in dense subsets of integers. These results are a consequence of the following general theorem: in order to verify that a multiple ergodic average is controlled by the degree Gowers-Host-Kra seminorm, it suffices to show that it is controlled by some Gowers-Host-Kra seminorm, and that the degree control follows whenever we have degree control. The proof relies on an elementary…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Italy: Economic History and Contemporary Issues
