Related papers: Combinatorial cluster expansion formulas from tria…
Spectral clustering is one of the most popular clustering algorithms that has stood the test of time. It is simple to describe, can be implemented using standard linear algebra, and often finds better clusters than traditional clustering…
We consider the quantum cluster algebras which are injective-reachable and introduce a triangular basis in every seed. We prove that, under some initial conditions, there exists a unique common triangular basis with respect to all seeds.…
We provide a pedagogical introduction to numerical linked-cluster expansions (NLCEs). We sketch the algorithm for generic Hamiltonians that only connect nearest-neighbor sites in a finite cluster with open boundary conditions. We then…
We consider the problem of correlation clustering on graphs with constraints on both the cluster sizes and the positive and negative weights of edges. Our contributions are twofold: First, we introduce the problem of correlation clustering…
Berenstein and Zelevinsky introduced quantum cluster algebras [Adv. Math, 2005] and the triangular bases [IMRN, 2014]. The support conjecture by Lee-Li-Rupel-Zelevinsky [PNAS, 2014] asserts that the support of a triangular basis element for…
Cluster ensemble is a pair of positive spaces (X, A) related by a map p: A -> X. It generalizes cluster algebras of Fomin and Zelevinsky, which are related to the A-space. We develope general properties of cluster ensembles, including its…
We generalize classical triangular Schubert puzzles to puzzles with convex polygonal boundary. We give these puzzles a geometric Schubert calculus interpretation and derive novel combinatorial commutativity statements, using purely…
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…
A given set of data-points in some feature space may be associated with a Schrodinger equation whose potential is determined by the data. This is known to lead to good clustering solutions. Here we extend this approach into a full-fledged…
Coupled-cluster theory is a powerful tool for first-principles calculations of atomic nuclei, enabling accurate predictions of nuclear observables across the Segr\`e chart. While coupled-cluster computations are especially efficient at…
We clarify the natural cluster algebra of type A that exists in a residual and tropical form in the kinematical space as suggested in 1711.09102 by the use of triangulations, mutations and associahedron on the definition of scattering…
The linked cluster expansion has been shown to be highly efficient in calculating equilibrium and nonequilibrium properties of a variety of 1D and 2D classical and quantum lattice models. In this article, we extend the linked cluster method…
Convex clustering is an attractive clustering algorithm with favorable properties such as efficiency and optimality owing to its convex formulation. It is thought to generalize both k-means clustering and agglomerative clustering. However,…
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,…
In Bipartite Correlation Clustering (BCC) we are given a complete bipartite graph $G$ with `+' and `-' edges, and we seek a vertex clustering that maximizes the number of agreements: the number of all `+' edges within clusters plus all `-'…
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…
In combinatorial topology we aim to triangulate manifolds such that their topological properties are reflected in the combinatorial structure of their description. Here, we give a combinatorial criterion on when exactly triangulations of…
Let $Q$ be a finite acyclic valued quiver. We give the cluster multiplication formulas in the quantum cluster algebra of $Q$ with arbitrary coefficients, by applying certain quotients of derived Hall subalgebras of $Q$. These formulas can…
Traditional k-means clustering underperforms on non-convex shapes and requires the number of clusters k to be specified in advance. We propose a simple geometric enhancement: after standard k-means, each cluster center is assigned a radius…
This work outlines an exact combinatorial approach to finite coagulating systems through recursive equations and use of generating function method. In the classic approach the mean-field Smoluchowski coagulation is used. However, the…