Related papers: On webs, polylogarithms and cluster algebras

Several algorithms have been proposed to compute partitions of networks into communities that score high on a graph clustering index called modularity. While publications on these algorithms typically contain experimental evaluations to…

We study the computational model of polygraphs. For that, we consider polygraphic programs, a subclass of these objects, as a formal description of first-order functional programs. We explain their semantics and prove that they form a…

We establish a connection between tangles, a concept from structural graph theory that plays a central role in Robertson and Seymour's graph minor project, and hierarchical clustering. Tangles cannot only be defined for graphs, but in fact…

A detailed presentation of the results obtained during my Ph.D. research. The main investigations concern explicit descriptions of classes of finite dimensional pointed Hopf algebras and their quasi-isomorphism types.

We study cluster tilting modules in mesh algebras of Dynkin type, providing a new proof for their existence. In all but one case, we show that these are precisely the maximal rigid modules, and that they are equivariant for a certain…

For an integer n>2 we define a polylogarithm, which is a holomorphic function on the universal abelian cover of C-{0,1} defined modulo (2 pi i)^n/(n-1)!. We use the formal properties of its functional relations to define groups lifting…

We propose the Legendrian web in a contact three manifold as a second order generalization of the planar web. An Abelian relation for a Legendrian web is analogously defined as an additive equation among the first integrals of its…

We study tensor networks as a model of arithmetic computation for evaluating multilinear maps. These capture any algorithm based on low border rank tensor decompositions, such as $O(n^{\omega+\epsilon})$ time matrix multiplication, and in…

Let $\Delta$ be an oriented valued graph equipped with a group of admissible automorphisms satisfying a certain stability condition. We prove that the (coefficient-free) cluster algebra $\mathcal A(\Delta/G)$ associated to the valued…

We construct cryptographic trilinear maps that involve simple, non-ordinary abelian varieties over finite fields. In addition to the discrete logarithm problems on the abelian varieties, the cryptographic strength of the trilinear maps is…

This paper characterizes hierarchical clustering methods that abide by two previously introduced axioms -- thus, denominated admissible methods -- and proposes tractable algorithms for their implementation. We leverage the fact that, for…

In the past few years powerful generalizations to the Euclidean k-means problem have been made, such as Bregman clustering [7], co-clustering (i.e., simultaneous clustering of rows and columns of an input matrix) [9,18], and tensor…

In the acyclic case, we establish a one-to-one correspondence between the tilting objects of the cluster category and the clusters of the associated cluster algebra. This correspondence enables us to solve conjectures on cluster algebras.…

This note introduces the superunitary region of a cluster algebra, the subspace of the totally positive region on which each cluster variable is at least 1. Our main result is that the superunitary region of a finite type cluster algebra is…

This paper explores the cluster algebra structure of the moduli space $\mathscr{A}_{\mathrm{SL}_{n+1},\mathbb{S}}$ of twisted $\mathrm{SL}_{n+1}$-local systems on a surface. We derive general recurrence relations for cluster variables…

Let a collection of networks represent interactions within several (social or ecological) systems. We pursue two objectives: identifying similarities in the topological structures that are held in common between the networks and clustering…

We study cluster algebras that are associated to unpunctured surfaces with coefficients arising from boundary arcs. We give a direct formula for the Laurent polynomial expansion of cluster variables in these cluster algebras in terms of…

It has long been known that to a complex cubic surface or threefold one can canonically associate a principally polarized abelian variety. We give a construction which works for cubics over an arithmetic base. This answers, away from the…

Motivated by the definition of super-Teichm\"uller spaces, and Penner-Zeitlin's recent extension of this definition to decorated super-Teichm\"uller space, as examples of super Riemann surfaces, we use the super Ptolemy relations to obtain…

Modern graph or network datasets often contain rich structure that goes beyond simple pairwise connections between nodes. This calls for complex representations that can capture, for instance, edges of different types as well as so-called…