RUS  ENG
Full version
JOURNALS // Funktsional'nyi Analiz i ego Prilozheniya // Archive

Funktsional. Anal. i Prilozhen., 2018 Volume 52, Issue 4, Pages 23–37 (Mi faa3615)

This article is cited 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.

UDC: 519.1+519.2

Received: 18.09.2018

DOI: 10.4213/faa3615


 English version:
Functional Analysis and Its Applications, 2018, 52:4, 258–269

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2025