Related papers: M-systems and Cluster algebras
A linking system of difference sets is a collection of mutually related group difference sets, whose advantageous properties have been used to extend classical constructions of systems of linked symmetric designs. The central problems are…
Quantum cluster theories are a set of approaches for the theory of correlated and disordered lattice systems, which treat correlations within the cluster explicitly, and correlations at longer length scales either perturbatively or within a…
We consider the problem of jointly modeling and clustering populations of tensors by introducing a high-dimensional tensor mixture model with heterogeneous covariances. To effectively tackle the high dimensionality of tensor objects, we…
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…
Biclustering is a class of techniques that simultaneously clusters the rows and columns of a matrix to sort heterogeneous data into homogeneous blocks. Although many algorithms have been proposed to find biclusters, existing methods suffer…
Inference in clustering is paramount to uncovering inherent group structure in data. Clustering methods which assess statistical significance have recently drawn attention owing to their importance for the identification of patterns in high…
We introduce algebraic dynamical systems, which consist of an action of a right LCM semigroup by injective endomorphisms of a group. To each algebraic dynamical system we associate a C*-algebra and describe it as a semigroup C*-algebra. As…
Sum-of-norms clustering is a clustering formulation based on convex optimization that automatically induces hierarchy. Multiple algorithms have been proposed to solve the optimization problem: subgradient descent by Hocking et al., ADMM and…
When it comes to clustering nonconvex shapes, two paradigms are used to find the most suitable clustering: minimum cut and maximum density. The most popular algorithms incorporating these paradigms are Spectral Clustering and DBSCAN. Both…
Connected clustering denotes a family of constrained clustering problems in which we are given a distance metric and an undirected connectivity graph $G$ that can be completely unrelated to the metric. The aim is to partition the $n$…
In this note we explain how to obtain cluster algebras from triangulations of (punctured) discs following the approach of S. Fomin, M. Shapiro and D. Thurston. Furthermore, we give a description of m-cluster categories via diagonals (arcs)…
Cluster algebras are commutative rings with a set of distinguished generators having a remarkable combinatorial structure. They were introduced by Fomin and Zelevinsky in 2000 in the context of Lie theory, but have since appeared in many…
Clustering is a popular form of unsupervised learning for geometric data. Unfortunately, many clustering algorithms lead to cluster assignments that are hard to explain, partially because they depend on all the features of the data in a…
We introduce a category of cluster algebras with fixed initial seeds. This category has countable coproducts, which can be constructed combinatorially, but no products. We characterise isomorphisms and monomorphisms in this category and…
Clustering algorithms aim to organize data into groups or clusters based on the inherent patterns and similarities within the data. They play an important role in today's life, such as in marketing and e-commerce, healthcare, data…
We prove bispectral duality for the generalized Calogero-Moser-Sutherland systems related to configurations $A_{n,2}(m), C_n(l,m)$. The trigonometric axiomatics of Baker-Akhiezer function is modified, the dual difference operators of…
Mode-based clustering methods define clusters to be the basins of attraction of the modes of a density estimate. The most common version is mean shift clus- tering which uses a gradient ascent algorithm to find the basins. Rodriguez and…
The notion of a congruence pair for principal MS-algebras, simpler than the one given by Beazer for $K_2$-algebras \cite{6}, is introduced. It is proved that the congruences of the principal MS-algebras $L$ correspond to the MS-congruence…
We report on numerical procedures for, and preliminary results on the search for, tunnelling centres in Lennard-Jones clusters, seen as simple model systems of glasses. Several of the double-well potentials identified are good candidates to…
We give a minimal system of 476 generators (resp. 510 generators) for the algebra of SL(2,C)-covariant polynomials on binary forms of degree 9 (resp. degree 10). These results were only known as conjectures so far. The computations rely on…