Locating terms in the Stern-Brocot tree

DOI10.1016/J.EJC.2007.10.005zbMath1221.05037OpenAlexW1998328789MaRDI QIDQ966153

Martin W. Bunder, Bruce Bates, Keith P. Tognetti

Publication date: 27 April 2010

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2007.10.005

Mathematics Subject Classification ID

Trees (05C05)

Related Items (10)

BINARY SIGNED-DIGIT REPRESENTATIONS IN PAPERFOLDING ⋮ Stern-Brocot sequences from weighted mediants ⋮ Linear extension numbers of \(n\)-element posets ⋮ Construction and composition of rooted trees via descent functions ⋮ Unnamed Item ⋮ Child's addition in the Stern-Brocot tree ⋮ Counting the number of non-zero coefficients in rows of generalized Pascal triangles ⋮ Linking the Calkin-Wilf and Stern-Brocot trees ⋮ Counting Subwords Occurrences in Base-b Expansions ⋮ On the complexity of conversion between classic real number representations

Cites Work

• Unnamed Item
• Unnamed Item
• Admissible digit sets
• Exact arithmetic on the Stern-Brocot tree
• Recounting the Rationals
• FUNCTIONAL PEARL: Enumerating the rationals

This page was built for publication: Locating terms in the Stern-Brocot tree