Ergodicity of the adic transformation on the Euler graph

Details Ergodicity of the adic transformation on the Euler graph Ergodicity of the adic transformation on the Euler graph

2006-03-22

arxiv.org/abs/math/0603542v1

Mathematics

Dynamical Systems

8 pages, 8 figures, to appear Math. Proc. Camb. Phil. Soc

Scientific paper

10.1017/S0305004106009431

The Euler graph has vertices labelled (n,k) for n=0,1,2,... and k=0,1,...,n, with k+1 edges from (n,k) to (n+1,k) and n-k+1 edges from (n,k) to (n+1,k+1). The number of paths from (0,0) to (n,k) is the Eulerian number A(n,k), the number of permutations of 1,2,...,n+1 with exactly n-k falls and k rises. We prove that the adic (Bratteli-Vershik) transformation on the space of infinite paths in this graph is ergodic with respect to the symmetric measure.

Affiliated with

Also associated with

No associations

Rating

Ergodicity of the adic transformation on the Euler graph 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 Ergodicity of the adic transformation on the Euler graph, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Ergodicity of the adic transformation on the Euler graph will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-305863