Related papers: Cluster Alphabets from Generalized Worldsheets: A …
We introduce a category of cluster algebras with fixed initial seeds. This category has countable coproducts, which can be constructed combinatorially, but no products. We characterise isomorphisms and monomorphisms in this category and…
We develop a general approach to finding combinatorial models for cluster algebras. The approach is to construct a labeled graph called a framework. When a framework is constructed with certain properties, the result is a model…
We show the existence of generalized clusters of a finite or even infinite number of sets, with minimal total perimeter and given total masses, in metric measure spaces homogeneous with respect to a group acting by measure preserving…
Motivated by the theory of cluster algebras, F. Chapoton, S. Fomin and A. Zelevinsky associated to each finite type root system a simple convex polytope called \emph{generalized associahedron}. They provided an explicit realization of this…
Let $G$ be a simply connected simple algebraic group over $\mathbb{C}$, $B$ and $B_-$ be its two opposite Borel subgroups. For two elements $u$, $v$ of the Weyl group $W$, it is known that the coordinate ring ${\mathbb C}[G^{u,v}]$ of the…
We construct the intermediate coverings of cluster-tilted algebras by defining the generalized cluster categories. These generalized cluster categories are Calabi-Yau triangulated categories with fraction CY-dimension and have also cluster…
The construction of partially compactified cluster algebras on coordinate rings is handled by using codimension 2 arguments on cluster covers. An analog of this in the quantum situation is highly desirable but has not been found yet. In…
For any cluster algebra whose underlying combinatorial data can be encoded by a bordered surface with marked points, we construct a geometric realization in terms of suitable decorated Teichmueller space of the surface. On the geometric…
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…
Clustering is a popular unsupervised learning tool often used to discover groups within a larger population such as customer segments, or patient subtypes. However, despite its use as a tool for subgroup discovery and description - few…
The (usual) Caldero-Chapoton map is a map from the set of objects of a category to a Laurent polynomial ring over the integers. In the case of a cluster category, it maps "reachable" indecomposable objects to the corresponding cluster…
For a classical group $G$ and a Coxeter element $c$ of the Weyl group, it is known that the coordinate ring $\mathbb{C}[G^{e,c^2}]$ of the double Bruhat cell $G^{e,c^2}:=B\cap B_-c^2B_-$ has a structure of cluster algebra of finite type,…
We construct finite volume hyperbolic manifolds with large symmetry groups. The construction makes use of the presentations of finite Coxeter groups provided by Barot and Marsh and involves mutations of quivers and diagrams defined in the…
We give a precise definition of folded quivers and folded cluster algebras. We give many examples of including some with finite mutation structure that do not have analogues in the unfolded cases. We relate these examples to the finite…
It has been established in recent years how to approach acyclic cluster algebras of finite type using subword complexes. In this paper, we continue this study by describing the c- and g-vectors, and by providing a conjectured description of…
As a kind of basic machine learning method, clustering algorithms group data points into different categories based on their similarity or distribution. We present a clustering algorithm by finding hyper-planes to distinguish the data…
We generalize the brick polytope of V. Pilaud and F. Santos to spherical subword complexes for finite Coxeter groups. This construction provides polytopal realizations for a certain class of subword complexes containing all cluster…
The paper develops a general framework for constrained clustering which is based on the close connection of geometric clustering and diagrams. Various new structural and algorithmic results are proved (and known results generalized and…
We introduce an algorithm to generate multivariate series of symbols from a finite alphabet with a given hierarchical structure of similarities. The target hierarchical structure of similarities is arbitrary, for instance the one obtained…
We initiate the study of cluster algebras in Feynman integrals in dimensional regularization. We provide evidence that four-point Feynman integrals with one off-shell leg are described by a $C_{2}$ cluster algebra, and we find cluster…