English
Related papers

Related papers: Diophantine equations via cluster transformations

200 papers

This is an introduction to some aspects of Fomin-Zelevinsky's cluster algebras and their links with the representation theory of quivers and with Calabi-Yau triangulated categories. It is based on lectures given by the author at summer…

Representation Theory · Mathematics 2010-03-23 Bernhard Keller

We complete classification of mutation-finite cluster algebras by extending the technique derived by Fomin, Shapiro, and Thurston to skew-symmetrizable case. We show that for every mutation-finite skew-symmetrizable matrix a diagram…

Combinatorics · Mathematics 2019-10-25 Anna Felikson , Michael Shapiro , Pavel Tumarkin

We examine an infinite, linear system of ordinary differential equations that models the evolution of fragmenting clusters, where each cluster is assumed to be composed of identical units. In contrast to previous investigations into such…

Functional Analysis · Mathematics 2024-06-17 Lyndsay Kerr , Wilson Lamb , Matthias Langer

We solve the Diophantine equations $x^5 + y^5 = dz^p$ with $d=2, 3$ for a set of prime numbers of density 1/4, 1/2, respectively. The method consists in relating a possible solution to another Diophantine equation and solving the later by…

Number Theory · Mathematics 2011-03-29 Luis Dieulefait , Nuno Freitas

Markov polynomials are the Laurent-polynomial solutions of the generalised Markov equation $$X^2 + Y^2 + Z^2 = kXYZ, \quad k=\frac{x^2 + y^2 + z^2}{x y z}$$ which are the results of cluster mutations applied to the initial triple $(x, y,…

Number Theory · Mathematics 2025-07-08 S. J. Evans , A. P. Veselov , B. Winn

We compute the Grothendieck group of certain 2-Calabi--Yau triangulated categories appearing naturally in the study of the link between quiver representations and Fomin--Zelevinsky's cluster algebras. In this setup, we also prove a…

Representation Theory · Mathematics 2010-04-13 Yann Palu

Diophantine equations are multivariate equations, usually polynomial, in which only integer solutions are admitted. A brute force method for finding solutions would be to systematically substitute possible integer solutions and check for…

Number Theory · Mathematics 2024-08-22 Lara Tatli , Paul Stevenson

We solve the Diophantine equation $Y^2=X^3+k$ for all nonzero integers $k$ with $|k| \leq 10^7$. Our approach uses a classical connection between these equations and cubic Thue equations. The latter can be treated algorithmically via lower…

Number Theory · Mathematics 2019-02-20 Michael A. Bennett , Amir Ghadermarzi

We explore a generalization of the Markov numbers that is motivated by a specific generalized cluster algebra arising from an orbifold, in the sense of Chekhov and Shapiro. We give an explicit algorithm for computing these generalized…

Combinatorics · Mathematics 2025-09-01 Esther Banaian , Archan Sen

In this note, we consider general growth-fragmentation equations from a probabilistic point of view. Using Foster-Lyapunov techniques, we study the recurrence of the associated Markov process depending on the growth and fragmentation rates.…

Probability · Mathematics 2016-11-03 Florian Bouguet

Monograph "B. Grechuk, Polynomial Diophantine equations. A systematic approach" suggests solving Diophantine equations systematically in certain order. Many hundreds of the equations are left to the reader. Here, we provide complete…

General Mathematics · Mathematics 2024-12-18 Ashleigh Wilcox

We study the dependence of a cluster algebra on the choice of coefficients. We write general formulas expressing the cluster variables in any cluster algebra in terms of the initial data; these formulas involve a family of polynomials…

Rings and Algebras · Mathematics 2007-05-23 Sergey Fomin , Andrei Zelevinsky

We solve Diophantine equations of the type $ a \, (x^3 \!+ \! y^3 \!+ \! z^3 ) = (x \! + \! y \! + \! z)^3$, where $x,y,z$ are integer variables, and the coefficient $a\neq 0$ is rational. We show that there are infinite families of such…

Number Theory · Mathematics 2025-03-14 Bogdan A. Dobrescu , Patrick J. Fox

We consider the mutation invariants of cluster algebras of rank 2. We characterize the mutation invariants of finite type. Two examples are provided for the affine type and we prove the non-existence of Laurent mutation invariants of…

Representation Theory · Mathematics 2024-05-07 Zhichao Chen , Zixu Li

We show that cluster algebras do not contain non-trivial units and that all cluster variables are irreducible elements. Both statements follow from Fomin and Zelevinsky's Laurent phenomenon. As an application we give a criterion for a…

Rings and Algebras · Mathematics 2013-05-10 Christof Geiß , Bernard Leclerc , Jan Schröer

We introduce a family of cluster algebras of infinite rank associated with root systems of type $A$, $D$, $E$. We show that suitable completions of these cluster algebras are isomorphic to the Grothendieck rings of the categories…

Quantum Algebra · Mathematics 2024-10-30 Christof Geiss , David Hernandez , Bernard Leclerc

Cluster algebras were introduced by S. Fomin and A. Zelevinsky in math.RT/0104151; their study continued in math.RA/0208229, math.RT/0305434. This is a family of commutative rings designed to serve as an algebraic framework for the theory…

Quantum Algebra · Mathematics 2007-05-23 Arkady Berenstein , Andrei Zelevinsky

Acyclic cluster algebras have an interpretation in terms of tilting objects in a Calabi-Yau category defined by some hereditary algebra. For a given quiver $Q$ it is thus desirable to decide if the cluster algebra defined by $Q$ is acyclic.…

Rings and Algebras · Mathematics 2011-11-09 Andre Beineke , Thomas Brüstle , Lutz Hille

Natural phenomenon of coevolution is the reciprocally induced evolutionary change between two or more species or population. Though this biological occurrence is a natural fact, there are only few attempts to use this as a simile in…

Other Computer Science · Computer Science 2012-06-07 Siby Abraham , Sugata Sanyal , Mukund Sanglikar

The elementary theory of bivariate linear Diophantine equations over polynomial rings is used to construct causal lifting factorizations (elementary matrix decompositions) for causal two-channel FIR perfect reconstruction transfer matrices…

Information Theory · Computer Science 2024-12-03 Christopher M. Brislawn