Pith. sign in

REVIEW 3 minor 12 references

Recursive words on a binary tree evaluate to matrices encoding generalized Markov numbers for each positive rational slope.

Reviewed by Pith at T0; open to challenge. T0 means a machine referee read the full paper against a public rubric. the ladder, T0–T4 →

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

T0 review · grok-4.3

2026-06-29 15:56 UTC pith:RAQNWPWV

load-bearing objection Gyoda's binary tree words extend Cohn's method to the generalized Markov equation, but verification of the matrix encoding is needed.

arxiv 2605.26951 v2 pith:RAQNWPWV submitted 2026-05-26 math.NT math.CO

Words for generalized Markov numbers

Yasuaki Gyoda This is my paper
classification math.NT math.CO
keywords generalized Markov numbersbinary treeMarkov-monodromy matrixCohn wordrational slopesword evaluationMarkov equation
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper builds a word-theoretic framework for generalized Markov numbers, the positive integers appearing in solutions to the equation x² + y² + z² + k₁yz + k₂zx + k₃xy = (3 + k₁ + k₂ + k₃)xyz. For every positive rational slope t it defines a word ω_t by a recursive rule on a binary tree and realizes the word geometrically as a line segment of slope t. Matrix evaluation of ω_t produces a Markov-monodromy matrix whose entries encode the generalized Markov number at t. The same construction recovers the classical Cohn word through a local substitution rule and relates the completed word xyz ω_t^{-1} to generalized Cohn matrices.

Core claim

For each positive rational slope t, the word ω_t defined by a recursive rule on a binary tree, when evaluated as a matrix product, gives a Markov-monodromy matrix encoding the generalized Markov number at t.

What carries the argument

The word ω_t defined recursively on the binary tree for slope t, realized geometrically by a line segment of that slope, and evaluated as a matrix product to produce the Markov-monodromy matrix.

Load-bearing premise

The recursive definition of ω_t on the binary tree produces a word whose matrix evaluation exactly matches the generalized Markov number appearing in positive integer solutions of the equation.

What would settle it

For a chosen rational t such as t=1, compute the matrix product of the corresponding ω_t and check whether one of its entries equals the generalized Markov number obtained by solving the equation directly for that slope.

Watch this falsifier. Get emailed when new claim-graph text bears on it.

Share X Bluesky LinkedIn Reddit HN

If this is right

  • ω_t recovers the classical Cohn word by a local substitution rule.
  • The completed word ω̄_t = xyz ω_t^{-1} is related to the generalized Cohn matrices.
  • The framework supplies a combinatorial source for the positive integer solutions of the generalized Markov equation.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The geometric line-segment realization may permit direct generation of the words from continued-fraction expansions of t without explicit tree recursion.
  • The matrix construction could be tested on slopes that produce the same generalized Markov number to check uniqueness of the associated word.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit.

Referee Report

0 major / 3 minor

Summary. The paper constructs a word-theoretic framework for generalized Markov numbers, positive integers appearing in positive integer solutions of the generalized Markov equation x² + y² + z² + k₁ yz + k₂ zx + k₃ xy = (3 + k₁ + k₂ + k₃) xyz. For each positive rational slope t, a word ω_t is defined by a recursive rule on a binary tree and realized geometrically by a line segment of slope t; matrix evaluation of ω_t produces a Markov-monodromy matrix whose entries encode the generalized Markov number at t. The construction recovers the classical Cohn word via a local substitution rule, and the completed word ar{ω}_t = xyz ω_t^{-1} is shown to be related to generalized Cohn matrices.

Significance. If the central encoding claim holds, the work supplies a combinatorial and geometric interpretation of generalized Markov numbers via recursively defined words on binary trees and their matrix products. This extends the classical theory of Markov numbers and Cohn words in a uniform way across the family of Diophantine equations parameterized by k₁, k₂, k₃. The explicit recovery of the Cohn word and the relation to generalized Cohn matrices provide concrete links to the existing literature, while the matrix-monodromy perspective may enable new algebraic and dynamical studies of these numbers.

