AI 中文总结
本文研究任意实数D下Markov数树结构的模式，通过连续函数统一描述，证明编码函数在D<4凸、D=4直线、D>4凹，并推广计数估计、几何描述及McShane-Hines恒等式。
AI 中文摘要
方程 $x^2+y^2+z^2- x y z =D$ 的正整数解在 $D=0$ 时对应于重要的 Markov (Markoff) 数。从给定的解三元组出发，通过 Vieta 对合可以得到另外三个解，从而构成一个无限的解树。若从三个大于 $2$ 的实数出发，则得到穿孔环面上闭测地线的长度。本文研究任意实数 $D$ 下的这些树结构。一个连续函数（最初与同调上的范数相关）编码了每棵树上的所有数。本文以自包含的阐述方式，一般性地发展了该函数的性质，表明通常的 $D=0$ 情形是更宏大图景的一部分。编码函数图在 $D<4$ 时为凸的，在 $D=4$ 时为直线，在 $D>4$ 时为凹的。其他推论包括对所有 $D$ 的推广：树上数的计数估计、相应格点曲线几何的描述、唯一性条件以及 McShane 和 Hines 的恒等式。
英文摘要
Positive integer solutions to $x^2+y^2+z^2- x y z =D$ correspond to the important Markov (Markoff) numbers when $D=0$. 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 $2$ gives lengths of closed geodesics in a punctured torus. In this paper we study these tree structures for any real $D$. 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 $D=0$ case is part of a bigger picture. Encoding function graphs are shown to be convex for $D<4$, straight lines for $D=4$ and concave for $D>4$. Among other consequences are generalizations to all $D$ 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.
Comments49 pages, 18 figures
