{"title":"Generalization of Markov Diophantine Equation via Generalized Cluster Algebra","authors":"Yasuaki Gyoda, Kodai Matsushita","doi":"10.37236/11420","DOIUrl":null,"url":null,"abstract":"In this paper, we deal with two classes of Diophantine equations, $x^2+y^2+z^2+k_3xy+k_1yz+k_2zx=(3+k_1+k_2+k_3)xyz$ and $x^2+y^4+z^4+2xy^2+ky^2z^2+2xz^2=(7+k)xy^2z^2$, 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.","PeriodicalId":11515,"journal":{"name":"Electronic Journal of Combinatorics","volume":"40 6","pages":"0"},"PeriodicalIF":0.7000,"publicationDate":"2023-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Electronic Journal of Combinatorics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.37236/11420","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0
Abstract
In this paper, we deal with two classes of Diophantine equations, $x^2+y^2+z^2+k_3xy+k_1yz+k_2zx=(3+k_1+k_2+k_3)xyz$ and $x^2+y^4+z^4+2xy^2+ky^2z^2+2xz^2=(7+k)xy^2z^2$, 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.
期刊介绍:
The Electronic Journal of Combinatorics (E-JC) is a fully-refereed electronic journal with very high standards, publishing papers of substantial content and interest in all branches of discrete mathematics, including combinatorics, graph theory, and algorithms for combinatorial problems.