Proves the saturation conjecture for Markov polynomials using a constructive argument based on the Markov snake graph.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
math.CO 2years
2026 2representative citing papers
citing papers explorer
-
Saturation of Markov Polynomials
Proves the saturation conjecture for Markov polynomials using a constructive argument based on the Markov snake graph.
- Wug-snake graphs and Markov numbers of matrix semigroups