minor comments (3)
  1. [Abstract] The abstract introduces the term 'Markov--monodromy matrix' without a one-sentence gloss; a brief parenthetical description of its form (e.g., 'a 3×3 matrix whose (1,2) entry is the generalized Markov number') would improve immediate readability.
  2. [Abstract] The geometric realization of ω_t as a line segment of slope t is stated but the precise correspondence between the word letters and the segment's endpoints or continued-fraction steps is not cross-referenced to a numbered equation or figure in the abstract; adding such a pointer would clarify the link between the combinatorial and geometric objects.
  3. [Abstract] The substitution rule that recovers the classical Cohn word is described as 'local' but the precise replacement (which letters are replaced by which words) is not exhibited in the abstract; including the explicit substitution in a parenthetical remark would make the recovery statement self-contained for readers familiar with Cohn's work.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their positive summary of the paper and for recommending minor revision. No specific major comments were raised in the report.

Circularity Check

0 steps flagged

No significant circularity; construction is self-contained

full rationale

The paper defines ω_t recursively on a binary tree for rational t, gives a geometric line-segment realization, and defines its matrix evaluation to produce the Markov-monodromy matrix. This is a direct constructive definition rather than a derivation that reduces to fitted inputs, self-citations, or prior ansatzes. The recovery of the classical Cohn word is shown via an explicit local substitution rule on the new object. No load-bearing step equates a claimed prediction or uniqueness result to its own inputs by construction. The framework is therefore independent of the target Diophantine solutions.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 2 invented entities

The central claim rests on the correctness of the recursive word definition and its matrix evaluation. No numerical free parameters are introduced. The only axioms invoked are standard facts about matrix multiplication and binary trees. The new entities are purely definitional mathematical objects.

axioms (2)
  • standard math Matrix multiplication is associative and the letters of the word are replaced by fixed 2x2 or 3x3 matrices whose product yields the monodromy matrix.
    Invoked when the word ω_t is evaluated to produce the Markov-monodromy matrix.
  • domain assumption Binary trees admit a recursive labeling by rational slopes that is consistent with Farey mediants or continued-fraction expansions.
    Used to index the words ω_t by positive rational t.
invented entities (2)
  • Markov-monodromy matrix no independent evidence
    purpose: Encodes the generalized Markov number at slope t via matrix product of the word ω_t
    Defined directly from the word evaluation; no independent existence outside the construction is claimed.
  • word ω_t no independent evidence
    purpose: Combinatorial object that simultaneously encodes the slope t geometrically and the Markov number algebraically
    Invented in the paper as the central new object.

pith-pipeline@v0.9.1-grok · 5658 in / 1499 out tokens · 49970 ms · 2026-06-29T15:56:46.458523+00:00 · methodology

0 comments
Cite this review

Pith. "Pith review of Words for generalized Markov numbers." pith.science (2026). https://pith.science/paper/RAQNWPWV

@misc{pith2026260526951,
  author       = {Pith},
  title        = {Pith review of: Words for generalized Markov numbers},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/RAQNWPWV}},
  note         = {Machine review of arXiv:2605.26951}
}
Share X Bluesky LinkedIn Reddit HN
read the original abstract

We construct a word-theoretic framework for generalized Markov numbers, that is, positive integers appearing in positive integer solutions of the generalized Markov equation $x^2+y^2+z^2+k_1yz+k_2zx+k_3xy=(3+k_1+k_2+k_3)xyz$. For each positive rational slope $t$, we define a word $\omega_t$ by a recursive rule on a binary tree and realize it geometrically by a line segment of slope $t$. Matrix evaluation of $\omega_t$ gives a Markov--monodromy matrix encoding the generalized Markov number at $t$. We also show that $\omega_t$ recovers the classical Cohn word by a local substitution rule, and that the completed word $\overline{\omega}_t=xyz\omega_t^{-1}$ is related to the generalized Cohn matrices.

Figures

Figures reproduced from arXiv: 2605.26951 by Yasuaki Gyoda.

