Related papers: Aperiodic substitutional systems and their Brattel…
In this paper we focus on Bratteli-Vershik models of general compact zero-dimensional systems with the action of a homeomorphism. An ordered Bratteli diagram is called decisive if the corresponding Vershik map prolongs in a unique way to a…
The present paper explores substitution minimal systems and their relation to stationary Bratteli diagrams and stationary dimension groups. The constructions involved are algorithmic and explicit, and render an effective method to compute…
We study stationary ordered Bratteli diagrams and give necessary and sufficient conditions for these orders to generate a continuous Vershik map. We apply this to finding adic representations for one sided substitution subshifts. We give an…
Separated graphs provide a powerful combinatorial tool for approximating dynamical systems. This paper details the explicit construction of Bratteli-like separated graphs -- a generalization of classical Bratteli diagrams -- that encode the…
We introduce and study dynamical systems and measures on stationary generalized Bratteli diagrams $B$ that are represented as the union of countably many classical Pascal-Bratteli diagrams. We describe all ergodic tail invariant measures on…
Minimal Cantor systems of finite topological rank (that can be represented by a Bratteli-Vershik diagram with a uniformly bounded number of vertices per level) are known to have dynamical rigidity properties. We establish that such systems,…
In the paper "Finite-rank Bratteli-Vershik diagrams are expansive" [DM], Downarowicz and Maass proved that the Cantor minimal system associated to a properly ordered Bratteli diagram of finite rank is either an odometer system or an…
Downarowicz and Maass (2008) have shown that every Cantor minimal homeomorphism with finite topological rank $K > 1$ is expansive. Bezuglyi, Kwiatkowski, and Medynets (2009) extended the result to non-minimal aperiodic cases. In this paper,…
We study substitutions on countably infinite alphabet (without compactification) as Borel dynamical systems. We construct stationary and non-stationary generalized Bratteli-Vershik models for a class of such substitutions, known as left…
In this article we study conditions to be a continuous or a measurable eigenvalue of finite rank minimal Cantor systems, that is, systems given by an ordered Bratteli diagram with a bounded number of vertices per level. We prove that…
We develop conditions for the coding of a Bratteli-Vershik system according to initial path segments to be periodic, equivalently for a constructive symbolic recursive scheme corresponding to a cutting and stacking process to produce a…
We consider dynamical systems arising from substitutions over a finite alphabet. We prove that such a system is linearly repetitive if and only if it is minimal. Based on this characterization we extend various results from primitive…
We consider arbitrary orderings of the edges entering each vertex of the (downward directed) Pascal graph. Each ordering determines an adic (Bratteli-Vershik) system, with a transformation that is defined on most of the space of infinite…
Bratteli-Vershik models have been very successfully applied to the study of various dynamical systems, in particular, in Cantor dynamics. In this paper, we study dynamics on the path spaces of generalized Bratteli diagrams that form models…
For the simple Bratteli diagrams B where there is a single edge connecting any two vertices in consecutive levels, we show that a random order has uncountably many infinite paths if and only if the growth rate of the level-n vertex sets is…
We study one-sided substitution subshifts, and how they can be represented using Bratteli-Vershik systems. In particular we focus on minimal recognizable substitutions such that the generated one-sided substitution subshift contains only…
Many dynamical systems can be naturally represented as `Bratteli-Vershik' (or `adic') systems, which provide an appealing combinatorial description of their dynamics. If an adic system X satisfies two technical conditions (`focus' and…
Based on our previous graph covering method, we introduce weighted graph covering models and flexible graph covering models that are almost equivalent to the well-known Bratteli--Vershik models. These models play important roles in showing…
In another article we associated a dynamical system to a non-properly ordered Bratteli diagram. In this article we describe how to compute the $K-$group $K_0$ of the dynamical system in terms of the Bratteli diagram. In the case of properly…
We show that every topological factoring between two zero dimensional dynamical systems can be represented by a sequence of morphisms between the levels of the associated ordered Bratteli diagrams. Conversely, we will prove that given an…