Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Two algorithms for Farey tree

From MaRDI portal
Publication:3545980
Jump to:navigation, search

zbMATH Open1164.37330MaRDI QIDQ3545980FDOQ3545980


Authors: Ljubiša Kocić, Ljiljana Stefanovska Edit this on Wikidata


Publication date: 18 December 2008





Recommendations

  • Numerical Analysis and Its Applications
  • Fraction interpolation walking a Farey tree
  • Iterative operators for Farey tree
  • scientific article; zbMATH DE number 1247765
  • Moments for generalized Farey-Brocot partitions


Mathematics Subject Classification ID

Symbolic dynamics (37B10) Dynamical systems involving maps of trees and graphs (37E25) Computational methods for ergodic theory (approximation of invariant measures, computation of Lyapunov exponents, entropy, etc.) (37M25)



Cited In (8)

  • Representation and coding of rational pairs on a triangular tree and Diophantine approximation in \(\mathbb R^2\)
  • Fraction interpolation walking a Farey tree
  • Title not available (Why is that?)
  • Numerical Analysis and Its Applications
  • On the Farey sequence and its augmentation for applications to image analysis
  • On Farey table and its compression for space optimization with guaranteed error bounds
  • Iterative operators for Farey tree
  • Farey sequences and the planar Euclidean medial axis test mask





This page was built for publication: Two algorithms for Farey tree

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3545980&oldid=16932765"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 5 February 2024, at 01:12. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki