Combinatorial invariants of metric filtrations and automorphisms; the universal adic graph

DOI10.1007/s10688-018-0236-1zbMath1418.28001arXiv1812.07841OpenAlexW2905492472WikidataQ128446001 ScholiaQ128446001MaRDI QIDQ2314180

Pavel B. Zatitskiy, Anatoly M. Vershik

Publication date: 19 July 2019

Published in: Functional Analysis and its Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1812.07841

zbMATH Keywords

uniform approximationfiltrationscombinatorial definitenessuniversal adic graph

Mathematics Subject Classification ID

Applications of graph theory (05C90) Measure-preserving transformations (28D05) Set functions and measures on topological spaces (regularity of measures, etc.) (28C15)

Related Items (2)

Dynamics of metrics in measure spaces and scaling entropy ⋮ Non-existence of a universal zero entropy system for non-periodic amenable group actions

Cites Work

• Four definitions of the scale of an automorphism
• On entropy invariants of descreasing sequences of measurable partitions
• Continuum of pairwise nonisomorphic dyadic sequences
• Bratteli diagrams: Structure, measures, dynamics
• Scaled Entropy of Filtrations of $\sigma$-Fields
• MONOTONE EQUIVALENCE IN ERGODIC THEORY
• Bratteli-Vershik models for Cantor minimal systems associated to interval exchange transformations
• Universal adic approximation, invariant measures and scaled entropy
• The theory of filtrations of subalgebras, standardness, and independence
• APPROXIMATIONS IN ERGODIC THEORY
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Combinatorial invariants of metric filtrations and automorphisms; the universal adic graph