Bratteli–Vershik diagram

Let X = {(e₁, e₂, ...) | e_i ∈ E_i and r(e_i) = s(e_i+1)} be the set of all paths in the essentially simple Bratteli diagram (V, E). Let E_min be the set of all minimal edges in E, similarly let E_max be the set of all maximal edges. Let y be the unique infinite path in E_max. (Diagrams which possess a unique infinite path are called "essentially simple".)

The Veršhik transformation is a homeomorphism φ : X → X defined such that φ(x) is the unique minimal path if x = y. Otherwise x = (e₁, e₂,...) | e_i ∈ E_i where at least one e_i ∉ E_max. Let k be the smallest such integer. Then φ(x) = (f₁, f₂, ..., f_k−1, e_k + 1, e_k+1, ... ), where e_k + 1 is the successor of e_k in the total ordering of edges incident on r(e_k) and (f₁, f₂, ..., f_k−1) is the unique minimal path to e_k + 1.

The Veršhik transformation allows us to construct a pointed topological system (X, φ, y) out of any given ordered, essentially simple Bratteli diagram. The reverse construction is also defined.

The notion of graph minor can be promoted from a well-quasi-ordering to an equivalence relation if we assume the relation is symmetric. This is the notion of equivalence used for Bratteli diagrams.

The major result in this field is that equivalent essentially simple ordered Bratteli diagrams correspond to topologically conjugate pointed dynamical systems. This allows us apply results from the former field into the latter and vice versa.[1]

• Markov odometer

• Dooley, Anthony H. (2003). "Markov odometers". In Bezuglyi, Sergey; Kolyada, Sergiy (eds.). Topics in dynamics and ergodic theory. Survey papers and mini-courses presented at the international conference and US-Ukrainian workshop on dynamical systems and ergodic theory, Katsiveli, Ukraine, August 21–30, 2000. Lond. Math. Soc. Lect. Note Ser. 310. Cambridge: Cambridge University Press. pp. 60–80. ISBN 0-521-53365-1. Zbl 1063.37005.