Markov polynomial Newton-polygon saturation conjecture

Let ρ=a/b\rho=a/b be a rational number, and let Δa/b\Delta_{a/b} be the Newton polygon of the numerator of the Markov polynomial Mρ(x,y,z)M_\rho(x,y,z), consisting of the integer points i,j0i,j\geq0 satisfying

ia+jb1,i+ja+b1.\frac{i}{a}+\frac{j}{b}\geq1,\qquad i+j\leq a+b-1.

Saturation conjecture. The terms appearing in the numerator of MρM_\rho are precisely those corresponding to the integer lattice points in Δρ\Delta_\rho. The conjecture is an equivalent explicit formulation of the assertion that all coefficients associated with lattice points of the Newton polygon are positive; the source gives no resolution.

Sources & referencesView supporting material

Primary source

S. J. Evans, A. P. Veselov and B. Winn, “Arithmetic and geometry of Markov polynomials”, arXiv:2501.14882 (2025).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.