Saturation of Markov Polynomials
Fuente:
arXiv
Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2026
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866914492018851840 |
|---|---|
| author | Evans, Sam J. |
| author_facet | Evans, Sam J. |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2604_18333 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Saturation of Markov Polynomials Evans, Sam J. Combinatorics 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. |
| title | Saturation of Markov Polynomials |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2604.18333 |