pith. sign in

arxiv: 1407.3496 · v3 · pith:G6GWNTWPnew · submitted 2014-07-13 · 🧮 math.DS

Bratteli diagrams where random orders are imperfect

classification 🧮 math.DS
keywords brattelirandomorderdiagramsdiagramgrowinginfiniteadmit
0
0 comments X
read the original abstract

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 super-linear. This gives us the dichotomy: a random order on a slowly growing Bratteli diagram admits a homeomorphism, while a random order on a quickly growing Bratteli diagram does not. We also show that for a large family of infinite rank Bratteli diagrams, a random order on B does not admit a continuous Vershik map.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.