pith. sign in

arxiv: 2604.17069 · v1 · submitted 2026-04-18 · 🧮 math.CO · math.NT

Markov numbers of semigroups

Oleg Karpenkov , Yefei Ma This is my paper

Pith reviewed 2026-05-10 06:22 UTC · model grok-4.3

classification 🧮 math.CO math.NT
keywords Markov numberssemigroupsreduced integer matricesperfect matchingswug-snake graphsbipartite graphsgeometry of numbersMarkov minima
0
0 comments X

The pith

Generalized Markov numbers from semigroups of reduced integer matrices are given by perfect matchings of wug-snake graphs.

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

The paper studies generalized Markov numbers that arise when one considers semigroups formed by reduced integer matrices. It shows that these numbers are obtained simply by counting the perfect matchings in a family of bipartite graphs known as wug-snake graphs. This provides a combinatorial tool for calculating the numbers and ties the construction back to the geometry of numbers and the classical Markov minima.

Core claim

Generalized Markov numbers are defined through the action of semigroups generated by reduced integer matrices, and these numbers coincide with the number of perfect matchings in the wug-snake graphs constructed from the same data. The relation allows computation via graph theory and connects to minima in the geometry of numbers.

What carries the argument

Wug-snake graphs, a new family of bipartite graphs associated with elements of the semigroup of reduced integer matrices, whose perfect matching count equals the generalized Markov number for that element.

If this is right

  • The numbers become accessible through standard algorithms for counting perfect matchings in bipartite graphs.
  • This graph model offers a new perspective on the distribution of Markov numbers.
  • The construction extends the classical theory by embedding it in a semigroup framework.
  • Results on dimer models or matching polynomials may apply directly to Markov number problems.

Where Pith is reading between the lines

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

  • Algorithms for perfect matchings could enable computation of previously inaccessible generalized Markov numbers.
  • The snake-like structure of the graphs might suggest links to path-counting or continued fraction expansions in Diophantine approximation.
  • Similar graph constructions could be explored for other types of matrix semigroups or higher-dimensional analogues.

Load-bearing premise

That the semigroup generated by reduced integer matrices produces generalized Markov numbers whose values are exactly the perfect matching counts on the corresponding wug-snake graphs.

What would settle it

Select a small reduced integer matrix, compute its generalized Markov number from the semigroup definition, build the associated wug-snake graph, count its perfect matchings, and check if the two values agree; disagreement on any example would falsify the claimed equality.

read the original abstract

In this paper, we systematically study generalized Markov numbers arising from semigroups of reduced integer matrices. This construction allows us to find these numbers by counting perfect matchings of a new family of bipartite graphs, which we call wug-snake graphs. We also show how this relates to the geometry of numbers and the classical theory of Markov minima.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

0 major / 3 minor

Summary. The paper systematically studies generalized Markov numbers arising from semigroups of reduced integer matrices. It constructs these numbers via the semigroup operation and proves they equal the number of perfect matchings in a new family of bipartite graphs termed wug-snake graphs. The work further relates the construction to the geometry of numbers and recovers classical Markov minima as special cases through explicit bijections and recursive relations.

Significance. If the central claims hold, the manuscript supplies a combinatorial model for generalized Markov numbers that reduces their computation to perfect matchings on explicitly defined graphs. The reduction to known Markov properties via bijections is a clear strength, as it embeds the new semigroup construction within established Diophantine theory without introducing extraneous parameters. This could enable new enumerative proofs and algorithmic approaches in the geometry of numbers.

minor comments (3)
  1. The definition of wug-snake graphs (presumably in §3) would benefit from an explicit small-case example or diagram showing the vertex and edge labeling for the first few semigroups, to make the perfect-matching correspondence immediately verifiable.
  2. In the statement of the main theorem equating Markov numbers to matching counts, the precise conditions on the reduced matrices (e.g., determinant or positivity constraints) should be restated for self-contained reading, rather than relying solely on cross-references to the semigroup definition.
  3. A brief comparison table or paragraph contrasting the new wug-snake graphs with existing snake graphs or other Markov-related graphs would clarify the novelty of the construction.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their positive summary of the manuscript, accurate assessment of its significance, and recommendation for minor revision. The description of our work on generalized Markov numbers from semigroups of reduced integer matrices, their combinatorial interpretation via perfect matchings in wug-snake graphs, and the links to the geometry of numbers and classical Markov minima is precise.

Circularity Check

0 steps flagged

No significant circularity; derivation is self-contained via explicit constructions and bijections

full rationale

The paper introduces a semigroup of reduced integer matrices, defines associated wug-snake graphs, and establishes that generalized Markov numbers equal the perfect-matching counts on these graphs. This equality is derived through explicit bijections and recursive relations that reduce to the Diophantine properties of classical Markov numbers, without any self-definitional loops, fitted parameters renamed as predictions, or load-bearing self-citations. The construction and counting arguments are independent of the target quantities and rely on standard combinatorial and geometric tools external to the result itself.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 1 invented entities

Abstract introduces the wug-snake graph family and the semigroup construction without listing explicit free parameters or background axioms.

invented entities (1)
  • wug-snake graphs no independent evidence
    purpose: Bipartite graphs whose perfect matchings count the generalized Markov numbers
    New family of graphs defined in the paper to realize the counting interpretation.

pith-pipeline@v0.9.0 · 5333 in / 989 out tokens · 40384 ms · 2026-05-10T06:22:19.149793+00:00 · methodology

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

