This Week
Tom Meyerovitch (BGU)
Kac’s lemma revisited
Kac’s lemma revisited
Kac’s lemma is a classical result in ergodic theory. It asserts that the expected number of
iterates that it takes a point from a measurable set A to return to the set A under an ergodic
probability-preserving transformation is equal to the inverse of the measure of A. As we will discuss in this seminar, there is a natural generalization of Kac’s lemma that applies to probability preserving actions of an arbitrary countable group (and beyond). As an application, we will show that that any ergodic action of a countable group admits a countable generator. The content of this work is based on a joint article with Benjamin Weiss
https://doi.org/10.48550/arXiv.2410.18488
2024–25–A meetings
Upcoming Meetings
Date |
Title |
Speaker |
Abstract |
---|---|---|---|
Nov 21 | Kac’s lemma revisitedOnline | Tom Meyerovitch (BGU) | |
Nov 28 | On the local convergence of random Lipschitz functions on regular trees | Yinon Spinka (TAU) |
Past Meetings
Date |
Title |
Speaker |
Abstract |
---|---|---|---|
Nov 7 | Sublinear Distortion and QI Classification of Solvable Lie Groups.Online | Ido Grayevsky (HUJI) | |
Nov 14 | Enveloping Ellis semigroups as compactifications of transformations groups.Online | Konstantin Kozlov (BGU) |
Seminar run by Dr. Ido Grayevsky and Tomer Zimhoni