Related papers: On webs, polylogarithms and cluster algebras
We study factoriality and the class groups of locally acyclic cluster algebras. To do so, we introduce a new class of rings called finite Laurent intersection rings (FLIRs), which includes locally acyclic cluster algebras, full-rank upper…
We initiate a study of the dependence on the choice of ground ring on the question of whether a cluster algebra is equal to its upper cluster algebra. A condition for when there is equality of the cluster algebra and upper cluster algebra…
Many networked systems are governed by non-pairwise interactions between nodes. The resulting higher-order interaction structure can then be encoded by means of a hypernetwork. In this paper we consider dynamical systems on hypernetworks by…
We study the classification of $\mathbb{Z}$-DGAs with polynomial homology $\mathbb{F}_p[x]$ with $\lvert x \rvert >0$, motivated by computations in algebraic $K$-theory. This classification problem was left open in work of Dwyer, Greenlees,…
We construct common triangular bases for almost all the known (quantum) cluster algebras from Lie theory. These bases provide analogs of the dual canonical bases, long anticipated in cluster theory. In cases where the generalized Cartan…
This paper considers networks where relationships between nodes are represented by directed dissimilarities. The goal is to study methods that, based on the dissimilarity structure, output hierarchical clusters, i.e., a family of nested…
In this paper we explore the mathematical properties of wavefunction coefficients in power-law FRW cosmologies, and establish their relation to cluster algebras. We focus on the particular contributions to the wavefunction coefficient…
Correlators of Wilson-line operators in non-abelian gauge theories are known to exponentiate, and their logarithms can be organised in terms of collections of Feynman diagrams called webs. In [1] we introduced the concept of Cweb, or…
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 develop a full theoretical approach to clustering in complex networks. A key concept is introduced, the edge multiplicity, that measures the number of triangles passing through an edge. This quantity extends the clustering coefficient in…
The soft function in non-abelian gauge theories exponentiate, and their logarithms can be organised in terms of the collections of Feynman diagrams called Cwebs. The colour factors that appear in the logarithm are controlled by the web…
In \cite{CK2005} and \cite{Hubery2005}, the authors proved the cluster multiplication theorems for finite type and affine type. We generalize their results and prove the cluster multiplication theorem for arbitrary type by using the…
We provide an explicit Dynkin diagrammatic description of the c-vectors and the d-vectors (the denominator vectors) of any cluster algebra of finite type with principal coefficients and any initial exchange matrix. We use the surface…
We provide a far reaching derived equivalence classification of the cluster-tilted algebras of Dynkin type D and suggest standard forms for the derived equivalence classes. We believe that the classification is complete, but some subtle…
We construct two bases for each cluster algebra coming from a triangulated surface without punctures. We work in the context of a coefficient system coming from a full-rank exchange matrix, for example, principal coefficients.
Unsupervised clustering, also known as natural clustering, stands for the classification of data according to their similarities. Here we study this problem from the perspective of complex networks. Mapping the description of data…
Clustering is the propensity of nodes that share a common neighbour to be connected. It is ubiquitous in many networks but poses many modelling challenges. Clustering typically manifests itself by a higher than expected frequency of…
We discuss the curvilinear web $\boldsymbol{\mathcal W}_{0,n+3}$ on the moduli space $\mathcal M_{0,n+3}$ of projective configurations of $n+3$ points on $\mathbf P^1$ defined by the $n+3$ forgetful maps $\mathcal M_{0,n+3}\rightarrow…
The aim of this note is to describe a geometric relation between simple plane curve singularities classified by simply laced Cartan matrices and cluster varieties of finite type also classified by the simply laced Cartan matrices. We…
Locally acyclic cluster algebras are Krull domains. Hence their factorization theory is determined by their (divisor) class group and the set of classes containing height-1 prime ideals. Motivated by this, we investigate class groups of…