2000 character limit reached
Periodicity of Rauzy scheme and substitutional systems
Published 1 Jul 2011 in math.DS and math.CO | (1107.0185v3)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.