Related papers: Krieger's finite generator theorem for actions of …

We continue the study of Rokhlin entropy, an isomorphism invariant for probability-measure-preserving actions of countable groups introduced in Part I. In this paper we prove a non-ergodic finite generator theorem and use it to establish…

We continue the study of Rokhlin entropy, an isomorphism invariant for probability-measure-preserving actions of countable groups introduced in the previous paper. We prove that every free ergodic action with finite Rokhlin entropy admits…

We prove that if an ergodic action of a countable group on a probability space admits a generating partition having finite Shannon entropy then it admits a finite generating partition.

For a continuous action of a countable discrete group $G$ on a Polish space $X$, a countable Borel partition $P$ of $X$ is called a generator if $G \cdot P := \{ gC : g \in G, C \in P \}$ generates the Borel $\sigma$-algebra of $X$. For $G…

We introduce a new isomorphism-invariant notion of entropy for measure preserving actions of arbitrary countable groups on probability spaces, which we call orbital Rokhlin entropy. It employs Danilenko's orbital approach to entropy of a…

We prove that if a free ergodic action of a countably infinite group has positive Rokhlin entropy (or, less generally, positive sofic entropy) then it factors onto all Bernoulli shifts of lesser or equal entropy. This extends to all…

Generalizing Krieger's finite generation theorem, we give conditions for an ergodic system to be generated by a pair of partitions, each required to be measurable with respect to a given sub-algebra, and also required to have a fixed size.

It is well known that if $G$ is a countable amenable group and $G \curvearrowright (Y, \nu)$ factors onto $G \curvearrowright (X, \mu)$, then the entropy of the first action must be greater than or equal to the entropy of the second action.…

Ergodic theory includes several notions of entropy for probability-preserving actions of countable groups. These include Kolmogorov--Sinai entropy based on F\o lner sequences for amenable groups, entropy defined using a random ordering of…

Kolmogorov-Sinai entropy is an invariant of measure-preserving actions of the group of integers that is central to classification theory. There are two recently developed invariants, sofic entropy and Rokhlin entropy, that generalize…

The Krieger generator theorem says that every invertible ergodic measure-preserving system with finite measure-theoretic entropy can be embedded into a full shift with strictly greater topological entropy. We extend Krieger's theorem to…

The goal of this note is to provide yet another proof of the following theorem of Golod: there exists an infinite finitely generated group $G$ such that every element of $G$ has finite order. Our proof is based on the Nielsen-Schreier index…

We solve the question of the existence of a Poisson-Pinsker factor for conservative ergodic infinite measure preserving action of a countable amenable group by proving the following dichotomy: either it has totally positive Poisson entropy…

Let G be an affine algebraic group acting on an affine variety X. We present an algorithm for computing generators of the invariant ring K[X]^G in the case where G is reductive. Furthermore, we address the case where G is connected and…

We show that, for countable sofic groups, a Bernoulli action with infinite entropy base has infinite entropy with respect to every sofic approximation sequence. This builds on the work of Lewis Bowen in the case of finite entropy base and…

We extend the classical Baire category approach, used in proving the finite generator theorem of Krieger, the homomorphism theorem of Sinai and the isomorphism theorem of Ornstein, applying a similar reasoning to the case of actions of…

We pursue the study of $\mathrm L^1$ full groups of graphings and of the closures of their derived groups, which we call derived $\mathrm L^1$ full groups. Our main result shows that aperiodic probability measure-preserving actions of…

Gromov's theorem states that a finitely generated group has polynomial growth if and only if it is virtually nilpotent. A key ingredient in its proof is the small doubling property. In this work, we study entropy analogues of this property…

We prove that a topologically predictable action of a countable amenable group has zero topological entropy, as conjectured by Hochman. On route, we investigate invariant random orders and formulate a unified Kieffer-Pinsker formula for the…

A measure preserving action of a countably infinite group \Gamma is called totally ergodic if every infinite subgroup of \Gamma acts ergodically. For example, all mixing and mildly mixing actions are totally ergodic. This note shows that if…