Related papers: On webs, polylogarithms and cluster algebras
This article develops a comprehensive theory of multiary graded polyadic algebras, extending the classical concept of group-graded algebras to higher-arity structures. We introduce the notion of grading by multiary groups and investigate…
Given a point $\xi$ on a complex abelian variety $A$, its abelian logarithm can be expressed as a linear combination of the periods of $A$ with real coefficients, the Betti coordinates of $\xi$. When $(A, \xi)$ varies in an algebraic…
We show that clustered planarity with overlapping clusters as introduced by Didimo et al. can be solved in polynomial time if each cluster induces a connected subgraph. It can be solved in linear time if the set of clusters is the union of…
Graph clustering is a fundamental and challenging task in the field of graph mining where the objective is to group the nodes into clusters taking into consideration the topology of the graph. It has several applications in diverse domains…
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…
Two natural and widely used representations for the community structure of networks are clusterings, which partition the vertex set into disjoint subsets, and layouts, which assign the vertices to positions in a metric space. This paper…
Correlation clustering is a widely-used approach for clustering large data sets based only on pairwise similarity information. In recent years, there has been a steady stream of better and better classical algorithms for approximating this…
Usual formulations of the clustering coefficient can be shown to be insufficient in the task of describing the local topology of very simple networks. Motivated by this, we review some alternatives in order to present an extension, the…
We continue the exploration of various appearances of cluster algebras in scattering amplitudes and related topics in physics. The cluster configuration spaces generalize the familiar moduli space ${\mathcal M}_{0,n}$ to finite-type cluster…
In general the endomorphisms of a non-abelian group do not form a ring under the operations of addition and composition of functions. Several papers have dealt with the ring of functions defined on a group which are endomorphisms when…
We introduce a notion of matrix valued Gram decompositions for correlation matrices whose study is motivated by quantum information theory. We show that for extremal correlations, the matrices in such a factorization generate a Clifford…
This paper investigates the validity of Kleinberg's axioms for clustering functions with respect to the quite popular clustering algorithm called $k$-means. While Kleinberg's axioms have been discussed heavily in the past, we concentrate…
This manuscript develops the theory of agglomerative clustering with Bregman divergences. Geometric smoothing techniques are developed to deal with degenerate clusters. To allow for cluster models based on exponential families with…
An explicit construction is presented of homotopy-invariant iterated integrals on a Riemann surface of arbitrary genus in terms of a flat connection valued in a freely generated Lie algebra. The integration kernels consist of modular…
We provide a systematic derivation of cluster alphabets of finite types. The construction is based on a geometric realization of the generalized worldsheets by gluing and folding a pair of polygons. The cross ratios of the worldsheet z…
We show the existence of generalized clusters of a finite or even infinite number of sets, with minimal total perimeter and given total masses, in metric measure spaces homogeneous with respect to a group acting by measure preserving…
We construct polylogarithms on families of pointed Riemann surfaces of any genus which describe monodromies of meromorphic connections with simple poles. Furthermore, we show that the polylogaritms are computable as power series in…
Despite the fact that many important problems (including clustering) can be described using hypergraphs, theoretical foundations as well as practical algorithms using hypergraphs are not well developed yet. In this paper, we propose a…
In a categorification of skew-symmetric cluster algebras, each cluster variable corresponds with an indecomposable module over the associated Jacobian algebra. Buan, Marsh and Reiten studied when the denominator vector of each cluster…
We introduce a new function on the set of pairs of cluster variables via $f$-vectors, which we call it the compatibility degree (of cluster complexes). The compatibility degree is a natural generalization of the classical compatibility…