Non-commutative symbolic coding

Rolf Gohm, Burkhard Kümmerer, TATJANA LANG · Ergodic Theory and Dynamical Systems · 2006

We give a non-commutative generalization of classical symbolic coding in the presence of a synchronizing word. This is done by a scattering theoretical approach. Classically, the existence of a synchronizing word turns out to be equivalent to asymptotic completeness of the corresponding Markov process. A criterion for asymptotic completeness in general is provided by the regularity of an associated extended transition operator. Commutative and non-commutative examples are analysed.

Read the paper · More papers on PaperTik