Polynomial recurrence with large intersection over countable fields
Vitaly Bergelson, Donald Robertson

TL;DR
This paper presents a concise proof demonstrating polynomial recurrence with large intersection for additive actions of vector spaces over countable fields, enhancing understanding of recurrence times in probability spaces.
Contribution
It provides a simplified proof that improves the known size and structure of strong recurrence times in polynomial recurrence over countable fields.
Findings
Enhanced bounds on recurrence times
Simplified proof technique
Improved understanding of recurrence structure
Abstract
We give a short proof of polynomial recurrence with large intersection for additive actions of finite-dimensional vector spaces over countable fields on probability spaces, improving upon the known size and structure of the set of strong recurrence times.
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
TopicsAdvanced Topology and Set Theory · Limits and Structures in Graph Theory · Mathematical Dynamics and Fractals