35 extracted references · 35 canonical work pages

  1. [1]

    A mathematical journey from irrational numbers to perfect matchings

    Martin Aigner.Markov’s theorem and 100 years of the uniqueness conjec- ture. A mathematical journey from irrational numbers to perfect matchings. Springer, Cham, 2013, pp. x+257. REFERENCES 47

    work page 2013

  2. [2]

    A dual approach to triangle sequences: a multidimensional continued fraction algorithm

    S. Assaf et al. “A dual approach to triangle sequences: a multidimensional continued fraction algorithm”.Integers5.1 (2005), A8, 39

    work page 2005

  3. [3]

    A generalization of Markov numbers

    Esther Banaian and Archan Sen. “A generalization of Markov numbers”. Ramanujan J.63.4 (2024), pp. 1021–1055

    work page 2024

  4. [4]

    The Brun gcd algorithm in high dimen- sions is almost always subtractive

    V. Berth´ e, L. Lhote, and B. Vall´ ee. “The Brun gcd algorithm in high dimen- sions is almost always subtractive”.J. Symbolic Comput.85 (2018), pp. 72– 107

    work page 2018

  5. [5]

    Algorithmes euclidiens pour trois et quatre nombres

    V. Brun. “Algorithmes euclidiens pour trois et quatre nombres”.Treizi` eme congr` es des math´ ematiciens scandinaves, tenu ` a Helsinki 18-23 aoˆ ut 1957. Mercators Tryckeri, Helsinki, 1958, pp. 45–64

    work page 1957

  6. [6]

    Snake graph calculus and cluster algebras from surfaces

    Ilke Canakci and Ralf Schiffler. “Snake graph calculus and cluster algebras from surfaces”.J. Algebra382 (2013), pp. 240–281

    work page 2013

  7. [7]

    Snake graphs and continued fractions

    ˙Ilke C ¸ anak¸ cı and Ralf Schiffler. “Snake graphs and continued fractions”. European J. Combin.86 (2020), pp. 103081, 19

    work page 2020

  8. [8]

    On the product of three ho- mogeneous linear forms and indefinite ternary quadratic forms

    J. W. S. Cassels and H. P. F. Swinnerton-Dyer. “On the product of three ho- mogeneous linear forms and indefinite ternary quadratic forms”.Philosoph- ical Transactions of the Royal Society of London. Series A, Mathematical and Physical Sciences248.940 (1955), pp. 73–96

    work page 1955

  9. [10]

    Approach to Markoff’s minimal forms through modular functions

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

    work page 1955

  10. [11]

    T. W. Cusick and M. E. Flahive.The Markoff and Lagrange spectra. Vol. 30. Mathematical Surveys and Monographs. Providence, RI: American Mathe- matical Society, 1989, pp. x+97

    work page 1989

  11. [12]

    Note on the product of three homogeneous linear forms

    H. Davenport. “Note on the product of three homogeneous linear forms”. J. London Math. Soc.16 (1941), pp. 98–101

    work page 1941

  12. [13]

    On the product of three homogeneous linear forms. IV

    H. Davenport. “On the product of three homogeneous linear forms. IV”. Proc. Cambridge Philos. Soc.39 (1943), pp. 1–21

    work page 1943

  13. [14]

    On the product of three non-homogeneous linear forms

    H. Davenport. “On the product of three non-homogeneous linear forms”. Proc. Cambridge Philos. Soc.43 (1947), pp. 137–152

    work page 1947

  14. [15]

    Evans, P

    Sam Evans, Perrine Jouteur, Sophie Morier-Genoud, and Valentin Ovsienko. “On q-deformed Markov numbers. Cohn matrices and perfect matchings with weighted edges”. ArXiv, https://arxiv.org/pdf/2507.19080

    work page arXiv

  15. [16]

    Evans, A.P

    Sam Evans, Alexander Veselov, and Brian Winn. “Arithmetic and geometry of Markov polynomials”. ArXiv, https://arxiv.org/abs/2501.14882

    work page arXiv

  16. [17]

    Cluster algebras. I. Foundations

    Sergey Fomin and Andrei Zelevinsky. “Cluster algebras. I. Foundations”. J. Amer. Math. Soc.15.2 (2002), pp. 497–529

    work page 2002

  17. [18]

    ¨Uber die Markoffschen Zahlen

    Ferdinand Georg Frobenius. “ ¨Uber die Markoffschen Zahlen”. German. Sitzungsberichte der K¨ oniglich Preussischen Akademie der Wissenschaften zu Berlin26 (1913), pp. 458–487. 48 REFERENCES

    work page 1913

  18. [19]

    On almost everywhere strong conver- gence of multi-dimensional continued fraction algorithms

    D. M. Hardcastle and K. Khanin. “On almost everywhere strong conver- gence of multi-dimensional continued fraction algorithms”.Ergodic Theory Dynam. Systems20.6 (2000), pp. 1711–1733

    work page 2000

  19. [20]

    Karpenkov.Geometry of Continued Fractions

    O. Karpenkov.Geometry of Continued Fractions. 2nd ed. Springer Nature, 2022

    work page 2022

  20. [21]

    Generalised Markov numbers

    Oleg Karpenkov and Matty van Son. “Generalised Markov numbers”.J. Number Theory213 (2020), pp. 16–66

    work page 2020

  21. [22]

    Cluster algebras and Jones polynomi- als

    Kyungyong Lee and Ralf Schiffler. “Cluster algebras and Jones polynomi- als”.Selecta Math. (N.S.)25.4 (2019), Paper No. 58, 41

    work page 2019

  22. [23]

    Sur les formes quadratiques binaires ind´ efinies

    A. Markoff. “Sur les formes quadratiques binaires ind´ efinies”.Math. Ann. 15.3-4 (1879), pp. 381–406

    work page

  23. [24]

    Sur les formes quadratiques binaires ind´ efinies

    A. Markoff. “Sur les formes quadratiques binaires ind´ efinies”.Math. Ann. 17.3 (1879), pp. 379–399

    work page

  24. [25]

    Perfect matchings and cluster algebras of classical type

    Gregg Musiker. “Perfect matchings and cluster algebras of classical type”. 20th Annual International Conference on Formal Power Series and Alge- braic Combinatorics (FPSAC 2008). Vol. AJ. Discrete Math. Theor. Com- put. Sci. Proc. Assoc. Discrete Math. Theor. Comput. Sci., Nancy, 2008, pp. 435–446

    work page 2008

  25. [26]

    Higher dimer covers on snake graphs

    Gregg Musiker, Nicholas Ovenhouse, Ralf Schiffler, and Sylvester W Zhang. “Higher dimer covers on snake graphs”.Algebr. Comb.9.1 (2026), pp. 131– 159

    work page 2026

  26. [27]

    Geometry of multidimensional Farey sum- mation algorithm and frieze patterns

    Matty van Son Oleg Karpenkov. “Geometry of multidimensional Farey sum- mation algorithm and frieze patterns”. ArXiv, https://arxiv.org/abs/2410.13091

    work page arXiv

  27. [28]

    Erweiterung eines Markoffschen Satzes ¨ uber die Konvergenz gewisser Kettenbr¨ uche

    O. Perron. “Erweiterung eines Markoffschen Satzes ¨ uber die Konvergenz gewisser Kettenbr¨ uche”.Math. Ann.74.4 (1913), pp. 545–554

    work page 1913

  28. [29]

    Grundlagen f¨ ur eine Theorie des Jacobischen Kettenbruchalgo- rithmus

    O. Perron. “Grundlagen f¨ ur eine Theorie des Jacobischen Kettenbruchalgo- rithmus”.Math. Ann.64.1 (1907), pp. 1–76

    work page 1907

  29. [30]

    ¨Uber die Approximation irrationaler Zahlen durch rationale

    O. Perron. “ ¨Uber die Approximation irrationaler Zahlen durch rationale”. II S.-B. Heidelberg Akad. Wiss.Essay 8 (1921), 12 pp

    work page 1921

  30. [31]

    A generalization of the continued fraction algorithm that is related to the Viggo Brun algorithm

    E. V. Podsypanin. “A generalization of the continued fraction algorithm that is related to the Viggo Brun algorithm”.Zap. Nauˇ cn. Sem. Leningrad. Otdel. Mat. Inst. Steklov. (LOMI)67 (1977). Studies in number theory (LOMI), 4, pp. 184–194, 227

    work page 1977

  31. [32]

    The combinatorics of frieze patterns and Markoff numbers

    James Propp. “The combinatorics of frieze patterns and Markoff numbers”. Integers20 (2020), Paper No. A12, 38

    work page 2020

  32. [33]

    Perfect matching problems in cluster algebras and number theory

    Ralf Schiffler. “Perfect matching problems in cluster algebras and number theory”.Open problems in algebraic combinatorics. Vol. 110. Proc. Sympos. Pure Math. Amer. Math. Soc., Providence, RI, [2024]©2024, pp. 361–371

    work page 2024

  33. [34]

    CMS Books in Mathematics/Ouvrages de Math´ ematiques de la SMC

    Ralf Schiffler.Quiver representations. CMS Books in Mathematics/Ouvrages de Math´ ematiques de la SMC. Springer, Cham, 2014, pp. xii+230

    work page 2014

  34. [35]

    Schweiger.Multidimensional continued fractions

    F. Schweiger.Multidimensional continued fractions. Oxford Science Publi- cations. Oxford University Press, Oxford, 2000, pp. viii+234. REFERENCES 49

    work page 2000

  35. [36]

    Uniqueness conjectures for extended Markov numbers

    Matty van Son. “Uniqueness conjectures for extended Markov numbers”. ArXiv, https://arxiv.org/abs/1911.00746. Department of Mathematical Sciences, University of Liverpool, Peach Street, Liverpool L69 7ZL Email address:karpenkov@liv.ac.uk IMAG – UMR 5149, Universit ´ee de Montpellier, France Email address:yefei.ma@umontpellier.fr

    work page arXiv 1911