Perfect orderings on Bratteli diagrams

Details Perfect orderings on Bratteli diagrams Perfect orderings on Bratteli diagrams

2012-04-07

arxiv.org/abs/1204.1621v1

Mathematics

Dynamical Systems

45 pages, 4 figures

Scientific paper

Given a Bratteli diagram B, we study the set O(B) of all possible orderings w on a Bratteli diagram B and its subset P(B) consisting of `perfect' orderings that produce Bratteli-Vershik dynamical systems (Vershik maps). We give necessary and sufficient conditions for w to be perfect. On the other hand, a wide class of non-simple Bratteli diagrams that do not admit Vershik maps is explicitly described. In the case of finite rank Bratteli diagrams, we show that the existence of perfect orderings with a prescribed number of extreme paths affects significantly the values of the entries of the incidence matrices and the structure of the diagram B. Endowing the set O(B) with product measure, we prove that there is some j such that almost all orderings on B have j maximal and minimal paths, and that if j is strictly greater than the number of minimal components that B has, then almost all orderings are imperfect.

Affiliated with

Also associated with

No associations

Rating

Perfect orderings on Bratteli diagrams does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Perfect orderings on Bratteli diagrams, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Perfect orderings on Bratteli diagrams will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-37194