A calculational approach to path-based properties of the Eisenstein-Stern and Stern-Brocot trees via matrix algebra

DOI10.1016/j.jlamp.2015.11.004zbMath1366.05025OpenAlexW2209779823WikidataQ114851589 ScholiaQ114851589MaRDI QIDQ2374307

Alexandra Mendes, João F. Ferreira

Publication date: 15 December 2016

Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jlamp.2015.11.004

zbMATH Keywords

rational numberStern-Brocot treecalculational methodEisenstein-Stern tree (aka Calkin-Wilf tree)Euclid's algorithmSierpiński's triangle

Mathematics Subject Classification ID

Trees (05C05) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A relation-algebraic approach to the ``Hoare logic of functional dependencies
• On Euclid's algorithm and elementary number theory
• Linking the Calkin-Wilf and Stern-Brocot trees
• Recounting the Rationals
• Recounting the Rationals: Twice!
• Designing an Algorithmic Proof of the Two-Squares Theorem
• The Bird Tree
• FUNCTIONAL PEARL: Enumerating the rationals

This page was built for publication: A calculational approach to path-based properties of the Eisenstein-Stern and Stern-Brocot trees via matrix algebra