Markov polynomial weak log-concavity conjecture

Let MρM_\rho be a Markov polynomial, and let its coefficients be regarded as weights on the corresponding Newton polygon. A sequence is log-concave when xk2xk1xk+1x_k^2\geq x_{k-1}x_{k+1} for every interior index kk. The weights satisfy weak log-concavity when their sequences in the horizontal, vertical, and diagonal directions with i+ji+j constant are all log-concave. Log-concavity conjecture. The coefficients of Markov polynomials are weakly log-concave on the corresponding Newton polygon. This extends the observed coefficient-positivity phenomenon to a directional log-concavity property; the source reports experimental evidence but no proof or 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.