Generalization of Markov Diophantine equation via generalized cluster algebra

Abstract

In this paper, we deal with two classes of Diophantine equations, x2+y2+z2+k1yz+k2zx+k3xy=(3+k1+k2+k3)xyz and x2+y4+z4+ky2z2+2xz2+2xy2=(7+k)xy2z2, where k1,k2,k3,k are nonnegative integers. The former is known as the Markov Diophantine equation if k1=k2=k3=0, and the latter is a Diophantine equation recently studied by Lampe if k=0. We give algorithms to enumerate all positive integer solutions to these equations, and discuss the structures of the generalized cluster algebras behind them.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…