Periodicity of Rauzy scheme and substitutional systems
Dynamical Systems
2012-07-18 v3 Combinatorics
Abstract
In the paper the notion of {\em Rauzy scheme} is introduced. From Rauzy graph Rauzy Scheme can be obtaining by uniting sequence of vertices of ingoing and outgoing degree 1 by arches. This notion is a tool to describe Rauzy graph behavior. For morphic superword we prove periodicity of Rauzy schemes. This is generalization of fact that quadratic irrationals have periodic chain fractions.
Keywords
Cite
@article{arxiv.1107.0185,
title = {Periodicity of Rauzy scheme and substitutional systems},
author = {Alexei Kanel-Belov and Ivan Mitrofanov},
journal= {arXiv preprint arXiv:1107.0185},
year = {2012}
}
Comments
in Russian