Branches of Markoff m-triples with two k-Fibonacci components
Abstract
We study infinite paths of Markoff m-triples, that is, solutions to the generalised Markoff equation \[ x2+y2+z2=3xyz+m, \] with m>0, with at least two k-Fibonacci components. First, we obtain a complete classification of Markoff m-triples whose last two entries are k-Fibonacci numbers and that are not roots of any Markoff trees. We then prove that every such infinite path is contained in a branch, starting at a triple of the form \[ (Fk(4r)3Fk(2r),\,Fk(+2r),\,Fk(+4r)), \] where r is an odd integer, ∈\1,2,…, 2r\ and 3 k. These branches are distributed among exactly 2r distinct trees.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.