Arithmetic and geometry of Markov polynomials

Abstract

Markov polynomials are the Laurent-polynomial solutions of the generalised Markov equation X2 + Y2 + Z2 = kXYZ, k=x2 + y2 + z2x y z which are the results of cluster mutations applied to the initial triple (x, y, z). They were first introduced and studied by Itsara, Musiker, Propp and Viana, who proved, in particular, that their coefficients are non-negative integers. We study the coefficients of Markov polynomials as functions on the corresponding Newton polygons, proposing several new conjectures. Some of these conjectures are proved for the special cases of Markov polynomials corresponding to Fibonacci and Pell numbers.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…