Patterns in the Markov numbers and their generalizations
arXiv:2609.14149
Abstract
Positive integer solutions to correspond to the important Markov (Markoff) numbers when . From a given solution triple, three more are found with Vieta involutions, making an infinite tree of solutions. Starting instead with three real numbers greater than gives lengths of closed geodesics in a punctured torus. In this paper we study these tree structures for any real . A continuous function, originally related to a norm on homology, encodes all the numbers on each of these trees. The properties of this function are developed here in general, with a self-contained exposition, showing that the usual case is part of a bigger picture. Encoding function graphs are shown to be convex for , straight lines for and concave for . Among other consequences are generalizations to all of: estimates for counting numbers on these trees, descriptions of the geometry of the corresponding lattice curves, uniqueness conditions, and identities of McShane and Hines.
49 pages, 18 figures