Related papers: On webs, polylogarithms and cluster algebras
We construct and study cluster algebra structures in rings of invariants of the special linear group action on collections of three-dimensional vectors, covectors, and matrices. The construction uses Kuperberg's calculus of webs on marked…
We suggest a definition of cluster polylogarithms on an arbitrary cluster variety and classify them in type $A$. We find functional equations for multiple polylogarithms which generalize equations discovered by Abel, Kummer, and Goncharov…
Cluster algebras are categorified by cluster categories, and $g$-vectors are categorified by the classic index with respect to cluster tilting subcategories. However, the recently introduced completed discrete cluster categories of Dynkin…
A cluster is a finite set of generators of a cluster algebra. The Laurent Phenomenon of Fomin and Zelevinsky says that any element of a cluster algebra can be written as a Laurent polynomial in terms of any cluster. The upper cluster…
The cluster category is a triangulated category introduced for its combinatorial similarities with cluster algebras. We prove that a cluster algebra A of finite type can be realized as a Hall algebra, called the exceptional Hall algebra, of…
Holm and Jorgensen have shown the existence of a cluster structure on a certain category $D$ that shares many properties with finite type $A$ cluster categories and that can be fruitfully considered as an infinite analogue of these. In this…
This is an introductory survey on cluster algebras and their (additive) categorification using derived categories of Ginzburg algebras. After a gentle introduction to cluster combinatorics, we review important examples of coordinate rings…
Cluster ensemble is a pair of positive spaces (X, A) related by a map p: A -> X. It generalizes cluster algebras of Fomin and Zelevinsky, which are related to the A-space. We develope general properties of cluster ensembles, including its…
We compute the list of all minimal 2-infinite diagrams, which are cluster algebraic analogues of extended Dynkin graphs.
We give a uniform geometric realization for the cluster algebra of an arbitrary finite type with principal coefficients at an arbitrary acyclic seed. This algebra is realized as the coordinate ring of a certain reduced double Bruhat cell in…
We study cluster algebras for some all-loop Feynman integrals, including box-ladder, penta-box-ladder, and (seven-point) double-penta-ladder integrals. In addition to the well-known box ladder whose symbol alphabet is $D_2\simeq A_1^2$, we…
We give a combinatorial interpretation for certain cluster variables in Grassmannian cluster algebras in terms of double and triple dimer configurations. More specifically, we examine several Gr(3,n) cluster variables that may be written as…
The classification of Grassmannian cluster algebras resembles that of regular polygonal tilings. We conjecture that this resemblance may indicate a deeper connection between these seemingly unrelated structures.
The structure of many real networks is not locally tree-like and hence, network analysis fails to characterise their bond percolation properties. In a recent paper [P. Mann, V. A. Smith, J. B. O. Mitchell, and S. Dobson, Percolation in…
To each tagged triangulation of a surface with marked points and non-empty boundary we associate a quiver with potential, in such a way that whenever we apply a flip to a tagged triangulation, the Jacobian algebra of the QP associated to…
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…
Motivated by applications in social and biological network analysis, we introduce a new form of agnostic clustering termed~\emph{motif correlation clustering}, which aims to minimize the cost of clustering errors associated with both edges…
Cluster algebras are a recent topic of study and have been shown to be a useful tool to characterize structures in several knowledge fields. An important problem is to establish whether or not a given cluster algebra is of finite type.…
We show that in case a cluster algebra coincides with its upper cluster algebra and the cluster algebra admits a grading with finite dimensional homogeneous components, the corresponding Berenstein-Zelevinsky quantum cluster algebra can be…
Document networks are characteristic in that a document node, e.g. a webpage or an article, carries meaningful content. Properties of document networks are not only affected by topological connectivity between nodes, but also strongly…