Figure 1
Figure 1. Figure 1: Line segment L2 5 We define the (k1, k2, k3, σ)-generalized Markov sequence s ◦ k1,k2,k3,σ(t) = (a1, . . . , aℓ) by a sign assignment along Lt . The segment is oriented from left to right. Write L ◦ t for Lt with its endpoints removed. A triangle is counted as crossed when the open segment L ◦ t meets the interior of the triangle. First, assign a sign to each right-angled triangle crossed by Lt . The sign … view at source ↗
Figure 2
Figure 2. Figure 2: Right-angled triangles with − [PITH_FULL_IMAGE:figures/full_fig_p005_2.png] view at source ↗
Figure 4
Figure 4. Figure 4: Edges with − [PITH_FULL_IMAGE:figures/full_fig_p006_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: Edges with + Finally, record the sign of a triangle when Lt passes through its interior, and record the sign of an edge when Lt crosses that edge. These events are ordered by their positions along the oriented segment. Compress the resulting sign string into maximal consecutive blocks of equal signs. If the block lengths are a1, . . . , aℓ , set s ◦ k1,k2,k3,σ(t) := (a1, . . . , aℓ). The following example … view at source ↗
Figure 6
Figure 6. Figure 6: The segment Lt for t = 2 5 with the signs assigned by the triangle￾crossing and edge-crossing rules [PITH_FULL_IMAGE:figures/full_fig_p006_6.png] view at source ↗
Figure 7
Figure 7. Figure 7: Edges with x, y and z Example 3.2. Let t = 2 5 . The letters assigned to the edges in L2 5 are given as in [PITH_FULL_IMAGE:figures/full_fig_p009_7.png] view at source ↗
Figure 8
Figure 8. Figure 8: Edges with x −1 , y−1 and z −1 [PITH_FULL_IMAGE:figures/full_fig_p010_8.png] view at source ↗
Figure 9
Figure 9. Figure 9: Letters assigned to edges in L2 5 No two consecutive crossed edges have the same slope, and hence no adjacent inverse letters are created. Thus we have the following proposition. Proposition 3.3. For any irreducible fraction t ∈ Qext ≥0 , the word ωt is a reduced word. Proof. The boundary cases t = 0 1 and t = 1 0 are immediate because ω 0 1 = x and ω 1 0 = z. Assume t ∈ (0,∞) ∩ Q. Consecutive edges crosse… view at source ↗
Figure 10
Figure 10. Figure 10: PG( 1 p+1 ) with p = 7 Let us compare the letter sequence of PG( 1 p+1 ) after removing the first tile and that of PG( 1 p ) (compare Figures 10 and 11). We denote by SPG( 1 p+1 ) the former graph. We prove that only the letters associated with the central edges in SPG( 1 p+1 ) and PG( 1 p ) differ. The central letters differ: the corresponding letter of PG( 1 p ) is α (where α = y or [PITH_FULL_IMAGE:fi… view at source ↗
Figure 11
Figure 11. Figure 11: PG( 1 p ) with p = 7 z) by assumption, whereas the corresponding letter of SPG( 1 p+1 ) is α −1 . It remains to show that all other letters coincide. We first consider vertical edges. The height of the intersection point between the (a+ 1)-th vertical edge from the left of PG( 1 p ) and the line segment L1 p is a p . Moreover, the height of the intersection point between the (a + 1)-th vertical edge from … view at source ↗
Figure 12
Figure 12. Figure 12: Decomposition of pre-snake graph with r = 1 3 , t = 2 5 , s = 1 2 letters except the central ones coincide. The comparison between SPG(s) and PG(s) is identical. This proves the claim. □ Proof of Theorem 3.6. It is immediate that ω 0 1 = x, ω 1 1 = y, and ω 1 0 = z. In the remaining cases, we prove that ωt represents Ω(t). By Lemma 3.8 and induction, it suffices to show that ωt represents ω −1 r xyzω−1 s … view at source ↗
Figure 13
Figure 13. Figure 13: The words c 2 5 and c 5 2 We use the following standard description of Cohn words. Theorem 4.4 ([1, Theorem 7.6]). For any irreducible fraction t ∈ (0, ∞) ∩ Q, we have ct = c(t). The boundary cases t = 0 1 and t = 1 0 hold by the defining conventions c 0 1 = c( 0 1 ) = p and c 1 0 = c( 1 0 ) = r. We shall use the following consequence. Theorem 4.5 ([1]). For any irreducible fraction t ∈ ((0, 1) ∪ (1,∞)) ∩… view at source ↗
Figure 14
Figure 14. Figure 14: The shifted segment Lt associated with t = 2 5 The resulting sequence sk1,k2,k3,σ(t) is the generalized strongly admissible sequence asso￾ciated with Lt . For example, when (k1, k2, k3) = (1, 2, 0), σ = id, and t = 2 5 , the shifted segment carries the signs shown in [PITH_FULL_IMAGE:figures/full_fig_p019_14.png] view at source ↗
Figure 15
Figure 15. Figure 15: The shifted segment Lt for t = 2 5 with the signs assigned by the triangle-crossing and edge-crossing rules. We now recall how the corresponding matrix is obtained from this run-length sequence. For a finite sequence S = (a0, a1, . . . , aℓ) of positive integers, set (5.4) FS :=  a0 1 1 0 a1 1 1 0 · · ·  aℓ 1 1 0 . The generalized Cohn matrix is obtained by applying this continued-fraction matrix pr… view at source ↗
Figure 16
Figure 16. Figure 16: Letters assigned to edges in L2 5 sequence. The entries of the generalized Cohn matrix are already present in Mt ; only a fixed sign correction is required. Theorem 5.6 (Obtaining the generalized Cohn matrix). For every positive reduced frac￾tion t ∈ (0, ∞) ∩ Q, one has (5.9) Ct =  −1 0 0 1 Mt  1 0 0 −1  . Proof. By Lemma 5.4, the endpoint-completed word satisfies ωt = xyzω−1 t . Hence Mt = XY ZM−1 t … view at source ↗

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

12 extracted references · 5 canonical work pages · 2 internal anchors

  1. [1]

    Aigner,Markov’s Theorem and 100 Years of the Uniqueness Conjecture, Springer, 2013

    M. Aigner,Markov’s Theorem and 100 Years of the Uniqueness Conjecture, Springer, 2013

    2013

  2. [2]

    Orderings of k-Markov Numbers

    E. Banaian,Orderings onk-Markov numbers, 2025, arXiv:2512.04026

    work page internal anchor Pith review Pith/arXiv arXiv 2025

  3. [3]

    Cluster algebraic interpretation of generalized Markov numbers and their matrixizations

    E. Banaian and Y. Gyoda,Cluster algebraic interpretation of generalized Markov numbers and their matrixizations, 2025, arXiv:2507.06900

    work page arXiv 2025

  4. [4]

    Cohn,Approach to Markoff’s minimal forms through modular functions, Ann

    H. Cohn,Approach to Markoff’s minimal forms through modular functions, Ann. of Math. (2)61 (1955), 1–12

    1955

  5. [5]

    T. W. Cusick and M. E. Flahive,The Markoff and Lagrange Spectra, Mathematical Surveys and Monographs, vol. 30, American Mathematical Society, 1989

    1989

  6. [6]

    Generalized discrete Markov spectra

    Y. Gyoda,Generalized discrete Markov spectra, 2025, arXiv:2512.04547

    work page internal anchor Pith review Pith/arXiv arXiv 2025

  7. [7]

    Gyoda and S

    Y. Gyoda and S. Maruyama,Uniqueness theorem of generalized Markov numbers that are prime powers, 2023, preprint, arXiv:2312.07329 [math.NT]

    work page arXiv 2023

  8. [8]

    Gyoda, S

    Y. Gyoda, S. Maruyama, and Y. Sato, SL(2,Z)-matrixizations of generalized Markov numbers, 2024, arXiv:2407.08203

    work page arXiv 2024

  9. [9]

    Gyoda and K

    Y. Gyoda and K. Matsushita,Generalization of Markov Diophantine equation via generalized cluster algebra, Electron. J. Combin.30(2023), no. 4, Paper No. 4.10

    2023

  10. [10]

    Markoff,Sur les formes quadratiques binaires ind´ efinies, Math

    A. Markoff,Sur les formes quadratiques binaires ind´ efinies, Math. Ann.15(1879), 381–406

  11. [11]

    Second m´ emoire, Math

    ,Sur les formes quadratiques binaires ind´ efinies. Second m´ emoire, Math. Ann.17(1880), 379–399

  12. [12]

    Reutenauer,From Christoffel Words to Markoff Numbers, Oxford University Press, 2019

    C. Reutenauer,From Christoffel Words to Markoff Numbers, Oxford University Press, 2019. (Yasuaki Gyoda)Institute for Advanced Research, Nagoya University, Furo-cho, Chikusa- ku, Nagoya-shi, 464-8601, Japan Email address:ygyoda@math.nagoya-u.ac.jp

    2019