Periodicity of Rauzy scheme and substitutional systems
Alexei Kanel-Belov, Ivan Mitrofanov

TL;DR
This paper introduces Rauzy schemes as a new tool to analyze Rauzy graphs and proves their periodicity for morphic superwords, generalizing the periodicity of quadratic irrationals' chain fractions.
Contribution
The paper defines Rauzy schemes and establishes their periodicity for morphic superwords, extending known results about quadratic irrationals.
Findings
Rauzy schemes can be derived from Rauzy graphs by uniting certain vertices.
Morphic superwords exhibit periodic Rauzy schemes.
Generalization of quadratic irrationals' periodic chain fractions.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicssemigroups and automata theory · Advanced Combinatorial Mathematics · Coding theory and cryptography
