Generalization of Markov Diophantine Equation via Generalized Cluster Algebra

3Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.

Abstract

In this paper, we deal with two classes of Diophantine equations, x2 + y2 + z2 + k3 xy + k1 yz + k2 zx = (3 + k1 + k2 + k3)xyz and x2 + y4 + z4 + 2xy2 + ky2 z2 + 2xz2 = (7+k)xy2 z2, 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.

Cite

CITATION STYLE

APA

Gyoda, Y., & Matsushita, K. (2023). Generalization of Markov Diophantine Equation via Generalized Cluster Algebra. Electronic Journal of Combinatorics, 30(4). https://doi.org/10.37236/11420

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free