Saturation of Markov Polynomials
Combinatorics
2026-04-21 v1
Abstract
Solutions to the Markov equation appear in many mathematical contexts. We aim to build on the understanding of them by proving a recent conjecture about Markov polynomials; solutions to a generalised version of the Markov equation. The proof we provide is a constructive argument based on the Markov snake graph, a combinatorial object related to Markov numbers, deepening the connection between the Markov equation and combinatorics.
Cite
@article{arxiv.2604.18333,
title = {Saturation of Markov Polynomials},
author = {Sam J. Evans},
journal= {arXiv preprint arXiv:2604.18333},
year = {2026}
}
Comments
11 pages