Christoffel words and the Calkin-Wilf tree

MaRDI QIDQ648414zbMATH OpenFDO

Authors Alessandro De Luca, Christophe Reutenauer

Publication date 22 November 2011

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL http://www.emis.de/journals/EJC/Volume_18/Abstracts/v18i2p22.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

Calkin-Wilf tree of irreducible fractions

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Review text

Summary: 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 the first author.

Recommendations

• Sturmian words and the Stern sequence
• Linking the Calkin-Wilf and Stern-Brocot trees
• Two further generalizations of the Calkin-Wilf tree
• The \((u,v)\)-Calkin-Wilf forest
• Two trees enumerating the positive rationals

Cited in

(9)

• Sturmian words and the Stern sequence
• The \((u,v)\)-Calkin-Wilf forest
• Two further generalizations of the Calkin-Wilf tree
• From Christoffel Words to Markoff Numbers
• On a graph connecting hyperbinary expansions
• The Characterization of Rational Numbers Belonging to a Minimal Path in the Stern-Brocot Tree According to a Second Order Balancedness
• Diophantine aspects of the Calkin-Wilf iteration
• Cluster duality between Calkin-Wilf tree and Stern-Brocot tree
• Palindrome partitions and the Calkin-Wilf tree

This page was built for publication: Christoffel words and the Calkin-Wilf tree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q648414)