betaFeedback

WorksMathematics

Three Properties of Markov–Hurwitz Equations

Abstract

We prove Laurent positivity for pure Markov–Hurwitz mutations, density-one uniqueness by the largest coordinate for positive integral solutions of the symmetric generalized equation, and labelled Vieta connectivity for the pure equation on points with at most one zero coordinate over sufficiently large prime fields.

Introduction

Markoff’s study of indefinite binary quadratic forms led to the equation

x2+y2+z2=3xyz.x^2 + y^2 + z^2 = 3xyz.

The positive integral solutions are generated from (1,1,1)(1,1,1) by permutations and Vieta involutions, such as z↦3xy−zz \mapsto3xy-z. In the theory of indefinite forms, the largest entry of a triple determines the corresponding normalized minimum above 1/31/3 [9, 12]. Hurwitz extended the descent to equations in arbitrarily many variables [8]. For the equation ∑i=1nxi2=a∏i=1nxi\sum_{i=1}^{n} x_i^2 = a\prod_{i=1}^{n} x_i, the involution in slot ii replaces xix_i by a∏j≠ixj−xia\prod_{j\ne i}x_j-x_i. The coefficient a=na=n gives the all-one solution. We study the associated rational recurrence, the multiplicity of the largest entry among integral solutions, and the graph of solutions over prime fields.

Laurent coefficients

With indeterminate initial coordinates, replacing one root by the other can be written as a division. For the pure equation the numerator is the sum of the squares of the other coordinates. A succession of such divisions can introduce intermediate denominators that are sums of monomials. Fomin and Zelevinsky proved that the final denominators are Laurent monomials, for this recurrence and more generally for a quadratic form with cross terms [6 Theorem 1.10]. Guéritaud obtained the Laurent property for a family with arbitrary square-free terms in the exchange polynomials and conjectured positivity of the Laurent coefficients [16 Proposition 11 and Conjecture 12]. His Theorem 1 proves the specialization with three variables and zero extra coefficients. Theorem 1 gives this specialization in every dimension. Its proof tracks matchings between factors of a conserved Laurent polynomial and subwords of the mutation sequence.

Multiplicity of the largest entry

Frobenius asked whether a positive Markoff triple, up to permutation, is determined by its largest entry [7]. Zagier proved an asymptotic of order (log⁡B)2(\log B)^2 for the number of sorted triples with largest entry at most BB [12]. This counts triples with their multiplicities over a largest entry. Chen’s density-one theorem shows that the repeated largest entries account for a vanishing proportion in the classical equation [5]. Tang extended the density statement to the symmetric three-variable equation with a nonnegative integral coefficient of the three pairwise products [18].

For pure Hurwitz equations, Baragar studied the growth of the number of solutions by height and established the growth exponent [2, 3]. Gamburd, Magee, and Ronan subsequently obtained a counting asymptotic in the nonexceptional orbits of the Markoff–Hurwitz varieties by comparing the dynamics in logarithmic coordinates with a linear renewal problem [15]. The analogous density-one statement for the pure equation with coefficient nn was published as a preprint in [10]. Theorem 2 proves density-one uniqueness in the family with a common nonnegative integral coefficient kk on the products omitting one variable. The proof reduces equal maxima to collisions on rational graphs of integer labels, then to common continuations of Vieta moves from two fixed seeds.

Prime-field graphs

Baragar asked whether the graph of nonzero Markoff triples over a prime field is connected [1]. Bourgain, Gamburd, and Sarnak showed that for large primes all but a small number of vertices lie in a single orbit [4]. Chen’s divisibility theorem rules out small orbits for the classical equation outside a finite set of primes [13]. Martin subsequently gave a proof of the needed divisibility using a weight whose values cancel under the three Vieta involutions [17].

In higher dimension Vyugin constructed a large component using cubic sections and an action allowing coordinate permutations and paired sign changes [11]. With only Vieta involutions as edges, a solution with two or more zero coordinates can only undergo sign changes. Such solutions obstruct connectivity on all nonzero points. Theorem 3 proves connectivity for fixed n≥4n \ge4 and all sufficiently large prime fields on the solutions having at most one zero coordinate. The argument joins the large orbits in the cubic sections, bounds the number of residual points independently of the dimension in the exponent of the prime, and applies a higher-dimensional version of Martin’s weighted congruence to rule out any residual orbit.

Laurent positivity for pure mutations

