2000 character limit reached
Generalization of Markov Diophantine equation via generalized cluster algebra
Published 26 Jan 2022 in math.NT and math.CO | (2201.10919v3)
Abstract: In this paper, we deal with two classes of Diophantine equations, $x2+y2+z2+k_1yz+k_2zx+k_3xy=(3+k_1+k_2+k_3)xyz$ and $x2+y4+z4+ky2z2+2xz2+2xy2=(7+k)xy2z2$, where $k_1,k_2,k_3,k$ are nonnegative integers. The former is known as the Markov Diophantine equation if $k_1=k_2=k_3=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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.