Christoffel Words and the Calkin-Wilf Tree
-
Published:2011-10-17
Issue:2
Volume:18
Page:
-
ISSN:1077-8926
-
Container-title:The Electronic Journal of Combinatorics
-
language:
-
Short-container-title:Electron. J. Combin.
Author:
De Luca Alessandro,Reutenauer Christophe
Abstract
In this note we present some results on the Calkin-Wilf tree of irreducible fractions, giving an insight on the duality relating it to the Stern-Brocot tree, and proving noncommutative versions of known results relating labels of the Calkin-Wilf trees to hyperbinary expansions of positive integers. The main tool is the Christoffel tree introduced in a paper by Berstel and de Luca.
Publisher
The Electronic Journal of Combinatorics
Subject
Computational Theory and Mathematics,Geometry and Topology,Theoretical Computer Science,Applied Mathematics,Discrete Mathematics and Combinatorics
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The (u,v)-Calkin–Wilf forest;International Journal of Number Theory;2016-05-10
2. Sturmian words and the Stern sequence;Theoretical Computer Science;2015-05