Proves the saturation conjecture for Markov polynomials using a constructive argument based on the Markov snake graph.
AignerMarkov’s Theorem and 100 Years of the Uniqueness Conjecture: A Mathematical Journey from Irrational Numbers to Perfect Matchings
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Markov fractions coincide with the indices of Cohn matrices, giving a concatenation rule for continued fractions on the Conway topograph.
citing papers explorer
-
Saturation of Markov Polynomials
Proves the saturation conjecture for Markov polynomials using a constructive argument based on the Markov snake graph.
-
Markov fractions and Cohn matrices
Markov fractions coincide with the indices of Cohn matrices, giving a concatenation rule for continued fractions on the Conway topograph.