A two-valued step coding for ergodic flows
From MaRDI portal
Publication:1225164
DOI10.1007/BF01221147zbMath0325.28019OpenAlexW2912093941MaRDI QIDQ1225164
Publication date: 1976
Published in: Mathematische Zeitschrift (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/172418
Related Items
Two nonisomorphic flows with the same very weak Bernoulli partition on a base, Rohlin flows on von Neumann algebras, Representing Ergodic Flows as Flows Built under Functions with Finite Range, Informal research statement, Infinite partitions and Rokhlin towers, Unnamed Item, Infinite type flat surface models of ergodic systems, α-equivalence: a refinement of Kakutani equivalence, Unnamed Item, On generators for ergodic flows, An information cocycle for groups of non-singular transformations, Symbolic extensions and uniform generators for topological regular flows, Genericity of trivial Lyapunov spectrum for \(L^p\)-cocycles derived from second order linear homogeneous differential equations, Equilibrium states for self‐products of flows and the mixing properties of rank 1 geodesic flows, Lyapunov exponents for linear homogeneous differential equations, MultiTowers, conjugacies and codes: Three theorems in Ergodic theory, one variation on Rokhlin’s Lemma, Special representations of \({\mathbb{Z}}^n\)-actions, Partitions of the phase space of a measure preserving \(\mathbb{Z}^d\)-action into towers, Regular cross sections of Borel flows, Statistical properties of chaotic systems, Measures of maximal entropy on subsystems of topological suspension semiflows, Rudolph’s two step coding theorem and Alpern’s lemma for ℝ^{𝕕} actions, Unnamed Item
Cites Work
- The isomorphism theorem for Bernoulli flows
- Representation of ergodic flows
- Structure and continuity of measurable flows
- [https://portal.mardi4nfdi.de/wiki/Publication:3213374 Einbettung von Str�mungen in Funktionenr�ume durch Erzeuger vom endlichen Typ]
- On Entropy and Generators of Measure-Preserving Transformations
- Unnamed Item
- Unnamed Item
