On webs, polylogarithms and cluster algebras
arXiv:2105.01543
Abstract
In this text, we investigate webs which can be associated to cluster algebras from the point of view of the abelian functional equations these webs carry, focusing on the polylogarithmic ones. We introduce a general notion of webs whose rank is `As Maximal as Possible' (AMP) and show that many webs associated either to polylogarithmic functional equations or to cluster algebras are of this type. In particular, we prove a few results and state some conjectures about cluster webs associated to (pairs of) Dynkin diagrams. Along the way, we show that many of the classical functional equations satisfied by low-order polylogarithms (such as Spence-Kummer's equation of the trilogarithm or the tetralogarithmic one of Kummer) are of cluster type.
298 pages, many figures. Preliminary version. Comments are welcome
References in corpus (16)
- Classical Polylogarithms for Amplitudes and Wilson Loops
- Total positivity, Grassmannians, and networks
- The quantum dilogarithm and representations quantum cluster varieties
- Introduction to Cluster Algebras. Chapters 1-3
- Quantum geometry of moduli spaces of local systems and representation theory
- Cluster Structures on Higher Teichmuller Spaces for Classical Groups
- Multiple zeta values in deformation quantization
- Cluster Algebras and the Positive Grassmannian
- The classification of Zamolodchikov periodic quivers
- Comments on Exchange Graphs in Cluster Algebras
- Quantum Dilogarithm Identities at Root of Unity
- Rogers dilogarithms of higher degree and generalized cluster algebras
- Cluster algebras are Cox rings
- On the functional equations for polylogarithms in one variable
- Quantum dilogarithm identities for n-cycle quivers
- Exponents Associated with -Systems and their Relationship with -Series