Ergodicity of the adic transformation on the Euler graph (2006)
Bailey, Sarah, Keane, Michael, Petersen, Karl, Salama, Ibrahim
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...
Thèse complémentaire--Paris.
Thèse and these complémentaire--Univ. de Paris.
Theèse complémentaire--Paris.