WorksMathematics
Hyperbolic Collision Invariants and Certified Odd-Even Tiers toward Markoff Unicity
Abstract
A collision would consist of two different ordered Markoff triples with the same largest entry . We derive arithmetic conditions that every such collision must satisfy. A parametrization by hyperbolic functions factors a classical determinant identity and leads to two coupled quadratic equations. If is odd, these equations require a factorization with and . Hand proofs and exact finite computations give increasingly strong bounds, ending with . If is even, division of the collision quantities by four gives the same inequalities for a coprime factorization of . These bounds yield explicit sufficient conditions for a Markoff number to be unique. The finite computations cover a proved search domain and apply necessary congruence and continued-fraction conditions. Two different arguments reject the final odd candidate: one uses continued fractions, and the other bounds the integer solutions of two quadratic equations of Pell type. Separately written programs reproduce the computations. The constants measure the strength of collision inequalities; they are not ranges through which Markoff numbers were checked. We identify the classical ingredients and the quantitative additions. Factorizations with increasingly comparable factors remain unresolved, so the general unicity conjecture is not proved.
Introduction
A Markoff triple is a positive integral solution of
The equation was introduced by Markoff [12]. An integer occurring in such a triple is a Markoff number. The unicity conjecture posed by Frobenius [10] asserts that a Markoff triple is determined, up to permutation, by its largest entry. The conjecture remains open. It is known for prime powers, twice prime powers, and several other arithmetic families; see [2, 3, 4, 11, 16, 6, 14, 1].
Throughout, an ordered occurrence with maximum means a triple with . An ordered collision is a pair of distinct such occurrences with the same maximum. We call unique when it has only one ordered occurrence, equivalently when its Markoff triple is determined up to permutation.
Reading guide and notation. The argument uses algebra, calculus, prime factorization, and congruences. A congruence means that . Integers are coprime when their greatest common divisor is one. A complete prime-power block of an integer is the factor containing its entire power of a prime . The notation records the exponent of in ; this is also called its -adic valuation. A quadratic residue is a residue that is a square modulo the stated prime.
The words packet, floor, and tier will have specific meanings here. A packet is one of the displayed quadratic equations together with its integer variables and divisibility conditions. A floor is a proved lower bound for a product of its coordinates. A tier is the resulting level of the collision bound. A relaxation keeps only some necessary conditions, so it may include tuples that do not come from Markoff triples. Excluding every tuple in this larger set also excludes actual collisions. We identify explicitly which steps use a finite computer calculation.
The hyperbolic functions need no background beyond exponentials: and . The notation means the natural logarithm. Later, a continued fraction means . Its digits are called partial quotients. Requiring the last digit to exceed one makes the finite expansion unique.
This paper studies the arithmetic forced by an ordered collision. Let and form an ordered collision. For odd , the central chain is
The first step supplies a geometric factorization and interpretation of Srinivasan’s identity. The direct verification of that identity and all later algebraic reductions use integers.
The following table separates each product floor from the coefficient it gives in the collision inequality.
For even maxima, dividing the collision quantities by four gives the following parallel bounds.
In the odd table, 120 is sharp for the local relaxation and 67137 is sharp after the companion-prime condition. In the even table, 72 and 1014 are sharp for their corresponding relaxations. In both parities, 100000 is a certified cutoff, with no claim of sharpness. None of these numbers is a range through which Markoff unity has merely been checked.
The factorization needed for the argument keeps every complete prime-power block on one side. This is expressed by a unitary divisor. A divisor is unitary, written , when . Define
The set is nonempty because it contains 1.
Theorem 1.1 (Main collision and unicity theorem). If an odd Markoff number admits an ordered collision, then there are coprime unitary factors , , for which
If an even Markoff number admits an ordered collision, then has coprime proper unitary factors , , satisfying the same bound (1.3). Consequently,
The corresponding weaker statements hold at every tier in Table 1 and Table 2, with their stated proof provenance.
| tier | defect floor | provenance | quartic consequence |
| 99 | 33 | hand proof | |
| 360 | 120 | exact local enumeration | |
| 201411 | 67137 | companion-prime certificate | |
| 300000 | 100000 | crossed-Pell/continuant certificates |
Table 1. The four certified odd tiers. The coefficient is three times the defect-product floor.
| tier | defect floor | provenance | quartic consequence |
| 216 | 72 | hand proof | |
| 3042 | 1014 | companion-prime certificate | |
| 300000 | 100000 | continuant-root certificate |
Table 2. The three certified tiers for even , after normalization by .
Corollary 1.2 (Prime-power tail). Let be an odd Markoff number, where is prime, , and . For any
the condition
guarantees that is unique, provided the tier with coefficient is invoked with its stated hand or computer-assisted provenance.
The odd collision assertion of Theorem 1.1 is proved in Theorem 6.10, and its even counterpart in Theorem 7.4. Their unicity implications are Theorems 8.1 and 8.2. Corollary 1.2 follows from Theorem 8.3 by taking a single prime-power tail.
Historical position and quantitative comparison
Classical partial results are usually formulated as arithmetic-shape criteria. Baragar proved unicity when one of , , is a prime, twice a prime, or four times a prime [2]. Button proved the prime case and later developed a principal-ideal and continued-fraction method [3, 4]; Lang and Tan gave an independent proof for prime powers [11]. On the companion side, Zhang proved unicity when one of is a prime power, four times a prime power, or eight times a prime power [16]. Chen and Chen subsequently treated for [6].
Srinivasan gave an elementary treatment of the prime-power and twice-prime-power cases and further criteria in terms of ambiguous classes and the prime divisors of [14]. More specifically, in the present sign convention, Srinivasan’s identity [14 Lemma 2.1] is exactly
that is, . Her analysis also contains the underlying coprime allocation of complete prime-power blocks produced by a hypothetical nonunique maximum [14 Theorem 5.1]. Thus neither the determinant identity itself nor, in substance, the existence of a proper unitary split is asserted here as new.
The companion-discriminant allocation formulated below likewise has a classical genus-theoretic antecedent. Srinivasan’s ambiguous-class analysis and Legendre-symbol criteria detect the same mutual quadratic-residue condition between complementary factors of [14 Theorems 5.4 and 6.1]. The elementary residual equation below is used as a bridge from the present collision variables to that condition; priority is not claimed for the unitary or residue obstruction. The additional bounded crossed-Pell reconstruction couples this residual allocation back to the primitive collision slope and supplies a second exact rejection of the final odd certificate row.
For even Markoff numbers, Zhang proved the congruence and companion-number criteria [16 Theorems 1–2]. Srinivasan’s treatment of twice prime powers already uses the determinant identity with its forced divisibility by , and her companion lemma states that every odd prime divisor of is [14 Theorem 2.2 and Lemma 4.2]. The even section below combines these antecedents with the complementary conics and an exact coefficient-6 enumeration; it does not claim priority for the congruence, the coprime splitting in substance, or the companion-prime condition.
Geometric reformulations also predate the present work. Tornero’s fixed- hyperbola
is exactly the conic used below [15]; a recent reformulation uses integral necklaces [9]. The narrower role of the hyperbolic viewpoint here is the closed-form parametrization and the explicit four-point factorization of the three terms in Srinivasan’s identity.
Recent related work. O’Sullivan gives geometric growth and approximation estimates for real Markov trees [17 Section 3 and Proposition 8.1]. Yasutomi proves injectivity for substitution parameters , , and a partial ordering result in the classical case , [18 Theorems 1.3 and 1.5(2)]. The full classical case is outside his injectivity theorem. Banaian extends Aigner’s ordering results to generalized -Markov numbers [19 Theorem 4]; Gyoda surveys the associated arithmetic, combinatorial, and geometric descriptions [20]. Our question is different: given a hypothetical classical collision, how large must each factor in its forced coprime split be? The quartic bounds in Theorem 1.1 address that question. They are not a replacement for these ordering or approximation results, and the proof does not depend on them.
Relation to the author’s prior preprint
The author’s preprint A slope–scale factorization for prime-power and twice-prime-power Markoff unicity (ResearchGate, 18 June 2026; https://doi.org/10.13140/RG.2.2.23525.56800) developed the parametrization, the identities, the collision line, the slope–scale formulas, the unitary allocation, and the coupled defect equations. The present article substantially extends and supersedes that preprint by isolating the complementary four-point conics and, principally, by establishing the four odd defect floors 33, 120, 67137, 100000, the normalized even floors 72, 1014, 100000, their unitary-gap consequences, the residual crossed-Pell reconstruction, and self-contained exact-arithmetic certificates. Claims of contribution below concern these quantitative extensions and their certificates, not the previously published or publicly circulated structural machinery.
The direct coefficient-1 antecedent of the present unitary-gap inequalities is Button’s unitary-factor criterion [4 Corollary 6]: an odd Markoff number is unique if every coprime factorization , , satisfies . In the notation of (2), this is equivalent to
because the possible smaller factors are precisely the unitary divisors below . Theorem 1.1 strengthens this coefficient-1 quartic gap to
Thus the strongest certificate raises the coefficient of in this particular collision obstruction from 1 to 300000, while retaining an exact positive additive term. For , the corresponding cubic comparison changes from the coefficient-1 condition to . At fixed , the final tier therefore expands the cofactor scale in this criterion by .
This is not a blanket improvement on every earlier arithmetic family. Button also recorded, using the then-reported computation through , the separate conclusion for with [2, 4]; that result and the companion-number criteria above are nonnested with the present estimate. Within the present collision framework, however, the progression
is a strict sequence of certified lower-bound improvements. From the hand tier to the final tier the quartic coefficient increases by , and the permitted -scale in Corollary 1.2 increases by at fixed . Against the antecedents above, the distinctive contribution of the present article is the quantitative strengthening: the explicit odd and normalized-even defect-product floors, their unitary-gap consequences, and transparent dual exact-arithmetic certificates, now including an independent residual crossed-Pell audit of the final odd row. The hyperbolic factorization is retained as a geometric interpretation and derivational bridge; it is not asserted as the first appearance of either the fixed conic or the identity .
The comparison with Button is strict at the level of sufficient unitary-gap criteria. The Markoff number does not satisfy Button’s condition , whereas it satisfies the coefficient-201411 criterion proved here; see Example 8.5. This is a genuine strengthening of that collision obstruction, not a claim that the uniqueness of 51641 was unknown by all other methods.
The odd and even collision sectors are both treated, but their certified inequalities still leave increasingly balanced unitary allocations. No result below proves the full unicity conjecture.
The fixed- conic and a hyperbolic factorization
Fix , and put
Thus , and if , then , . Define
Equivalently,
The curve parametrized below is precisely Tornero’s fixed- hyperbola [15 p. 596]. Tornero studies its integral points using the recurrence , whose characteristic roots are and . Here we use the corresponding continuous parametrization to place the two occurrences of an ordered collision on one real component and factor their four-point determinants.
Lemma 2.1 (Fixed- parametrization). For every real ,
The map parametrizes the entire branch with both coordinates positive, once each. The ordering holds precisely for . If is an ordered Markoff triple with maximal entry , then . On this interval the first coordinate increases and the second decreases.
Proof. Write . The addition formula gives
Consequently,
Expanding and using proves (2.3).
To show that no positive point is missed, let satisfy the conic with . Completing the square gives
Define , where is the inverse of . Then , since both sides are positive. Setting gives and . This also proves that the parameter is unique.
The function is even and increases with . Thus is equivalent to , or . If , then
because . Such a point cannot have maximum . If , the two smaller integer entries agree. Pairwise coprimality, proved independently in Lemma 3.3, makes both equal to 1. The equation then gives or . Hence requires .
Finally, on this interval, while . These signs prove the monotonicity assertions.
Let and form an ordered collision. After interchanging the two ordered occurrences if necessary, there are
such that
and hence
Define the three bilinear collision quantities
The next formulas explain why these three quantities are useful. Put
In the present sign convention, the identity (16) below is precisely Srinivasan’s Lemma 2.1 [14]. The following proposition supplies the additional four-point geometric factorization of its three factors.
Proposition 2.2 (Hyperbolic four-point factorization). The four-point determinants factor as
In particular,
Proof. The identity lets us subtract the products in pairs. It gives
and
Each product of two -values has the common factor . Multiplying these identities by that factor gives and .
For the third difference, the same product-to-sum identity gives
After multiplication by , this is . The first two formulas now multiply to .
Thus Proposition 2.2 gives a hyperbolic factorization of a known arithmetic identity. This factorization was the author’s original route to recognizing Srinivasan’s identity in the present notation. For later arithmetic use, we also record a direct integral verification.
Proposition 2.3 (Self-contained integral verification). If both and satisfy the Markoff equation, then
If
then also
Proof. Expand the product and collect the terms containing and :
The two Markoff equations give
On substitution, the two terms containing cancel. What remains is .
Next subtract the two Markoff equations. The terms cancel, leaving . Squaring gives . Replace one factor by to obtain .
The order (12) gives . In particular, after the displacement notation introduced below, and the other signs follow from the identities. The strict inequality follows from pairwise coprimality: would give a common divisor.
Collision line, slope-scale factorization, and unitary allocation
The slope–scale formulas and unitary allocation in this section were previously circulated in the author’s earlier slope–scale preprint (https://doi.org/10.13140/RG.2.2.23525.56800); they are reproduced here to make the quantitative argument self-contained.
Put
Then
Combining these with gives the collision line
Set
Equation (22) is equivalent to
Because and are coprime, a positive integer satisfies
Proposition 3.1 (Slope and scale identities). Every ordered collision satisfies
Proof. Solve (24) explicitly:
Use , , and the definitions of . Substitution gives
Since , we have . Dividing by the positive proves (26).
The same substitution into yields
Equate this expression to (26) and cancel . The result is
Rearranging and multiplying by , then using , gives (27).
We now reduce the slope. Write
and define
Equation (25) shows that , and all quotients below are positive. Let
Formula (26) becomes
Thus . Write
Lemma 3.2 (Scale divisor). If is odd, then .
Proof. It is enough to compare the exponent of each prime in and . Let . Because and is odd, is an odd divisor of . Thus .
We have
Both factors on the right of are divisible by . Write for the exponent of in a positive integer . Comparing exponents gives
Thus every prime occurs in to at least its exponent in , which proves .
We use two elementary facts about Markoff entries.
Lemma 3.3 (Coprimality and prime support). The entries of a Markoff triple are pairwise coprime. Every odd prime dividing a Markoff number is 1 (mod 4). In particular, 3 divides no Markoff number.
Proof. We first prove coprimality by descent. If a prime divides two entries of a Markoff triple, the equation forces it to divide the third. Order the entries as . Regarding the equation as a quadratic in its last entry gives the other integer root
For ,
unless . Since the leading coefficient is positive, places strictly between its two roots. The root is at least , so the other root satisfies .
Replacing by , and reordering, strictly decreases the maximum until . At that point the equation gives or 2; the triple also moves to . A prime dividing all three entries would remain a common divisor under every move, but it cannot divide the final triple. No such prime exists, proving pairwise coprimality.
Now let an odd prime divide an entry of . Coprimality allows division by modulo , giving
Thus is a square modulo . A square root of has multiplicative order four, so four divides the order of the nonzero residue group. Hence , which excludes .
Lemma 3.4 (No split prime). If an odd prime divides both and , then the ordered collision is impossible.
Proof. By pairwise coprimality, none of , , , is divisible by , so all four have inverses modulo . Put and . Dividing by gives ; dividing by gives . Together these imply .
The Markoff equation, divided by modulo , instead gives . This would imply , impossible for an odd prime.
Theorem 3.5 (Odd unitary collision allocation). If an odd Markoff number admits an ordered collision, then there are coprime integers and positive integers such that
Each of is a unitary divisor of .
Proof. Consider a complete prime-power factor of . Its square occurs in . If a positive power of occurred in both and , then and would give . Lemma 3.4 excludes this. Thus the entire power belongs to one of .
Doing this for every prime gives
Both factors exceed one. If , then , contradicting . If , then , contradicting .
Now . Also , so for an integer . Substitute these expressions in and cancel to obtain . The coprimality of is exactly the assertion that they are complementary unitary divisors. □
Remark 3.6. Proper coprime factorizations of a hypothetical nonunique maximum underlie Srinivasan’s Theorem 5.1 and Button’s Corollary 6 [14, 4]. Theorem 3.5 records the exact allocation to in the notation required for the defect packets.
Complementary hyperbolic factors and the defect packets
The coupled defect equations below were also circulated in the author’s earlier slope–scale preprint (https://doi.org/10.13140/RG.2.2.23525.56800); they are reproved here from the complementary four-point conics in the form required by the certified tiers.
The same four hyperbolic points used to factor produce the two equations on which all four odd tiers rest. Define
Along with from (14), put
Then , , and .
Lemma 4.1 (Complementary four-point conics). One has
and, for ,
Consequently,
Proof. We make the two product calculations explicit. Using and , we obtain
The corresponding identity for the other factor is
Multiplication by proves and . Both are positive because .
For the conic, the addition formula for gives
Take , , so . Multiply by and use , . This proves (36). The pairs and each sum to one. Substituting them and multiplying by proves (37) and (38).
Theorem 4.2 (Coupled defect packets). For every hypothetical odd collision there are positive integers such that
Moreover,
Proof. First we show that the complementary factors have the required square divisors. Let , and suppose . In (37), the term has exponent . The exponents of and are at least , and that of is at least .
This is impossible: dividing the equation by and reducing modulo would leave exactly one nonzero term. Hence . For every prime of , this proves . The identical argument with proves . Write
Substitute these and (32) into the two conics. Dividing the first by gives (40); dividing the second by gives (39). The integers are positive because the complementary factors are positive.
If a prime divided both and , it would divide both and , contrary to Lemma 3.4. Thus ; the same reasoning gives . A prime dividing would, by (39), also divide , hence , which is impossible. This proves . Applying the same argument to the other equation proves .
The quadratic equations also have a useful interpretation through conjugate numbers. In the ring of numbers of the form , with , namely the real quadratic order
one has
Thus (39)–(40) are norm equations of fourth powers. Here the norm is the product obtained by replacing the square root by each of its two signs. This interpretation provides context; the bounds below use only the displayed integer equations.
The hand tier: 33 and 99
Abstract one defect equation as
For a collision packet, either
By Theorem 3.5, Lemma 3.3, and (41), the local block conditions are
Proof. Reduce (42) modulo 3. Since , it gives . The only square residues are zero and one, so exactly one of is divisible by 3. In particular, . Reduction modulo also gives .
Suppose , and use symmetry to take . Listing the coprime factor pairs of the positive multiples of three below 33 gives
Because is odd, . Every integer whose prime divisors are is itself , so must have residue , or modulo 16. For each listed pair, test these four residues in the equation, and then list the divisors of having the required prime divisors. The surviving six choices are
| 82 | 41 | |
| 442 | 13, 17, 221 | |
| 58 | 29 | |
| 73 | 73 |
Table 6.
For each choice, the equation determines :
In the same order, these values are
The first five are not integers. The last is divisible by three, which the block conditions exclude. Thus every possible pair below 33 is rejected.
Theorem 5.2 (Hand quartic tier). Every hypothetical odd collision satisfies
It also satisfies the strict cubic imbalance
Proof. Each of the two collision packets satisfies the hypotheses of Lemma 5.1. Therefore and . The inequality gives , so either packet yields
This proves both quartic inequalities. For the first cubic inequality, use the strictly positive square terms to get
Divide by to obtain . Exchanging the two packets gives .
The exact finite certificate and the other three tiers
The finite reduction follows directly from (45). Fix a positive integer upper product bound . By symmetry take . There are finitely many pairs ; for each pair, must be a divisor of , and then is forced by (45). More explicitly, and . Listing those pairs, all divisors , and each forced covers the entire range. Thus no bound on or is guessed.
The primary certificate executes the following exact loop.
Listing 1: Core finite reduction (schematic).
for x <= y with lower <= x*y < upper:
reject unless exactly one of x,y is divisible by 3
for T in divisors(x*x + y*y):
reject unless T is an admissible block
O = (T**3 - (x*x+y*y)//T) / (3*x*y)
retain only integral O>1 with gcd(T,O)=1
retain only admissible O
The submitted source uses explicit failure checks rather than Python assert, so optimization flags cannot disable verification. It deliberately searches the larger domain in which is not imposed; eliminating every point in this superset proves the required claim. A second program, written separately and runnable on its own, orders the search by the product , enumerates the factor pairs of , and reimplements every arithmetic routine without importing the primary program. The primary program’s --mode both option is an internal product-order cross-check that reuses its arithmetic helpers; it is not the standalone verifier.
The local floor 120 and coefficient 360
The exact search over leaves no admissible row. Before the final prime-support test on , the sole row is
and both prime factors are . At the boundary,
satisfies the equation and all local block conditions. Hence 120 is sharp for this relaxation.
Proposition 6.1 (Local exact tier). Every hypothetical odd collision satisfies
Proof. Lemma 5.1 already excludes . The finite search described above covers every pair with , every possible divisor , and the resulting forced value of . It leaves no admissible row, even though its search domain is larger than the collision domain. Thus each collision packet must have .
Apply this conclusion to and . In each equation, then gives
This is a computer-assisted step: the proved finite reduction and its exact exhaustive certificate together establish the product floor.
The companion-prime filter and coefficient 201411
The next filter is an automatic property of a genuine Markoff entry.
Lemma 6.2 (Companion-prime necessity). If is a Markoff number, every odd prime divisor of is .
Proof. Rearranging the Markoff equation gives two sum-of-squares identities:
Let an odd prime divide either companion or . It cannot divide , since that would also force . Reduce the corresponding identity modulo and divide by . It shows that is a square modulo . As in Lemma 3.3, this forces .
The intentionally enlarged enumeration for has nineteen rows, listed in Table 3. Eighteen satisfy ; the row with has and is retained to make the superset search explicit. Of all nineteen rows, eighteen contain a displayed prime dividing a companion or . The sole companion-admissible row is
Table 3: All survivors in the intentionally enlarged domain with . Eighteen have . The last column records a domain or companion obstruction; RP/CF denotes the sole row passed to, and then rejected independently by, the residual crossed-Pell and continued-fraction filters.
| obstruction | |||||
| 120 | 5 | 24 | 601 | 603005 | |
| 624 | 16 | 39 | 1777 | 2997481 | |
| 7161 | 31 | 231 | 173 | 241 | |
| 8601 | 1 | 8601 | 377 | 2069 | |
| 9189 | 9 | 1021 | 101 | 37 | |
| 10080 | 1 | 10080 | 269513 | 647377152493 | |
| 10512 | 9 | 1168 | 9409 | 26413369 | |
| 26145 | 9 | 2905 | 19093 | 88738609 | |
| 41496 | 56 | 741 | 552217 | 1352701049849 | |
| 41565 | 15 | 2771 | 197 | 61 | |
| 42837 | 1 | 42837 | 141481 | 22037080561 | |
| 43557 | 3 | 14519 | 6305 | 1918121 | |
| 48960 | 9 | 5440 | 163501 | 29757646189 | |
| 49749 | 23 | 2163 | 137 | 17 | |
| 67137 | 23 | 2919 | 1145 | 7453 | RP/CF |
| 68880 | 41 | 1680 | 2824081 | 108997629688121 | |
| 74520 | 5 | 14904 | 1073 | 5525 | |
| 75000 | 125 | 600 | 3005 | 120601 | ; also |
| 93093 | 3 | 31031 | 2305 | 43849 |
Table 3. All survivors in the intentionally enlarged domain with .
It proves sharpness at 67137 for the local-plus-companion relaxation.
Proposition 6.3 (Companion exact tier). Every hypothetical odd collision satisfies
Proof. For each packet, the product is the actual common maximum . Lemma 6.2 therefore supplies a necessary condition on both of its companions. The local tier already excludes products below 120. In the complete table for , every row with fails that necessary companion condition.
Hence both packets satisfy . Using once more gives
The conclusion uses the exact finite enumeration; no assumption that an arbitrary surviving row is a Markoff collision is made.
Residual companion allocation and a crossed Pell-type equation
The slope and scale formulas also divide the companion discriminant into coprime factors. The word discriminant here refers to the square-root expression arising from the quadratic equation; we will use its explicit value. Put
Proposition 6.4 (Residual companion allocation). For every hypothetical odd collision,
and is a unitary divisor of . More precisely, put
Then
Furthermore,
If
then
Thus the residual data , , , are determined by the ordered packet , with .
Proof. We first identify the common divisor in the slope formulas. Since and , write , where . At least one of , is odd, because is odd and the coprime integers , cannot both be even. Thus is odd. The identities
show that , and then . Hence .
For the reverse divisibility, is odd for either possible parity pattern of , so is odd. Also : a prime dividing and one slope coordinate would divide the other by . The last two displayed identities therefore allow cancellation of modulo , giving . Thus and .
Next, direct linear combinations give
Both left sides are divisible by . Since are coprime, an integer combination of them is one, so . As is odd, . In particular, .
Use and in the formula for :
Cancel to obtain . Substitute these same quantities into (3.8). Cancellation gives
Writing and dividing by proves (55).
If a prime divided both , that equation would force it to divide . It is odd and coprime to , a contradiction. Hence the allocation is unitary. The same reduction modulo a common prime of , or of , proves the remaining coprimalities.
Finally, complete the square in the first defect equation:
The right side exceeds , so , and
The residual equation and give the same product as
The function increases strictly for . Its two positive inputs must therefore agree: . Since and , taking a greatest common divisor gives . Thus the packet determines , then , then , and finally .
Remark 6.5 (Relation with the principal-genus obstruction). For every prime , equation (6.8) shows that is a quadratic residue modulo ; for every , it shows that is a quadratic residue modulo . By Lemma 6.2, all these primes are , so the second condition may equivalently be stated with in place of . These are the quadratic-residue conditions, written using Legendre symbols, occurring in Srinivasan’s principal-genus method [14 Theorem 5.1, Definition 3.1, and Theorems 5.4 and 6.1]; no priority is claimed for this residue obstruction. The additional ingredient below is its simultaneous coupling to the primitive collision slope.
Factor the two coprime companions according to the residual allocation:
The bars in this notation denote complementary integer factors, not complex conjugates. Here and . The allocation is unitary within each companion.
Theorem 6.6 (Crossed slope equation). For every hypothetical odd collision there are positive integers such that
and
The positive solution satisfies the following collision inequalities
Moreover,
Proof. Put and ; both are positive. From , we get
The odd numbers and are coprime: a common divisor would divide four. Thus is coprime to , and is coprime to . Cancellation gives and . Write , , with .
Since and ,
Also , so . Coprimality of implies . Dividing by the odd numbers cannot introduce a common prime and cannot remove their common factor two. Thus .
Now expand in terms of :
Substitute the four companion factors and , , then divide by . This proves (6.16). The first inequality in (6.17) is . The second follows from
To prove that the companion split is proper, use the original ordering:
In particular, . If , then , and (6.8), with , gives
But for , a contradiction. Thus . Also
and . These prove the two proper-factor bounds. They exclude as well.
The second packet also recovers the primitive slope. This removes an otherwise possible ambiguity about which packet realizes a row of the finite certificate.
Lemma 6.7 (Slope reconstruction from the second packet). For every hypothetical odd collision,
Consequently, if
then
Thus determines , , and hence and .
Proof. The identity , divided by , gives
For the other formula, substitute (24) into the definition of . Recall that , , and . Expansion yields
The second equality uses (59); the third uses (55). Since , cancellation gives .
The two quantities and are therefore the coprime integers , multiplied by the same integer . Their greatest common divisor is exactly this multiplier, giving all formulas in (68).
Proposition 6.8 (Residual rejection of the exceptional odd row). The certificate row
cannot be either packet of an odd ordered collision, in either ordering of its two defect coordinates.
Proof. The row forces . Its two companions factor as
with four distinct prime factors. There are four cases: either packet can give the row, and its two positive coordinates can occur in either order. We reduce all four cases to the same two equations.
If the row is the first packet, then and . Apply the greatest-common-divisor extraction in Proposition 6.4:
Table 7.
For these companion allocations, Theorem 6.6 gives, respectively,
where , , and .
If the row is the second packet, then and . The slope reconstruction of Lemma 6.7 gives
Table 8.
The corresponding complementary divisors are and . Therefore the residual equation (55) is again (71) or (72), now with . Since , we have . All four cases have the same stated bounds.
It remains to exclude positive solutions of these two equations. Put , and write either equation as . In both cases . Since ,
Multiply by and use . This gives the finite bound
For the first equation,
so . Reducing that equation modulo , and inverting modulo , gives
Its four roots between zero and are
None lies in , so this case is impossible.
For the second equation,
so . Reduction modulo gives
Its four roots in the standard residue interval are
Again none is small enough. Each root list is complete because each of its two distinct odd prime moduli has exactly two roots, and the Chinese remainder theorem combines their four choices into exactly four residues. The supplementary programs verify the prime factors, all four residues, and the finite bounds independently.
An independent continuant filter and coefficient 300000
Proposition 6.8 already eliminates the sole odd companion-admissible row below 100000. We retain the following different necessary test as an independent audit of that rejection and because the even 100000 tier uses it. We use only a necessary part of the classical Cohn–Christoffel description of a Markoff occurrence [7, 8, 13]; the precise finite continued-fraction form needed here is supplied by [5 Theorem 4.1].
Lemma 6.9 (Canonical continuant necessity). For every occurrence of a Markoff number , there is an integer satisfying
such that every partial quotient of the canonical finite regular continued fraction of (whose last partial quotient is greater than 1) belongs to .
Proof. The Markoff-tree construction assigns a reduced slope to each ordered occurrence with . Theorem 4.1 of Çanakçı and Schiffler [5] gives that occurrence an even palindrome of continued-fraction digits
Call the digits . Each matrix associated with a digit is symmetric. Transposing their product reverses the digits, and the palindrome leaves the product unchanged. The continued-fraction matrix is therefore
Each factor has determinant . The number of factors is even, so , proving .
The usual matrix rule for a continued fraction gives
Its last digit is , so it is the canonical finite expansion. Its first digit is also two, and the tail is strictly greater than one. Hence , or . Every digit is one or two, as required.
For the exceptional row (51),
and
All four displayed factors are primes congruent to 1 (mod 4). The four prime factors of give sixteen CRT roots of . Exactly three lie in :
Their continued fractions are
Each contains a digit larger than 2, so Lemma 6.9 rejects the last row. The exact enumeration has no other companion-admissible row below 100000. This continuant rejection is independent of the residual crossed-Pell rejection above.
Theorem 6.10 (Final odd exact tier). Every hypothetical odd collision satisfies
Proof. Each collision packet satisfies the local block conditions (43) and the companion condition of Lemma 6.2. The hand and local arguments exclude products below 120. In the complete enlarged-domain enumeration for , only the row (51) passes the companion test.
Proposition 6.8 excludes that row for either packet and either coordinate order. There is also an independent rejection: Lemma 6.9 requires a root with only one and two as continued-fraction digits, and the three displayed possible roots all fail this test. Thus no collision packet can have product below 100000.
Apply the resulting floor to each defect equation:
These are the claimed inequalities for and .
Remark 6.11 (Nested status). The 99 tier is fully hand proved. The 360, 201411, and 300000 tiers are computer-assisted theorems based on an exact finite reduction. The 201411 tier is not conditional for actual odd Markoff collisions: Lemma 6.2 makes its added hypothesis automatic. The final row has two independent exact rejections: the residual crossed-Pell test and the canonical-continuant test. Each is a necessary condition for an actual collision or occurrence in the role where it is used. The tiers are retained separately to expose exactly where each gain enters.
Even normalization and three certified tiers
The preceding unitary allocation was stated for odd maxima because the prime 2 cannot be inserted into Lemma 3.4. The even case is nevertheless accessible after a forced normalization by 4. The congruence used below is classical [16 Theorem 1]; we include the short derivation needed for the packet construction.
Lemma 7.1 (Parity of an even maximum). Let be an even Markoff number and write . Then
In every occurrence , the entries are .
Proof. Pairwise coprimality makes odd. If , reducing the Markoff equation modulo four would give , which is false. Thus with odd.
Every odd prime dividing an entry is , by Lemma 3.3. It follows that , including when one of them is one. Write
Substitute these expressions in and reduce modulo 32. The result is
Both and are even, so the first term vanishes modulo 32. Hence , or . Therefore , and doubling gives .
For an even ordered collision, put
These are integers. Indeed, all four smaller entries are 1 (mod 4), so the definitions of give ; and, since ,
with the same calculation for . Dividing the determinant identity and the complementary conics by 16 gives
Theorem 7.2 (Normalized even collision allocation). If an even Markoff number admits an ordered collision, then there are coprime proper unitary factors of and positive integers such that
and
Moreover,
and
Proof. We allocate each complete prime-power factor of to one side of the normalized identity. Let . The prime is odd. Lemma 3.4 says it cannot divide both and . Comparing prime exponents in (7.3) gives
One exponent on the left is zero, so the other is at least . Allocate to if its square divides , and to if its square divides . This gives
and the normalized identity then gives .
The factors are proper. If , then , whereas . This is impossible. If , the same argument applies to . Multiplying the normalized quantities by four proves (7.6).
For a prime block , suppose . In (7.4), the term has exponent . The exponents of and are at least , and that of is at least . All exceed . Division by would leave one nonzero term modulo , a contradiction. Hence . The other conic gives . Write , .
Substitution in the normalized conics, followed by division by and , gives the two defect equations. If a prime divided , , or , , it would divide both , which is excluded. Finally, a prime dividing both coordinates of the first defect equation would divide , contradicting . The other equation proves in the same way.
Combining Zhang’s 2-adic congruence with Srinivasan’s determinant splitting thus gives the normalized packet above. The underlying coprime factorization and the twice-prime-power consequence are not asserted as new [14]. To the best of our knowledge, the coefficient- packet and the explicit floors below have not previously been recorded.
Abstract either defect equation as
where are coprime, neither is divisible by 3, every prime dividing is , and .
Lemma 7.3 (The sharp local floor 72). Every solution of (7.11) satisfying these block conditions has . The value 72 is sharp for this local relaxation.
Proof. Reduction modulo three shows that exactly one of is divisible by three. Since and , reduction modulo 16 gives
Take . Under , the coprime pairs satisfying these two congruence conditions are exactly
For each pair, the equation forces and
List the divisors having only prime divisors , and substitute each in this formula. The only integer values are the following; every one fails a block condition.
| obstruction | ||||
| 1 | 18 | 325 | 317853 | |
| 1 | 24 | 577 | 1334028 | |
| 1 | 42 | 1765 | 21818937 | |
| 1 | 48 | 2305 | 42522648 | |
| 1 | 66 | 4357 | 208865877 | |
| 2 | 3 | 13 | 61 | |
| 3 | 4 | 25 | 217 | |
| 5 | 6 | 61 | 1261 | |
| 6 | 7 | 85 | 2437 |
Thus is impossible. To check sharpness for the stated local conditions, take
The number 7057 is prime and ; the two blocks are coprime and have product . Moreover,
Multiplying the second identity by 145 verifies the defect equation. This admissible local row has product 72, proving sharpness for the relaxation.
The separate even certificate enumerates the intentionally enlarged domain twice, first by pairs and then by products. It retains 65 local rows, of which 63 satisfy . Applying Lemma 6.2 to the actual candidate maximum leaves exactly four primitive rows:
| 1014 | 3 | 338 | 61 | 37 | 4514 |
| 7140 | 84 | 85 | 14281 | 67987081 | 1941847007522 |
| 74256 | 272 | 273 | 148513 | 7352086561 | 2183760862867586 |
| 96624 | 9 | 10736 | 613 | 397 | 486722 |
Table 7.14.
Since , one has ; hence the odd-prime companion test is equivalently applied to . The first row proves sharpness for that relaxation: with ,
so all odd companion primes are .
The canonical test of Lemma 6.9 uses the even maximum , not the half-maximum. For , the interval roots are 1597, 1819, with continued fractions
The middle two rows in (7.14) have no root of in . For , the interval roots are 191291, 193673, with continued fractions
Every displayed expansion has a digit greater than 2. Thus all four rows fail the canonical-continuant necessity.
Theorem 7.4 (Certified even tiers). Every hypothetical even collision satisfies the hand tier
The exact companion-prime certificate strengthens this to
and the canonical-continuant certificate gives
The floors 72 and 1014 are sharp for their stated relaxations; 100000 is a certified cutoff, not a sharpness claim.
Proof. Each packet in Theorem 7.2 has or , with actual maximum . Lemma 7.3 gives the hand floor . In the complete search above this floor and below 100000, the companion filter leaves exactly the four displayed rows, whose smallest product is 1014. Thus the necessary companion condition improves the floor to 1014.
The continued-fraction condition must be applied modulo the full maximum . Two of those four rows have no root in its required interval, and the other two have only the displayed continued fractions, each containing a digit above two. Thus none is a Markoff occurrence, and the final floor is 100000.
For each established floor , either packet satisfies
Substituting gives the three claimed quartic bounds. The rows at products 72 and 1014 prove sharpness only for their specified relaxations; no row establishes sharpness at 100000. □
Remark 7.5 (Provenance of the even tiers). The 72 tier is proved entirely in the article. The 1014 and 100000 tiers are computer-assisted theorems certified by two separately implemented exact-integer traversals supplied in the supplementary archive. The companion and canonical filters are necessary for every actual Markoff occurrence by Lemmas 6.2 and 6.9.
Intrinsic unitary-gap and tail consequences
For the odd case, it is useful to state all four tiers at once. Let be one of
and put . The corresponding tier says
Theorem 8.1 (Intrinsic unitary-gap criterion). Let be an odd Markoff number. At any certified coefficient ,
Proof. The maximum has the single ordered occurrence . For , suppose a collision existed and set in Theorem 3.5. This is a unitary divisor of and satisfies , so it belongs to the set defining . Hence .
The chosen collision tier gives . Together with the assumed inequality, this would give
a contradiction. Thus no collision exists.
Theorem 8.2 (Even intrinsic unitary-gap criterion). Let be an even Markoff number and put . At any certified even coefficient
with respectively hand, companion-certificate, and continuant-certificate provenance,
Proof. Suppose a collision existed. Theorem 7.2 gives a unitary split . Its smaller factor is a unitary divisor at most , so .
The chosen tier in Theorem 7.4 bounds each factor’s fourth power below by . Therefore
which is impossible. Notice that the divisor function uses , while the quartic bound uses the full maximum .
For a composite tail, define
The equality follows by putting : the displayed ratio is , minimized by the largest unitary .
Theorem 8.3 (Composite unitary tail). Let be an odd Markoff number with . At any certified coefficient , the condition
guarantees that is unique.
Proof. Assume there is a collision, with unitary split . Because , every prime-power block of lies wholly in one of these two factors. Write its resulting split as , with , and choose the names so that . Then .
The collision factor containing has the form , where is a unitary divisor of . It is therefore at most . Apply the collision tier to this factor and the assumed bound to its upper estimate:
The positive term makes this chain impossible. It also explains why a non-strict inequality is allowed in the hypothesis. □
Taking makes , proving Corollary 1.2. More generally, if has exactly two coprime primary blocks with , then (8.5) is .
The even analogue applies to the odd core of the maximum.
Theorem 8.4 (Even composite unitary tail). Let be an even Markoff number with . At any certified even coefficient , the condition
guarantees that is unique.
Proof. Suppose there is a collision. Its unitary factorization is now of . Split the complete prime-power blocks of according to the two collision factors, writing with . As before, , and the collision factor containing is for a unitary divisor of . Thus .
The even tier uses . It and the assumed bound give
a contradiction. Hence the maximum is unique. □
Example 8.5 (The tier transition at 51641). The Markoff triple shows directly that
is a Markoff number. It has and . The right sides of (8.2) are
for the four coefficients in order. Thus this intrinsic test does not close the number at tiers 99 or 360, but it does at tier 201411, before either final-row rejection is used. The example illustrates the logical role of the intermediate tier and proves that the present sufficient unitary-gap criterion is strictly stronger than Button’s coefficient-1 criterion. It is not a claim that the uniqueness of 51641 was previously unknown by all other methods.
Certificate protocol and reproducibility
Use of generative AI in the research methodology. OpenAI ChatGPT and Codex were used for mathematical exploration, provisional proof drafting and review, exact-arithmetic code development and testing, reference checking, and manuscript preparation. This assistance included substantive research and writing, beyond copy editing. AI outputs were treated as proposals requiring mathematical justification; the proofs and the supplied executable checks provide the stated evidence. The author directed the research and is responsible for the final text, arguments, references, and code. The supplied checks are exact computational certificates, not a formal proof-assistant verification or an external referee report.
The supplementary archive contains six current proof programs. Four certify the odd and normalized-even defect-product enumerations: the two primary programs enumerate pairs first, emit deterministic JSON/CSV/text objects, and include internal product-order cross-checks; the two standalone programs enumerate products first, import no primary code, and independently implement factorization, divisors, admissibility, companion filtering, CRT, and continued fractions. Two further, independently structured programs certify the odd residual crossed-Pell rejection. Specifically, the files are
verify_four_tiers.pyandverify_four_tiers_product_first.pyfor the four odd tiers;
verify_odd_crossed_pell.pyandverify_odd_crossed_pell_divisor_first.pyfor the residual allocation, the four packet/coordinate orientations, the complete modular root lists, and the product-chamber bounds used in the final odd rejection;
verify_even_tiers.pyandverify_even_tiers_product_first.pyfor the three normalized even tiers;
deterministic machine-readable results, exact tables, and reference transcripts in the following four directories.
generated/ generated_even/
generated_crossed_pell/ generated_crossed_pell_divisor_first/
MANIFEST.sha256, hashing every archived source and result; and
legacy/verify_defect_120.pyandlegacy/verify_defect_global_100000.py, retained as provenance for the original odd-tier programs from which the unified odd certificate was reconstructed.
The principal commands are
python3 verify_four_tiers.py --mode primary --output-dir odd_replay
python3 verify_four_tiers_product_first.py
python3 verify_four_tiers.py --mode both
python3 verify_odd_crossed_pell.py --output-dir crossed_pell_replay
python3 verify_odd_crossed_pell_divisor_first.py \
--output-dir crossed_pell_divisor_replay
python3 verify_even_tiers.py --mode primary --output-dir even_replay
python3 verify_even_tiers_product_first.py
python3 verify_even_tiers.py --mode both
All six current verifiers are also replayed under python3 -O, so no mathematical check depends on optimization-sensitive assertions. Python 3.10 or later is required; the six proof programs use only the standard library. The separate plotting program draw_fg.py uses NumPy and Matplotlib. No floating-point value enters a certificate test. The new figure is a numerical illustration of the stated functions and is not used in the proof. Environment and timing metadata appear only in the run logs and are not part of the deterministic certificate files.
The odd primary program records the exhaustive counts in Table 4. The modulo-3 gate is the proved condition that exactly one of , is divisible by 3.
| count | ||
| pairs before modulo-3 gate | 236 | 583217 |
| pairs after modulo-3 gate | 91 | 246960 |
| divisors of examined | 530 | 2942721 |
| admissible target divisors | 209 | 1307435 |
| survivors in enlarged domain | 0 | 19 |
| of which | 0 | 18 |
Table 4. Exact enumeration counts emitted by the primary verifier.
Table 5 records the corresponding pair-first counts for the even coefficient- traversal over .
| count | value |
| pairs before modulo-3 gate | 583354 |
| pairs after modulo-3 gate | 247013 |
| divisors of examined | 2943053 |
| admissible target divisors | 1307570 |
| survivors in enlarged domain | 65 |
| of which | 63 |
| companion-prime survivors | 4 |
| canonical-continuant survivors | 0 |
Table 5. Exact counts emitted by the primary even verifier.
The source hashes at the time of submission preparation are
| file | SHA-256 |
verify_four_tiers.py | 46b0d81367e8a94684a32f6dc08fce484ccd8ab005d4c0946d61b3b1b9a79cc5 |
verify_four_tiers_product_first.py | b908dfd28df6c540088f0caf5c83f5ea85d23752f638f95d938c9bb2f3cc8231 |
verify_odd_crossed_pell.py | 6388d0e8a50c65a3f5e741ede96e2314931c991324185fd3ca3d5f6178ce18aa |
verify_odd_crossed_pell_divisor_first.py | d7143b2be8471c77a1721775b41743fcd4e0be3b7303a96c584e9b7a3519ab72 |
verify_even_tiers.py | 01f8bb050d3e16bcd9b424ec1d9fb6123c4f60f8feb446ff521df9e130df140c |
verify_even_tiers_product_first.py | 10c111181f945c49c0a4d3e72766f88a712c467ea7476d43a260c7cfef279ed9 |
legacy/verify_defect_120.py | 8cd0ab00f3546e2340a2380b780fbb0415331fadc93264d99ed7078863a93a27 |
legacy/verify_defect_global_100000.py | 805e94175bf906f6ba70b0e0da0ae6486d72476c6fc24a8dee42f825baff3874 |
Table 9.
The archive manifest is authoritative if any filename is moved or any source is revised.
To reproduce the mathematical certificate, a reader can use the following checks.
verify the manifest before executing code;
run all six current verifiers under a standard interpreter and under
python3 -O;compare the nineteen-row enlarged-domain CSV against Table 3 and verify that eighteen rows have ;
compare the sixty-five-row even tables, verify that sixty-three rows are primitive, and verify the standalone program’s canonical four-column row-serialization digest against the reference transcript;
independently multiply each row into its odd or even defect equation;
verify every displayed companion witness and factorization in both parity sectors;
recompute the odd and even CRT roots, canonical-interval roots, and continued fractions;
compare the two residual-orientation tables, verify all four packet/coordinate cases, and recompute the two crossed equations, their product-chamber caps, and their complete modular square-root lists.
Scope and remaining problem
The argument gives a rigorous partial theorem, not a proof of full unicity. It establishes that a hypothetical odd collision must admit a proper unitary factorization of whose two factors satisfy strong quartic lower bounds. For an even collision the corresponding proper unitary factorization is of the odd core , with the same final quartic bound. In either parity the prime-power blocks therefore cannot be allocated too unevenly in this quantified sense. No fixed coefficient alone can exclude every increasingly balanced unitary allocation.
The determinant argument does give a precise blockwise switch for elementary occurrence roots. For a collision, set
Both satisfy . If , then gives , and hence . If , then gives . Thus a collision switches exactly the -blocks for these ratio roots. The present paper does not identify this ratio root with the canonical interval root of Lemma 6.9 in a form uniform enough to finish the conjecture.
The crossed-Pell reconstruction in § 7.3 recovers additional primitive-slope information and couples the two defect packets. For the final-row certificate, this coupling is more restrictive than the companion unitary and quadratic-residue conditions alone. It does not, however, uniformly identify an elementary occurrence root with the canonical interval root, nor does it preclude every balanced unitary allocation.
The determinant and continuant viewpoints therefore suggest a narrow next problem.
Problem 10.1 (Unitary switch separation). For an odd ordered collision, let ; for an even ordered collision, let . In either case write the collision split as . Relate the two ratio roots above to the canonical roots supplied by Lemma 6.9. In the even case, is only
the split modulus: the canonical roots remain roots of modulo the full maximum . Prove that no two canonical roots attached to distinct occurrences can satisfy
while both lie in the canonical interval and have only -digits.
The certified tiers treat both parity sectors and eliminate every collision whose relevant unitary allocation is sufficiently unbalanced. Problem 10.1 asks for both the missing canonical-root bridge and the universal separation needed in the balanced range.
Statements and Declarations
Data and code availability. Online Resource 1 (ESM_1.zip) supplies the six current proof programs, machine-readable certificate results, enlarged-domain row tables, reference transcripts, and SHA-256 manifest supporting this article. The programs require Python 3.10 or later and use only its standard library. No external empirical dataset is used.
Supplementary information. Online Resource 1: Exact finite certificates for the odd and normalized-even collision tiers, including two independent implementations of the residual crossed-Pell rejection, the program and parameters for Figure 1, and instructions for reproduction.
Figure 1. The functions and for the Markoff maximum , which occurs in . The horizontal axis is linear and the vertical axis is logarithmic. The shaded interval contains the parameter of the smaller entry of an ordered occurrence. The two marked points belong to this one known occurrence: and . They do not represent a collision. The solid and dashed curves become close because , while both approach ; hence their common large- trend appears straight on these axes. A logarithmic axis displays only positive values. Thus and the negative values for are omitted, and the dashed curve continues below the plotted range as . The finite graph window stops at ; the functions themselves are defined on all real .
Generative AI assistance. The substantive uses of OpenAI ChatGPT and Codex in mathematical exploration, proof drafting, code development, testing, and writing are described in § 10. The author is responsible for the article and its accompanying code and results.
Author contribution. Elleard Felix Webster Heffern formulated the research questions and framework, directed the investigation, and is responsible for the article and its accompanying materials.
Funding. This research received no funding.
Competing interests. The author declares no competing interests.
Related work by the author. The separate manuscript Chebyshev Reference Bounds and Certified Spectral Refinement for Markov Numbers develops bounds for matrix products and localization of possible collisions among Farey labels. The present article proves arithmetic constraints on a shared maximum and uses separate finite certificates. Neither manuscript requires the other’s results. Earlier versions of the present arithmetic work circulated under the titles Quantitative Unitary-Factor Bounds for Collisions of Markov Triples and Unitary-Factor Obstructions to Collisions of Markov Triples; these are related versions of this work, not independent companion contributions.
References
- [1]M. Aigner, Markov’s Theorem and 100 Years of the Uniqueness Conjecture: A Mathematical Journey from Irrational Numbers to Perfect Matchings, Springer, Cham, 2013, https://doi.org/10.1007/978-3-319-00888-2.
- [2]A. Baragar, On the unicity conjecture for Markoff numbers, Canad. Math. Bull. 39 (1996), no. 1, 3–9, https://doi.org/10.4153/CMB-1996-001-x.
- [3]J. O. Button, The uniqueness of the prime Markoff numbers, J. London Math. Soc. (2) 58 (1998), no. 1, 9–17, https://doi.org/10.1112/S0024610798006292.
- [4]J. O. Button, Markoff numbers, principal ideals and continued fraction expansions, J. Number Theory 87 (2001), no. 1, 77–95, https://doi.org/10.1006/jnth.2000.2578.
- [5]İ. Çanakçı and R. Schiffler, Snake graphs and continued fractions, European J. Combin. 86 (2020), Article 103081, https://doi.org/10.1016/j.ejc.2020.103081.
- [6]F.-J. Chen and Y.-G. Chen, On the Frobenius conjecture for Markoff numbers, J. Number Theory 133 (2013), no. 7, 2363–2373, https://doi.org/10.1016/j.jnt.2012.12.018.
- [7]H. Cohn, Approach to Markoff’s minimal forms through modular functions, Ann. of Math. (2) 61 (1955), no. 1, 1–12, https://doi.org/10.2307/1969618.
- [8]H. Cohn, Representation of Markoff’s binary quadratic forms by geodesics on a perforated torus, Acta Arith. 18 (1971), 125–136, https://doi.org/10.4064/aa-18-1-125-136.
- [9]D. Fisac, Markov’s conjecture on integral necklaces, Bull. London Math. Soc. 57 (2025), no. 12, 4122–4131, https://doi.org/10.1112/blms.70178.
- [10]G. Frobenius, Über die Markoff’schen Zahlen, Sitzungsberichte der Königlich Preußischen Akademie der Wissenschaften zu Berlin, Jahrgang 1913, erster Halbband, 458–487.
- [11]M. L. Lang and S. P. Tan, A simple proof of the Markoff conjecture for prime powers, Geom. Dedicata 129 (2007), 15–22, https://doi.org/10.1007/s10711-007-9189-x.
- [12]A. Markoff, Sur les formes quadratiques binaires indéfinies, Math. Ann. 15 (1879), 381–406, https://doi.org/10.1007/BF02086269.
- [13]C. Reutenauer, From Christoffel Words to Markoff Numbers, 2nd ed., Oxford University Press, Oxford, 2026, https://doi.org/10.1093/9780197907535.001.0001.
- [14]A. Srinivasan, Markoff numbers and ambiguous classes, J. Théor. Nombres Bordeaux 21 (2009), no. 3, 757–770, https://doi.org/10.5802/jtnb.701.
- [15]J. M. Tornero, A geometric approach to the Frobenius unicity conjecture for the Markoff equation, J. Lie Theory 18 (2008), no. 3, 595–600, https://doi.org/10.5802/jolt.513.
- [16]Y. Zhang, Congruence and uniqueness of certain Markoff numbers, Acta Arith. 128 (2007), no. 3, 295–301, https://doi.org/10.4064/aa128-3-7.
- [17]C. O’Sullivan, Patterns in the Markov numbers and their generalizations, preprint (2026), arXiv:2609.14149v1.arxiv.org/abs/2609.14149
- [18]S.-i. Yasutomi, On the Ordering and Injectivity of Lagrange Constants Associated with Certain Substitutions, preprint (2026), arXiv:2609.32450v1.arxiv.org/abs/2609.32450
- [19]E. Banaian, Orderings on k-Markov numbers, The Ramanujan Journal 71 (2026), Article 12, https://doi.org/10.1007/s11139-026-01468-5.
- [20]Y. Gyoda, An Introduction to the Lagrange and Markov Spectra through the Lens of Generalized Markov Numbers, preprint (2026), arXiv:2609.28097v1.arxiv.org/abs/2609.28097
