Standard

Combinatorial Invariants of Metric Filtrations and Automorphisms; the Universal Adic Graph. / Vershik, A. M.; Zatitskiy, P. B.

In: Functional Analysis and its Applications, Vol. 52, No. 4, 01.10.2018, p. 258-269.

Research output: Contribution to journal › Article › peer-review

Harvard

Vershik, AM & Zatitskiy, PB 2018, 'Combinatorial Invariants of Metric Filtrations and Automorphisms; the Universal Adic Graph', Functional Analysis and its Applications, vol. 52, no. 4, pp. 258-269. https://doi.org/10.1007/s10688-018-0236-1

APA

Vershik, A. M., & Zatitskiy, P. B. (2018). Combinatorial Invariants of Metric Filtrations and Automorphisms; the Universal Adic Graph. Functional Analysis and its Applications, 52(4), 258-269. https://doi.org/10.1007/s10688-018-0236-1

Vancouver

Vershik AM, Zatitskiy PB. Combinatorial Invariants of Metric Filtrations and Automorphisms; the Universal Adic Graph. Functional Analysis and its Applications. 2018 Oct 1;52(4):258-269. https://doi.org/10.1007/s10688-018-0236-1

Author

Vershik, A. M. ; Zatitskiy, P. B. / Combinatorial Invariants of Metric Filtrations and Automorphisms; the Universal Adic Graph. In: Functional Analysis and its Applications. 2018 ; Vol. 52, No. 4. pp. 258-269.

BibTeX

@article{4692669f560648eda2dd04c811b81d4b,
title = "Combinatorial Invariants of Metric Filtrations and Automorphisms; the Universal Adic Graph",
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 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 = "combinatorial definiteness, filtrations, uniform approximation, universal adic graph",
author = "Vershik, {A. M.} and Zatitskiy, {P. B.}",
year = "2018",
month = oct,
day = "1",
doi = "10.1007/s10688-018-0236-1",
language = "English",
volume = "52",
pages = "258--269",
journal = "Functional Analysis and its Applications",
issn = "0016-2663",
publisher = "Springer Nature",
number = "4",

}

RIS

TY - JOUR

T1 - Combinatorial Invariants of Metric Filtrations and Automorphisms; the Universal Adic Graph

AU - Vershik, A. M.

AU - Zatitskiy, P. B.

PY - 2018/10/1

Y1 - 2018/10/1

N2 - 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 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.

AB - 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 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.

KW - combinatorial definiteness

KW - filtrations

KW - uniform approximation

KW - universal adic graph

UR - http://www.scopus.com/inward/record.url?scp=85060909711&partnerID=8YFLogxK

U2 - 10.1007/s10688-018-0236-1

DO - 10.1007/s10688-018-0236-1

M3 - Article

AN - SCOPUS:85060909711

VL - 52

SP - 258

EP - 269

JO - Functional Analysis and its Applications

JF - Functional Analysis and its Applications

SN - 0016-2663

IS - 4

ER -

ID: 38371858