On the geometry behind a recurrent relation
Cristian Cobeli, Alexandru Zaharescu

TL;DR
This paper explores the algebraic and geometric properties of a specific linear recursive relation to estimate the number of valence chains in Farey series, linking recursive relations with geometric structures.
Contribution
It introduces a novel approach connecting recursive relations with geometric analysis to estimate valence chains in Farey series.
Findings
Derived bounds for the number of valence chains
Established geometric interpretations of the recursive relation
Provided algebraic insights into Farey series structures
Abstract
We consider a certain linear recursive relation with integer parameters and study some of its algebraic and geometric properties, with the purpose of estimating the number of chains of valences in the Farey series.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAnalytic Number Theory Research · Limits and Structures in Graph Theory · Advanced Algebra and Geometry
