### Abstract

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 paths that begin at the root. We prove that for every ordering the coding of orbits according to the partition of the path space determined by the first three edges is essentially faithful, meaning that it is one-to-one on a set of paths that has full measure for every fully supported invariant probability measure. We also show that for every the subshift that arises from coding orbits according to the first edges is topologically weakly mixing. We give a necessary and sufficient condition for any adic system to be topologically conjugate to an odometer and use this condition to determine the probability that a random order on a fixed diagram, or a diagram constructed at random in some way, is topologically conjugate to an odometer. We also show that the closure of the union over all orderings of the subshifts arising from codings of the Pascal adic by the first edge has superpolynomial complexity, is not topologically transitive, and has no periodic points besides the two fixed points, while the intersection over all orderings consists of just four orbits.

Language | English (US) |
---|---|

Pages | 2131-2162 |

Number of pages | 32 |

Journal | Ergodic Theory and Dynamical Systems |

Volume | 37 |

Issue number | 7 |

DOIs | |

State | Published - Oct 1 2017 |

### Fingerprint

### ASJC Scopus subject areas

- Mathematics(all)
- Applied Mathematics

### Cite this

*Ergodic Theory and Dynamical Systems*,

*37*(7), 2131-2162. DOI: 10.1017/etds.2015.128

**Dynamical properties of some adic systems with arbitrary orderings.** / Frick, Sarah; Petersen, Karl; Shields, Sandi.

Research output: Contribution to journal › Article

*Ergodic Theory and Dynamical Systems*, vol 37, no. 7, pp. 2131-2162. DOI: 10.1017/etds.2015.128

}

TY - JOUR

T1 - Dynamical properties of some adic systems with arbitrary orderings

AU - Frick,Sarah

AU - Petersen,Karl

AU - Shields,Sandi

PY - 2017/10/1

Y1 - 2017/10/1

N2 - 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 paths that begin at the root. We prove that for every ordering the coding of orbits according to the partition of the path space determined by the first three edges is essentially faithful, meaning that it is one-to-one on a set of paths that has full measure for every fully supported invariant probability measure. We also show that for every the subshift that arises from coding orbits according to the first edges is topologically weakly mixing. We give a necessary and sufficient condition for any adic system to be topologically conjugate to an odometer and use this condition to determine the probability that a random order on a fixed diagram, or a diagram constructed at random in some way, is topologically conjugate to an odometer. We also show that the closure of the union over all orderings of the subshifts arising from codings of the Pascal adic by the first edge has superpolynomial complexity, is not topologically transitive, and has no periodic points besides the two fixed points, while the intersection over all orderings consists of just four orbits.

AB - 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 paths that begin at the root. We prove that for every ordering the coding of orbits according to the partition of the path space determined by the first three edges is essentially faithful, meaning that it is one-to-one on a set of paths that has full measure for every fully supported invariant probability measure. We also show that for every the subshift that arises from coding orbits according to the first edges is topologically weakly mixing. We give a necessary and sufficient condition for any adic system to be topologically conjugate to an odometer and use this condition to determine the probability that a random order on a fixed diagram, or a diagram constructed at random in some way, is topologically conjugate to an odometer. We also show that the closure of the union over all orderings of the subshifts arising from codings of the Pascal adic by the first edge has superpolynomial complexity, is not topologically transitive, and has no periodic points besides the two fixed points, while the intersection over all orderings consists of just four orbits.

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

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

U2 - 10.1017/etds.2015.128

DO - 10.1017/etds.2015.128

M3 - Article

VL - 37

SP - 2131

EP - 2162

JO - Ergodic Theory and Dynamical Systems

T2 - Ergodic Theory and Dynamical Systems

JF - Ergodic Theory and Dynamical Systems

SN - 0143-3857

IS - 7

ER -