当前位置:
X-MOL 学术
›
Theor. Comput. Sci.
›
论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Reprint of: Palindromization and construction of Markoff triples
Theoretical Computer Science ( IF 1.1 ) Pub Date : 2020-06-04 , DOI: 10.1016/j.tcs.2020.05.042 Antoine Abram , Mélodie Lapointe , Christophe Reutenauer
中文翻译:
重印:Palindromization和Markoff三元组的构造
更新日期:2020-06-04
Theoretical Computer Science ( IF 1.1 ) Pub Date : 2020-06-04 , DOI: 10.1016/j.tcs.2020.05.042 Antoine Abram , Mélodie Lapointe , Christophe Reutenauer
The Markoff equation is the Diophantine equation . A solution is called a Markoff triple. We give a bijection between the free monoid on two letters and the set of Markoff triples, using the palindromization map of Aldo de Luca. In our construction, special Christoffel words appear, whose lengths are Markoff numbers; we study their standard and palindromic factorizations, and show that they are self-dual.
中文翻译:
重印:Palindromization和Markoff三元组的构造
Markoff方程是Diophantine方程 。一个解决方案称为Markoff三元组。我们使用阿尔多·德·卢卡(Aldo de Luca)的古板化图,给出了两个字母上的自由半体像与Markoff三元组之间的双射。在我们的结构中,出现了特殊的Christoffel单词,其长度为Markoff数;我们研究了它们的标准和回文分解,并表明它们是自对偶的。