Markov polynomial Newton-polygon saturation conjecture
Markov polynomial Newton-polygon saturation conjecture
Let be a rational number, and let be the Newton polygon of the numerator of the Markov polynomial , consisting of the integer points satisfying
Saturation conjecture. The terms appearing in the numerator of are precisely those corresponding to the integer lattice points in . 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
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.