Idempotent ultrafilters and polynomial recurrence
Christian Schnell

TL;DR
This paper presents a novel proof of a polynomial recurrence theorem by employing idempotent ultrafilters, offering an alternative approach to the traditional IP-limit method.
Contribution
It introduces the use of idempotent ultrafilters as a new technique to prove polynomial recurrence results, replacing the conventional IP-limit approach.
Findings
New proof of polynomial recurrence using ultrafilters
Demonstrates the effectiveness of ultrafilters in ergodic theory
Provides insights into ultrafilter-based methods in recurrence theory
Abstract
We give a new proof of a polynomial recurrence result due to Bergelson, Furstenberg, and McCutcheon, using idempotent ultrafilters instead of IP-limits.
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 · Advanced Topology and Set Theory · advanced mathematical theories
