Papers › Farey Recursive Functions
Farey Recursive Functions
Eric Chesebro, Cory Emlen, Kenton Ke, Denise LaFontaine, Kelly McKinnie, Catherine Rigby
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
This paper introduces Farey Recursive Functions and investigates their basic properties. Farey Recursive Functions are a special type of recursive function from the rationals to a commutative ring. The recursion of these functions is organized by the Farey graph. They arise naturally in the study of 2-bridge knots and links.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections