The Furstenberg-S\'ark\"ozy Theorem and Asymptotic Total Ergodicity Phenomena in Modular Rings
Vitaly Bergelson, Andrew Best

TL;DR
This paper extends ergodic theory concepts to modular rings, establishing conditions under which asymptotic total ergodicity occurs and deriving combinatorial results related to polynomial images and sumsets.
Contribution
It introduces the notion of asymptotic total ergodicity in modular rings and characterizes it via the growth of the least prime factor of the modulus, with applications to sumset decompositions.
Findings
Asymptotic total ergodicity occurs if and only if the least prime factor tends to infinity.
Large prime factors ensure sumset decompositions involving polynomial images.
Results have implications for combinatorial structures in modular arithmetic.
Abstract
The Furstenberg-S\'ark\"ozy theorem asserts that the difference set of a subset with positive upper density intersects the image set of any polynomial for which . Furstenberg's approach relies on a correspondence principle and a polynomial version of the Poincar\'e recurrence theorem, which is derived from the ergodic-theoretic result that for any measure-preserving system and set with , one has The limit will have its optimal value of when is totally ergodic. Motivated by the possibility of new combinatorial applications, we define the notion of asymptotic total ergodicity in the setting of modular rings . We show that a sequence of modular rings…
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
TopicsMathematical Dynamics and Fractals · Meromorphic and Entire Functions · Advanced Topology and Set Theory
