Related papers: Combinatorial frameworks for cluster algebras
One can explicitly compute the generators of a surface cluster algebra either combinatorially, through dimer covers of snake graphs, or homologically, through the CC-map applied to indecomposable modules over the appropriate algebra. Recent…
Combinatorial group testing (CGT) is used to identify defective items from a set of items by grouping them together and performing a small number of tests on the groups. Recently, group testing has been used to design efficient COVID-19…
Spectral clustering methods are known for their ability to represent clusters of diverse shapes, densities etc. However, results of such algorithms, when applied e.g. to text documents, are hard to explain to the user, especially due to…
In the mixture modeling frame, this paper presents the polynomial Gaussian cluster-weighted model (CWM). It extends the linear Gaussian CWM, for bivariate data, in a twofold way. Firstly, it allows for possible nonlinear dependencies in the…
Admissible chains of i-boxes are important combinatorial tools in the monoidal categorification of cluster algebras, as they provide seeds of the cluster algebra. In this paper, we explore the properties of maximal commuting families of…
Purpose: This study extends the structural theory of finite commutative ternary $\Gamma$-semirings into a computational and categorical framework for explicit classification and constructive reasoning. Methods: Constraint-driven enumeration…
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 prove a multiplication theorem for quantum cluster algebras of acyclic quivers. The theorem generalizes the multiplication formula for quantum cluster variables in \cite{fanqin}. We apply the formula to construct some $\mathbb{ZP}$-bases…
In recent work, the authors developed a simple method of constructing topological spaces from certain well-behaved partially ordered sets -- those coming from sequences of relations between finite sets. This method associates a given poset…
An important problem in the theory of cluster algebras is to compute the fundamental group of the exchange graph. A non-trivial closed loop in the exchange graph, for example, generates a non-trivial identity for the classical and quantum…
It is known that many (upper) cluster algebras are not unique factorization domains. We exhibit the local factorization properties with respect to any given seed $t$: any non-zero element in a full rank upper cluster algebra can be uniquely…
Clustering is a powerful and extensively used data science tool. While clustering is generally thought of as an unsupervised learning technique, there are also supervised variations such as Spath's clusterwise regression that attempt to…
We describe a new way to relate an acyclic, skew-symmetrizable cluster algebra to the representation theory of a finite dimensional hereditary algebra. This approach is designed to explain the c-vectors of the cluster algebra. We obtain a…
In this paper, we construct a combinatorial algebra of partial isomorphisms that gives rise to a "projective limit" of the centers of the group algebras C[GL(n,Fq)]. It allows us to prove a GL(n,Fq)-analogue of an old theorem of Farahat and…
We propose and study a novel graph clustering method for data with an intrinsic network structure. Similar to spectral clustering, we exploit an intrinsic network structure of data to construct Euclidean feature vectors. These feature…
In a series of previous papers, we studied sortable elements in finite Coxeter groups, and the related Cambrian fans. We applied sortable elements and Cambrian fans to the study of cluster algebras of finite type and the noncrossing…
Circulant matrices are an important tool widely used in coding theory and cryptography. A circulant matrix is a square matrix whose rows are the cyclic shifts of the first row. Such a matrix can be efficiently stored in memory because it is…
We construct a cluster algebra structure within the quantum cohomology ring of a quiver variety associated with an $A$-type quiver. Specifically, let $Fl:=Fl(N_1,\ldots,N_{n+1})$ denote a partial flag variety of length $n$, and…
A hypergraph is a useful combinatorial object to model ternary or higher-order relations among entities. Clustering hypergraphs is a fundamental task in network analysis. In this study, we develop two clustering algorithms based on…
The majority of model-based clustering techniques is based on multivariate Normal models and their variants. In this paper copulas are used for the construction of flexible families of models for clustering applications. The use of copulas…