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 [ \left(\frac{F_k(4r)}{3F_k(2r)},\,F_k(\ell+2r),\,F_k(\ell+4r)\right), ] where $r$ is an odd integer, $\ell\in{1,2,\ldots, 2r}$ and $3\nmid k$. These branches are distributed among exactly $2r$ distinct trees.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.