Related papers: Cluster Alphabets from Generalized Worldsheets: A …
We introduce the notion of "binary" positive and complex geometries, giving a completely rigid geometric realization of the combinatorics of generalized associahedra attached to any Dynkin diagram. We also define open and closed "cluster…
A clustering algorithm partitions a set of data points into smaller sets (clusters) such that each subset is more tightly packed than the whole. Many approaches to clustering translate the vector data into a graph with edges reflecting a…
We consider two algebras of curves associated to an oriented surface of finite type - the cluster algebra from combinatorial algebra, and the skein algebra from quantum topology. We focus on generalizations of cluster algebras and…
The aggregated journal-journal citation matrix derived from the Journal Citation Reports 2001 can be decomposed into a unique subject classification by using the graph-analytical algorithm of bi-connected components. This technique was…
We establish basic properties of cluster algebras associated with oriented bordered surfaces with marked points. In particular, we show that the underlying cluster complex of such a cluster algebra does not depend on the choice of…
Cluster-tilted algebras are trivial extensions of tilted algebras. This correspondence induces a surjective map from tilted algebras to cluster-tilted algebras. If B is a cluster-tilted algebra, we use the fibre of B under this map to study…
We establish an algorithm to encrypt and decrypt messages, where messages can be seen as elements of a finite field, using of mutations in a cluster algebra finite type.
Let $S$ be a surface, $G$ a simply-connected classical group, and $G'$ the associated adjoint form of the group. In \cite{FG1}, it was shown that the moduli spaces of framed local systems $\X_{G',S}$ and $\A_{G,S}$ have the structure of…
We define generalized cluster states based on finite group algebras in analogy to the generalization of the toric code to the Kitaev quantum double models. We do this by showing a general correspondence between systems with CSS structure…
We present a categorification of four mutation finite cluster algebras by the cluster category of the category of coherent sheaves over a weighted projective line of tubular weight type. Each of these cluster algebras which we call tubular…
We construct a graded cluster algebra structure on the Cox ring of a smooth complex variety $Z$, depending on a base cluster structure on the ring of regular functions of an open subset $Y$ of $Z$. After considering some elementary examples…
We categorify various finite-type cluster algebras with coefficients using completed orbit categories associated to Frobenius categories. Namely, the Frobenius categories we consider are the categories of finitely generated Gorenstein…
The canonical bases of cluster algebras of finite types and rank 2 are given explicitly in \cite{CK2005} and \cite{SZ} respectively. In this paper, we will deduce $\mathbb{Z}$-bases for cluster algebras for affine types…
We obtain a multiplication formula for cluster characters on (stably) 2-Calabi-Yau (Frobenius or) triangulated categories. This formula generalizes those known for arbitrary pairs of objects and for Auslander-Reiten triangles. As an…
We study the cluster automorphism group of a skew-symmetric cluster algebra with geometric coefficients. For this, we introduce the notion of gluing free cluster algebra, and show that under a weak condition the cluster automorphism group…
Recently, Ramos and Whiting showed that any generalized cluster algebra of geometric type is isomorphic to a quotient of a subalgebra of a certain cluster algebra. Based on their idea and method, we show that the same property holds for any…
The cluster analysis of very large objects is an important problem, which spans several theoretical as well as applied branches of mathematics and computer science. Here we suggest a novel approach: under assumption of local convergence of…
In this paper, we use subword complexes to provide a uniform approach to finite type cluster complexes and multi-associahedra. We introduce, for any finite Coxeter group and any nonnegative integer k, a spherical subword complex called…
We propose a novel graph clustering method guided by additional information on the underlying structure of the clusters (or communities). The problem is formulated as the matching of a graph to a template with smaller dimension, hence…
This paper aims to employ a cluster-theoretic approach to provide a class of Diophantine equations whose solutions can be obtained by starting from initial solutions through mutations. We establish a novel framework bridging cluster theory…