Palindromization and construction of Markoff triples

Theoretical Computer Science(2020)

引用 11|浏览1
暂无评分
摘要
The Markoff equation is the Diophantine equation x2+y2+z2=3xyz. 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.
更多
查看译文
关键词
Iterated palindromization,Christoffel words,Markoff Numbers
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要