Theorem 1. Let n≥3n \ge3 and let x1,…,xnx_1,\ldots,x_n be algebraically independent. Starting with Xi=xiX_i=x_i, apply any finite sequence of replacements

Xi⟼∑j≠iXj2Xi,X_i \longmapsto\frac{\sum_{j\ne i}X_j^2}{X_i},

each of which fixes the other coordinates. Every resulting coordinate belongs to Z≥0[x1±1,…,xn±1]\mathbb{Z}_{\ge0}[x_1^{\pm1},\ldots,x_n^{\pm1}].

Proof. The replacements are involutions, so we work with words whose consecutive directions are distinct. Set wi=xi2w_i=x_i^2, Li=Xi/xiL_i=X_i/x_i, and ci=(∑jwj)/wic_i=(\sum_j w_j)/w_i. The invariant is the quotient of the sum of squares by the product of the coordinates. In fact, if Xi′=(∑j≠iXj2)/XiX_i'=(\sum_{j\ne i}X_j^2)/X_i, then

Xi2+∑j≠iXj2∏jXj=Xi+Xi′∏j≠iXj=(Xi′)2+∑j≠iXj2Xi′∏j≠iXj.\frac{X_i^2+\sum_{j\ne i}X_j^2}{\prod_j X_j} = \frac{X_i+X_i'}{\prod_{j\ne i}X_j} = \frac{(X_i')^2+\sum_{j\ne i}X_j^2}{X_i'\prod_{j\ne i}X_j}.

Equating this quotient with its value at the initial seed and dividing the resulting identity for Xi+Xi′X_i+X_i' by xix_i gives

Li′=ci∏j≠iLj−Li.(1)L_i'=c_i\prod_{j\ne i}L_j-L_i. \tag*{(1)}

In particular, the coordinates are integral Laurent polynomials in every seed, since the same recurrence can be started at any seed and the inverse replacements are of the same form. Each replacement and its inverse are rational, so the coordinates in every seed are algebraically independent and generate the initial rational function field.

Records and their words. Attach to each coordinate a record of rows, initially empty. Each row has a color in {1,…,n}\{1,\ldots,n\} and carries an interval ending at that row. At a replacement in direction ii, concatenate the other records in decreasing order of length, keeping their colors and intervals at the copied positions, and append a row of color ii. The interval ending at this row starts immediately after the end of the old ii-record. The current records form a chain of prefixes, because the new record extends the previous longest record, which belongs to a direction different from ii. The latest record is uniquely longest. If its length is dhd_h, then the sum of all current lengths is 2dh−12d_h-1: the new longest length is the sum of the unchanged lengths plus one. Thus at the next replacement in direction ii the appended interval has length 2(dh−di)2(d_h-d_i), where did_i is the old length in direction ii.

We assign to each interval a word with the same color multiplicities as the rows of the interval. Call a family coherent if the assigned words of any intersecting intervals differ somewhere in their intersection. A word on a record is allowed if it does not equal any assigned word on its interval. The normalized weight of a word on rows of colors a1,…,ama_1,\ldots,a_m is ∏v=1mwuv/wav\prod_{v=1}^{m} w_{u_v}/w_{a_v}, where uvu_v is its letter in row vv. A word is balanced if its normalized weight is 11. Empty words have weight 11.

A coherent assignment gives LiL_i as the sum of the weights of the allowed words. Indeed, the sum before imposing the newest interval restriction, called the raw sum, is ci∏j≠iLjc_i\prod_{j\ne i}L_j, since the appended row can carry any letter. If the new pattern is qq, the excluded words are precisely the allowed old ii-words followed by qq: coherence guarantees avoidance of each interval that meets qq, and the restrictions entirely in the prefix are exactly those of the old ii-record. Their sum is LiL_i, by balance. This proves the claim by (1). The same deletion rule applies to a suffix of a record when one retains only intervals contained in the suffix. If the new interval starts before the cut there is no deletion. We will construct the assignments inductively.

First activation. For a Laurent polynomial, its Newton polytope is the convex hull of its exponent vectors with nonzero coefficient. For weights on the seed coordinates, its support function is the maximum scalar product of a weight vector with an exponent vector. A subtraction-free expression for a nonzero Laurent polynomial has tropical evaluation equal to this support function, where multiplication adds weights, division subtracts them, and addition takes their maximum. Indeed, write the expression as P/QP/Q with P,QP,Q positive Laurent polynomials, and use the Minkowski sum identity for the Newton polytope of a product on P=(P/Q)QP=(P/Q)Q. The identity follows because the leading parts in every weight have nonzero product.

A changed coordinate cannot contain any initial coordinate as a monomial in its support. Otherwise the support function of the initial coordinate is bounded by that of the changed one for every seed weight. This inequality transports to the chart containing the changed coordinate, by tropical evaluation of the subtraction-free coordinate changes. In that chart the changed coordinate has singleton Newton polytope, so the initial coordinate is an integer multiple of it. In the initial chart the reciprocal multiple is also integral, and positivity on the positive torus makes both multiples 11. To see that the coordinates are distinct, evaluate the sequence at the all-one initial point. The first replacement gives n−1>1n-1>1. Every subsequent replacement changes a coordinate strictly smaller than the unique largest one, say XhX_h. The new value is at least Xh2/Xi>XhX_h^2/X_i>X_h, so it becomes strictly largest. Each coordinate that has been replaced therefore has value greater than 11.

When ii is first activated, the raw sum is 1+Li′1+L'_i, whose constant coefficient is 11 by the preceding support argument applied to the initial monomial xix_i in Xi′X'_i. Thus there is exactly one balanced allowed word on the raw record. The new interval is the entire record, so assigning that word gives coherence.

A fresh letter and the first crossing of a cut. In a coherent history, add one coordinate of a new color aa and leave it unchanged throughout the history. In dimension n+1n+1 the additional record remains empty. Thus the records and patterns in the other directions are unchanged, while allowed words may now use the new letter. The old patterns are coherent on this larger alphabet, and the first-activation argument shows that the concatenation of the current records and a free last letter has a unique balanced allowed word when the last row has color aa. The count is independent of the order of the blocks. Write ZrZ_r for the part in record rr. The word contains exactly one aa.

Under a known coherent replacement in direction jj, with new pattern qjq_j, let HH be the old fresh word with its ZjZ_j block removed and the other blocks arranged in the order used in the new jj-record. The last free letter stays at the end. Then HH is allowed in the new record. In fact, if H=UqjH=Uq_j with UU an allowed old jj-word, then ZjUqjZ_jUq_j and UZjqjUZ_jq_j both occur in the old fresh language arranged with the jj-block first. They have the same content and are distinct because exactly one of ZjZ_j, UU contains aa. This also rules out the case of empty ZjZ_j. Hence HZjqjHZ_jq_j is the new fresh word, by balance and uniqueness. After the first replacement it begins with aa, and thereafter HH begins with the preceding longest block. Inductively only the latest block contains aa, at its first position. In particular a first-activation pattern begins with its own new color.

We record the behavior of the ordinary blocks ZrZ_r. By the rr-ray in a current seed we mean Xr=tX_r=t and the other coordinates equal to 11, with tt tending to infinity. Equivalently, its tropical weights are 11 at rr and 00 elsewhere. The weight of a word is the exponent of tt in the leading term of its normalized weight after pulling the ray back to the initial seed. On the fresh ray the raw first-activation sum is 1+(n/t2)1+(n/t^2) in dimension n+1n+1. Its top term 11 is represented by the unique balanced word, so each ZrZ_r is the unique leading word of its block.

In any open cone with a unique dominant coordinate, a reverse replacement at a different coordinate of degree RR, when the maximum degree is MM, gives degree 2M−R>M2M-R>M. Thus on a strict dominant cone a reduced reverse sequence whose first direction is different from the dominant coordinate has fixed max selectors and is invertible linear in the weights. A positive word sum whose support function is linear on the image of such an open cone has a single leading exponent throughout it. The reverse evaluations have leading coefficient 11 because each exchange has a unique largest summand. Hence in an allowed-word sum the leading exponent is represented by a single word. Dividing an actual coordinate by its initial variable shifts every weight by the same amount.

Let hh be the latest direction and j≠hj\ne h the next one. Undoing hh on either the fresh ray or the old jj-ray puts the weights in the same strict hh-dominant cone. For all r≠hr\ne h the coordinate is unchanged in this step. The inverse cone argument shows that ZrZ_r is the unique leading word of its record on the old jj-ray. On undoing jj from the new fresh ray, the old jj-weight is 22, the fresh weight is 11, and the other weights are 00. This lies in the same strict jj-dominant cone as the old jj-ray, so for r≠jr\ne j the new fresh block is the old jj-ray leading word. Consequently the blocks ZrZ_r with r∉{h,j}r\notin\{h,j\} are unchanged by the replacement. The new block ZhZ_h is the unique leading word of the old longest record on the old jj-ray. From HZjqjHZ_jq_j it is the prefix of length dhd_h of ZjqjZ_jq_j.

References

  1. [1]A. Baragar, The Markoff equation and equations of Hurwitz, Ph.D. thesis, Brown University, 1991.
  2. [2]A. Baragar, Asymptotic growth of Markoff–Hurwitz numbers, Compos. Math. 94 (1994), 1–18.
  3. [3]A. Baragar, The exponent form the Markoff–Hurwitz equations, Pacific J. Math. 182 (1998), 1–21.DOI
  4. [4]J. Bourgain, A. Gamburd, and P. Sarnak, Markoff triples and strong approximation, C. R. Math. Acad. Sci. Paris 354 (2016), 131–135.arxiv.org/abs/1505.06411
  5. [5]W. Y. Chen, Almost all Markoff numbers are unique, Hexagon preprint 2610.00281v2 (2026).
  6. [6]S. Fomin and A. Zelevinsky, The Laurent phenomenon, Adv. Appl. Math. 28 (2002), 119–144.
  7. [7]G. Frobenius, Über die Markoffschen Zahlen, Sitzungsber. Preuss. Akad. Wiss. (1913), 458–487.
  8. [8]A. Hurwitz, Über eine Aufgabe der unbestimmten Analysis, Arch. Math. Phys. (3) 11 (1907), 185–196.
  9. [9]A. Markoff, Sur les formes quadratiques binaires indéfinies, Math. Ann. 15 (1879), 381–406, and 17 (1880), 379–399.DOI
  10. [10]Q. Tang, Density-one uniqueness for Markoff–Hurwitz solutions, Hexagon preprint 2611.00490v1 (2026).
  11. [11]I. V. Vyugin, On the structure of solutions graph of the Markoff–Hurwitz equation and recurrence sequences, arXiv:2509.19289v1.
  12. [12]D. Zagier, On the number of Markoff numbers below a given bound, Math. Comp. 39 (1982), 709–723.DOI
  13. [13]W. Y. Chen, Nonabelian level structures, Nielsen equivalence, and Markoff triples, Ann. of Math. (2) 199 (2024), 301–443.arxiv.org/abs/2011.12940
  14. [14]P. Corvaja and U. Zannier, Greatest common divisors of u − 1, v − 1 in positive characteristic and rational points on curves over finite fields, J. Eur. Math. Soc. 15 (2013), 1927–1942.DOI
  15. [15]A. Gamburd, M. Magee, and R. Ronan, An asymptotic formula for integer points on Markoff–Hurwitz varieties, Ann. of Math. (2) 190 (2019), 751–809.arxiv.org/abs/1603.06267
  16. [16]F. Guéritaud, Formal Markoff maps are positive, arXiv:math/0605735.
  17. [17]D. E. Martin, A new proof of Chen’s theorem for Markoff graphs, Invent. Math. 241 (2025), 623–626, doi:10.1007/s00222-025-03146-9.arxiv.org/abs/2502.15960
  18. [18]Q. Tang, Almost all k-Markov numbers are unique, Hexagon preprint 2611.00216v1 (2026).
  19. [19]Y. Benoist, Arithmeticity of discrete subgroups, lecture notes, author’s version.
  20. [20]B. Bekka, P. de la Harpe, and A. Valette, Kazhdan’s Property (T), New Mathematical Monographs 11, Cambridge University Press, 2008.
  21. [21]E. Breuillard, A non concentration estimate for random matrix products, author’s version.
  22. [22]F. Comets, R. Fernández, and P. A. Ferrari, Processes with long memory: regenerative construction and perfect simulation, Ann. Appl. Probab. 12 (2002), 921–943.DOI
  23. [23]J. Li, Fourier decay, renewal theorem and spectral gaps for random walks on split semisimple Lie groups, Ann. Sci. Éc. Norm. Supér. (4) 55 (2022), 1613–1686; arXiv:1811.06484v2.
  24. [24]B. Poonen, p-adic interpolation of iterates, Bull. Lond. Math. Soc. 46 (2014), 525–527.DOI
  25. [25]A. J. Hoffman, An approximate solutions of systems of linear inequalities, J. Research Nat. Bur. Standards 49 (1952), 263–265.

Paper details

vlnc:W_mbtfsfhd
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Not recorded for this paper

View statement
Looking for related papers…
Contents