pith. sign in

arxiv: 0711.0484 · v2 · submitted 2007-11-05 · 🧮 math.DS

Idempotent ultrafilters and polynomial recurrence

classification 🧮 math.DS
keywords idempotentpolynomialrecurrenceultrafiltersbergelsonfurstenberggiveinstead
0
0 comments X
read the original abstract

We give a new proof of a polynomial recurrence result due to Bergelson, Furstenberg, and McCutcheon, using idempotent ultrafilters instead of IP-limits.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.