Related papers: A determinantal formula for cluster variables in c…

Snake graphs are a class of planar graphs that are important in the theory of cluster algebras. Indeed, the Laurent expansions of the cluster variables in cluster algebras from surfaces are given as weight generating functions for 1-dimer…

Generalized cluster algebras from orbifolds were defined by Chekhov and Shapiro to give a combinatorial description of their Teichm\"uller spaces. One can also assign a gentle algebra to a triangulated orbifold, as in the work of…

Let $\mathcal{C}$ be a Hom-finite triangulated 2-Calabi-Yau category with a cluster tilting object. Under some constructibility assumptions on $\mathcal{C}$ which are satisfied for instance by cluster categories, by generalized cluster…

We describe an infinite family of non-Pl\"ucker cluster variables inside the double Bruhat cell cluster algebra defined by Berenstein, Fomin, and Zelevinsky. These cluster variables occur in a family of subalgebras of the double Bruhat cell…

The objective functions used in spectral clustering are usually composed of two terms: i) a term that minimizes the local quadratic variation of the cluster assignments on the graph and; ii) a term that balances the clustering partition and…

The article gives a ring theoretic perspective on cluster algebras. Gei{\ss}-Leclerc-Schr\"oer prove that all cluster variables in a cluster algebra are irreducible elements. Furthermore, they provide two necessary conditions for a cluster…

The mixture models have become widely used in clustering, given its probabilistic framework in which its based, however, for modern databases that are characterized by their large size, these models behave disappointingly in setting out the…

For an unpunctured marked surface $\Sigma$, we consider a skein algebra $\mathscr{S}_{\mathfrak{sl}_{3},\Sigma}^{q}$ consisting of $\mathfrak{sl}_3$-webs on $\Sigma$ with the boundary skein relations at marked points. We construct a quantum…

A cluster algebra is an algebraic structure generated by operations of a quiver (a directed graph) called the mutations and their associated simple birational mappings. By using a graph-combinatorial approach, we present a systematic way to…

Data clustering is a fundamental problem with a wide range of applications. Standard methods, eg the $k$-means method, usually require solving a non-convex optimization problem. Recently, total variation based convex relaxation to the…

Biological and social systems consist of myriad interacting units. The interactions can be represented in the form of a graph or network. Measurements of these graphs can reveal the underlying structure of these interactions, which provides…

Effective computation of resultants is a central problem in elimination theory and polynomial system solving. Commonly, we compute the resultant as a quotient of determinants of matrices and we say that there exists a determinantal formula…

We study clustering algorithms based on neighborhood graphs on a random sample of data points. The question we ask is how such a graph should be constructed in order to obtain optimal clustering results. Which type of neighborhood graph…

We provide a cluster-algebraic approach to the computation of the recently introduced generalised biadjoint scalar amplitudes related to Grassmannians ${\rm Gr}(k,n)$. A finite cluster algebra provides a natural triangulation for the…

Let $Q$ be an euclidean quiver. Using friezes in the sense of Assem-Reutenauer-Smith, we provide an algorithm for computing the (canonical) cluster character associated to any object in the cluster category of $Q$. In particular, this…

Generalising a recent work of Dequ\^ene et al. on the connection between perfectly clustering words and band bricks over a particular family of gentle algebras, we characterise band bricks over string algebras whose underlying quiver is…

We construct cluster algebras the variables and coefficients of which satisfy the discrete mKdV equation, the discrete Toda equation and other integrable bilinear equations, several of which lead to q-discrete Painlev\'e equations. These…

In this paper, we prove some combinatorial results on generalized cluster algebras. To be more precisely, we prove that (i) the seeds of a generalized cluster algebra $\mathcal A(\mathcal S)$ whose clusters contain particular cluster…

In 2003, Fomin and Zelevinsky obtained Cartan-Killing type classification of all cluster algebras of finite type, i.e. cluster algebras having only finitely many distinct cluster variables. A wider class of cluster algebras is formed by…

We derive an efficient method to perform clustering of nodes in Gaussian graphical models directly from sample data. Nodes are clustered based on the similarity of their network neighborhoods, with edge weights defined by partial…