Related papers: Cluster Alphabets from Generalized Worldsheets: A …
Let C be the category of finite-dimensional representations of a quantum affine algebra of simply-laced type. We introduce certain monoidal subcategories C_l (l integer) of C and we study their Grothendieck rings using cluster algebras.
We propose a graph clustering formulation based on multicut (a.k.a. weighted correlation clustering) on the complete graph. Our formulation does not need specification of the graph topology as in the original sparse formulation of multicut,…
A word over an ordered alphabet is said to be clustering if identical letters appear adjacently in its Burrows-Wheeler transform. Such words are strictly related to (discrete) interval exchange transformations. We use an extended version of…
In this research, a general theoretical framework for clustering is proposed over specific partial algebraic systems by the present author. Her theory helps in isolating minimal assumptions necessary for different concepts of clustering…
A cluster algebra is a commutative algebra whose structure is decided by a skew-symmetrizable matrix or a quiver. When a skew-symmetrizable matrix is invariant under an action of a finite group and this action is admissible, the folded…
A family of quantum cluster algebras is introduced and studied. In general, these algebras are new, but subclasses have been studied previously by other authors. The algebras are indexed by double partitions or double flag varieties.…
Correlation clustering provides a method for separating the vertices of a signed graph into the optimum number of clusters without specifying that number in advance. The main goal in this type of clustering is to minimize the number of…
For a Coxeter element $c$ of a finite Coxeter group, we consider a family of subword complexes parameterized by reduced expressions of the longest element. This family generalizes $c-$cluster complexes. We describe vertices of these…
We compute the number of points over finite fields of some algebraic varieties related to cluster algebras of finite type. More precisely, these varieties are the fibers of the projection map from the cluster variety to the affine space of…
We introduce a rich family of generalizations of the pentagram map sharing the property that each generates an infinite configuration of points and lines with four points on each line. These systems all have a description as $Y$-mutations…
We present a dataset of word usage graphs (WUGs), where the existing WUGs for multiple languages are enriched with cluster labels functioning as sense definitions. They are generated from scratch by fine-tuned encoder-decoder language…
Geometric methods proposed by Stallings for treating finitely generated subgroups of free groups were successfully used to solve a wide collection of decision problems for free groups and their subgroups. It turns out that Stallings'…
Classification of cluster variables in cluster algebras (in particular, Grassmannian cluster algebras) is an important problem, which has direct application to computations of scattering amplitudes in physics. In this paper, we apply the…
We give an explicit combinatorial description of cluster structures in Schubert varieties of the Grassmannian in terms of (target labelings of) Postnikov's plabic graphs. This description is a natural generalization of the description given…
We develop and prove the analogs of some results shown in [Berenstein A., Fomin S., Zelevinsky A., Duke Math. J. 126 (2005), 1-52] concerning lower and upper bounds of cluster algebras to the generalized cluster algebras of geometric type.…
In the cluster algebra literature, the notion of a graded cluster algebra has been implicit since the origin of the subject. In this work, we wish to bring this aspect of cluster algebra theory to the foreground and promote its study. We…
The clusters of a distribution are often defined by the connected components of a density level set. However, this definition depends on the user-specified level. We address this issue by proposing a simple, generic algorithm, which uses an…
We study the cluster category of a canonical algebra A in terms of the hereditary category of coherent sheaves over the corresponding weighted projective line X. As an application we determine the automorphism group of the cluster category…
In this paper, we present a novel way to summarize the structure of large graphs, based on non-parametric estimation of edge density in directed multigraphs. Following coclustering approach, we use a clustering of the vertices, with a…
In this paper we give a geometric-combinatorial description of the cluster categories of type E. In particular, we give an explicit geometric description of all cluster tilting objects in the cluster category of type E_6. The model we…