Related papers: Symplectic Maps from Cluster Algebras
We use a cluster ensemble to determine the number of clusters, k, in a group of data. A consensus similarity matrix is formed from the ensemble using multiple algorithms and several values for k. A random walk is induced on the graph…
We introduce a class of commutative superalgebras generalizing cluster algebras. A cluster superalgebra is defined by a hypergraph called an "extended quiver", and transformations called mutations. We prove the super analog of the "Laurent…
In this paper, we extend the iterated integrals from smooth manifolds to digraphs and develop the associated algebraic and geometric structures. Iterated integrals on a digraph naturally give rise to the iterated path algebra and the…
A prototypical examples of a cluster algebra is the coordinate ring of a finite Grassmannian: using the Pl\"ucker embedding the cluster algebra structure allows one to move between `maximal sets' of algebraically independent Pl\"ucker…
We introduce a multivariate generalization of normalized Chebyshev polynomials of the second kind. We prove that these polynomials arise in the context of cluster characters associated to Dynkin quivers of type $\mathbb A$ and…
In this paper, we study algebras of global dimension at most 2 whose generalized cluster category is equivalent to the cluster category of an acyclic quiver which is either a tree or of type $\widetilde{A}$. We are particularly interested…
Our motivation is to build a systematic method in order to investigate the structure of cluster algebras of geometric type. The method is given through the notion of mixing-type sub-seeds, the theory of seed homomorphisms and the view-point…
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 give an explicit description of the mutation classes of quivers of type \tilde{A}_n. Furthermore, we provide a complete classification of cluster tilted algebras of type \tilde{A}_n up to derived equivalence. We show that the bounded…
Non-Hermitian random matrices with symplectic symmetry provide examples for Pfaffian point processes in the complex plane. These point processes are characterised by a matrix valued kernel of skew-orthogonal polynomials. We develop their…
Cluster integrable systems are a broad class of integrable systems modelled on bipartite dimer models on the torus. Many discrete integrable dynamics arise by applying sequences of local transformations, which form the cluster modular group…
We construct and study cluster algebra structures in rings of invariants of the special linear group action on collections of three-dimensional vectors, covectors, and matrices. The construction uses Kuperberg's calculus of webs on marked…
The classification of Grassmannian cluster algebras resembles that of regular polygonal tilings. We conjecture that this resemblance may indicate a deeper connection between these seemingly unrelated structures.
The theory of Caldero-Chapoton algebras of Cerulli-Irelli, Labardini-Fragoso and Schroer leads to a refinement of the notions of cluster variables and clusters, via so called component clusters. In this paper we compare component clusters…
We describe and investigate a connection between the topology of isolated singularities of plane curves and the mutation equivalence, in the sense of cluster algebra theory, of the quivers associated with their morsifications.
We show that having any planar (cyclic or acyclic) directed network on a disc with the only condition that all $n_1+m$ sources are separated from all $n_2+m$ sinks, we can construct a cluster-algebra realization of elements of an affine…
Convex clustering is a well-regarded clustering method, resembling the similar centroid-based approach of Lloyd's $k$-means, without requiring a predefined cluster count. It starts with each data point as its centroid and iteratively merges…
This paper investigates some issues arising in categorical models of reversible logic and computation. Our claim is that the structural (coherence) isomorphisms of these categorical models, although generally overlooked, have decidedly…
We introduce a property of mutation loops, called the sign stability, with a focus on an asymptotic behavior of the iteration of the tropical $\mathcal{X}$-transformation. A sign-stable mutation loop has a numerical invariant which we call…
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…