Related papers: Recognizing Cluster Algebras of Finite type
We use variations on Lax type operators to find explicit formulas for certain elements of finite $W$-algebras. These give a complete set of generators for all finite $W$-algebras of types B,C,D for which the Dynkin grading is even.
Let $K$ be a number field with ring of integers $\mathcal{O}_K$. We describe and classify finite, flat, and linearly reductive subgroup schemes of $\mathrm{SL}_2$ over $\mathrm{Spec}\:\mathcal{O}_K$. We also establish finiteness results for…
In this paper, we consider various graphs, namely: power graph, cyclic graph, enhanced power graph and commuting graph, on a finite semigroup $S$. For an arbitrary pair of these four graphs, we classify finite semigroups such that the…
We provide a systematic derivation of cluster alphabets of finite types. The construction is based on a geometric realization of the generalized worldsheets by gluing and folding a pair of polygons. The cross ratios of the worldsheet z…
Finite dimensional modular Lie superalgebras over algebraically closed fields with indecomposable Cartan matrices are classified under some technical, most probably inessential, hypotheses. If the Cartan matrix is invertible, the…
A self-similar group of finite type is the profinite group of all automorphisms of a regular rooted tree that locally around every vertex act as elements of a given finite group of allowed actions. We provide criteria for determining when a…
We give a sufficient condition on totally disconnected topological graphs such that their associated topological graph algebras are purely infinite.
Cluster algebras were introduced by Fomin-Zelevinsky in 2002 in order to give a combinatorial framework for phenomena occurring in the context of algebraic groups. Cluster algebras also have links to a wide range of other subjects,…
We give criteria for a graph of groups to have finite stature with respect to its collection of vertex groups, in the sense of Huang-Wise. We apply it to the triangle Artin groups that were previously shown to split as a graph of groups.…
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…
These graphs generalize both affine and finite type and provide an explanation for some quantum properties of roots of unity.
We compute the automorphism group of the affine surfaces with the coordinate ring isomorphic to a cluster algebra of rank 2.
Given a finite group $G,$ we denote by $\Delta(G)$ the graph whose vertices are the elements $G$ and where two vertices $x$ and $y$ are adjacent if there exists a minimal generating set of $G$ containing $x$ and $y.$ We prove that…
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…
In this paper, we introduce a notion of unistructural cluster algebras, for which the set of cluster variables uniquely determines the clusters. We prove that cluster algebras of Dynkin type and cluster algebras of rank 2 are unistructural,…
We present a classification of characteristic Dynkin diagrams for the $A_N$, $B_N$, $C_N$ and $D_N$ algebras. This classification is related to the classification of \cw(\cg,\ck) algebras arising from non-Abelian Toda models, and we argue…
We give an example of a finite-dimensional algebra with a 2-cluster tilting module and a simple module which has infinite complexity. This answers a question of Erdmann and Holm.
In this paper, we study algebras of global dimension at most 2 whose generalized cluster category is equivalent to the cluster category of an acyclic quiver which is either a tree or of type $\widetilde{A}$. We are particularly interested…
Cluster algebras have recently become an important player in mathematics and physics. In this work, we investigate them through the lens of modern data science, specifically with techniques from network science and machine learning. Network…
Bounds on the minimum degree and on the number of vertices at- taining it have been much studied for finite edge-/vertex-minimally k- connected/k-edge-connected graphs. We give an overview of the results known for finite graphs, and show…