|
This article is cited in 4 scientific papers (total in 4 papers)
Combinatorial Invariants of Metric Filtrations and Automorphisms; the Universal Adic Graph
A. M. Vershikabc, P. B. Zatitskiida a St. Petersburg Department of Steklov Mathematical Institute of Russian Academy of Sciences
b St. Petersburg State University, Mathematics and Mechanics Faculty
c Institute for Information Transmission Problems of the Russian Academy of Sciences (Kharkevich Institute), Moscow
d Saint Petersburg State University
Abstract:
We suggest a combinatorial classification of metric filtrations of measure spaces; a complete invariant of such a filtration is its combinatorial scheme, a measure on the space of hierarchies of the group $\mathbb Z$. In turn, the notion of a combinatorial scheme is a source of new metric invariants of automorphisms approximated by means of basic filtrations. We construct a universal graph with an adic structure such that every automorphism can be realized on its path space.
Keywords:
uniform approximation, filtrations, combinatorial definiteness, universal adic graph.
Received: 18.09.2018
Citation:
A. M. Vershik, P. B. Zatitskii, “Combinatorial Invariants of Metric Filtrations and Automorphisms; the Universal Adic Graph”, Funktsional. Anal. i Prilozhen., 52:4 (2018), 23–37; Funct. Anal. Appl., 52:4 (2018), 258–269
Linking options:
https://www.mathnet.ru/eng/faa3615https://doi.org/10.4213/faa3615 https://www.mathnet.ru/eng/faa/v52/i4/p23
|
|