Related papers: Subword complexes, cluster complexes, and generali…
Associated to any acyclic cluster algebra is a corresponding triangulated category known as the cluster category. It is known that there is a one-to-one correspondence between cluster variables in the cluster algebra and exceptional…
We introduce the notion of a lower bound cluster algebra generated by projective cluster variables as a polynomial ring over the initial cluster variables and the so-called projective cluster variables. We show that under an acyclicity…
We show that the coordinate ring of the Vinberg monoid of a simply connected semisimple complex group is an upper cluster algebra. As an application, we construct cluster structures on a large class of flat reductive monoids. After…
Clustering is often a challenging problem because of the inherent ambiguity in what the "correct" clustering should be. Even when the number of clusters $K$ is known, this ambiguity often still exists, particularly when there is variation…
We complete classification of mutation-finite cluster algebras by extending the technique derived by Fomin, Shapiro, and Thurston to skew-symmetrizable case. We show that for every mutation-finite skew-symmetrizable matrix a diagram…
Using the classical universal coefficient theorem of Rosenberg-Schochet, we prove a simple classification of all localizing subcategories of the Bootstrap category of separable complex C*-algebras. Namely, they are in bijective…
We study two complexity notions of groups - a computable Scott sentence and the index set of a group. Finding the exact complexity of one of them usually involves finding the complexity of the other, but this is not the case sometimes. J.…
The fuzzy or soft $k$-means objective is a popular generalization of the well-known $k$-means problem, extending the clustering capability of the $k$-means to datasets that are uncertain, vague, and otherwise hard to cluster. In this paper,…
This note which can be viewed as a complement to Alex Postnikov's paper math.CO/0507163, presents a self-contained overview of basic properties of nested complexes and their two dual polyhedral realizations: as complete simplicial fans, and…
We outline a novel clustering scheme for simplicial complexes that produces clusters of simplices in a way that is sensitive to the homology of the complex. The method is inspired by, and can be seen as a higher-dimensional version of,…
We introduce the concept of cotensor coalgebra for a given bicomodule over a coalgebra in an abelian monoidal category. Under some further conditions we show that such a cotensor coalgebra exists and satisfies a meaningful universal…
Clustering can be defined as the process of assembling objects into a number of groups whose elements are similar to each other in some manner. As a technique that is used in many domains, such as face clustering, plant categorization,…
We extend the homotopy theories based on point reduction for finite spaces and simplicial complexes to finite acyclic categories and $\Delta$-complexes, respectively. The functors of classifying spaces and face posets are compatible with…
The paper is motivated by an analogy between cluster algebras and Kac-Moody algebras: both theories share the same classification of finite type objects by familiar Cartan-Killing types. However the underlying combinatorics beyond the two…
We study skew-symmetrizable cluster algebras $\mathcal{A}$ associated with unpunctured surfaces $\tilde{\mathbf{S}}$ endowed with an orientation-preserving involution $\sigma$. We give a geometric realization of such cluster algebras by…
In recent years, there has been a growing demand to discern clusters of subjects in datasets characterized by a large set of features. Often, these clusters may be highly variable in size and present partial hierarchical structures. In this…
We establish ring isomorphisms between quantum Grothendieck rings of certain remarkable monoidal categories of finite-dimensional representations of quantum affine algebras of types $A_{2n-1}^{(1)}$ and $B_n^{(1)}$. Our proof relies in part…
We put cluster tilting in ageneral framework by showing that any quotient of a triangulated category modulo a tilting subcategory (that is, a maximal one-orthogonal subcategory) carries an abelian structure. These abelian quotients turn out…
Subspace clustering is the problem of clustering data that lie close to a union of linear subspaces. In the abstract form of the problem, where no noise or other corruptions are present, the data are assumed to lie in general position…
After generalizing the concept of clusters to incorporate clusters that are linked to other clusters through some relatively narrow bridges, an approach for detecting patches of separation between these clusters is developed based on an…