Related papers: Mutation-classes of diagrams via infinite graphs
We compute the list of all minimal 2-infinite diagrams, which are cluster algebraic analogues of extended Dynkin graphs.
To a directed graph without loops and 2-cycles, we can associate a skew-symmetric matrix with integer entries. Mutations of such skew-symmetric matrices, and more generally skew-symmetrizable matrices, have been defined in the context of…
We give a complete classification of torsion pairs in the cluster category of Dynkin type A_n. Along the way we give a new combinatorial description of Ptolemy diagrams, an infinite version of which was introduced by Ng. This allows us to…
We show that the mutation class of a finite quiver without oriented cycles is finite if and only is the quiver is either Dynkin, extended Dynkin or has at most two vertices.
In this paper, we prove Conjecture 4.8 of "Cluster algebras IV" by S. Fomin and A. Zelevinsky, stating that the mutation classes of rectangular matrices associated with cluster algebras of finite type are precisely those classes which are…
We give a complete classification of torsion pairs in the cluster category of Dynkin type D_n, via a bijection to new combinatorial objects called Ptolemy diagrams of type D. For the latter we give along the way different combinatorial…
We show how a cluster-tilted algebra of finite representation type is related to the corresponding tilted algebra, in the case of algebras defined over an algebraically closed field.
In this article, we introduce the notion of cluster automorphism of a given cluster algebra as a $\ZZ$-automorphism of the cluster algebra that sends a cluster to another and commutes with mutations. We study the group of cluster…
The aim of this note is to describe a geometric relation between simple plane curve singularities classified by simply laced Cartan matrices and cluster varieties of finite type also classified by the simply laced Cartan matrices. We…
In this paper, we define and classify the sign-equivalent exchange matrices. We give a Diophantine explanation for the differences between rank 2 cluster algebras of finite type and affine type based on \cite{CL24}. We classify the positive…
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…
We classify mutation-finite cluster algebras with arbitrary coefficients of geometric type.
In 2003, Fomin and Zelevinsky proved that finite type cluster algebras can be classified by Dynkin diagrams. Then in 2013, Barot and Marsh defined the presentation of a reflection group associated to a Dynkin diagram in terms of an…
We provide an explicit Dynkin diagrammatic description of the c-vectors and the d-vectors (the denominator vectors) of any cluster algebra of finite type with principal coefficients and any initial exchange matrix. We use the surface…
We provide a far reaching derived equivalence classification of the cluster-tilted algebras of Dynkin type D and suggest standard forms for the derived equivalence classes. We believe that the classification is complete, but some subtle…
This paper continues the study of cluster algebras initiated in math.RT/0104151. Its main result is the complete classification of the cluster algebras of finite type, i.e., those with finitely many clusters. This classification turns out…
For each Dynkin diagram $D$, we define a ''cluster configuration space'' ${\mathcal{M}}_D$ and a partial compactification ${\widetilde {\mathcal{M}}}_D$. For $D = A_{n-3}$, we have ${\mathcal{M}}_{A_{n-3}} = {\mathcal{M}}_{0,n}$, the…
We study cluster tilting modules in mesh algebras of Dynkin type, providing a new proof for their existence. In all but one case, we show that these are precisely the maximal rigid modules, and that they are equivariant for a certain…
Dyck paths categories are introduced as a combinatorial model of the category of representations of quivers of Dynkin type An. In particular, it is proved that there is a bijection between some Dyck paths and perfect matchings of some snake…
In this dissertation, we explore the structure of inversion graphs of permutations--a class of graphs that naturally arises by representing each permutation as a graph, where vertices correspond to entries and edges encode inversions.…