Related papers: Linking diagrams for free
We study rewriting for equational theories in the context of symmetric monoidal categories where there is a separable Frobenius monoid on each object. These categories, also called hypergraph categories, are increasingly relevant: Frobenius…
Link prediction requires predicting which new links are likely to appear in a graph. Being able to predict unseen links with good accuracy has important applications in several domains such as social media, security, transportation, and…
The monoidal category of Soergel bimodules categorifies the Hecke algebra of a finite Weyl group. In the case of the symmetric group, morphisms in this category can be drawn as graphs in the plane. We define a quotient category, also given…
Many topological data analysis (TDA) pipelines compute large collections of persistence diagrams, yet vectorizations and kernel methods discard the rank-induced implication relations among persistence intervals that are essential for…
We prove the following "linkage" theorem: two p-regular graphs of the same genus can be obtained from one another by a finite alternating sequence of one-edge-contractions; moreover this preserves 3-edge-connectivity. We use the linkage…
The present paper is an introduction to a combinatorial theory arising as a natural generalisation of classical and virtual knot theory. There is a way to encode links by a class of `realisable' graphs. When passing to generic graphs with…
We prove that a connected, locally finite, quasi-transitive graph which is quasi-isometric to a planar graph is necessarily accessible. This leads to a complete classification of the finitely generated groups which are quasi-isometric to…
We introduce collages of string diagrams as a diagrammatic syntax for glueing multiple monoidal categories. Collages of string diagrams are interpreted as pointed bimodular profunctors. As the main examples of this technique, we introduce…
We show that a compact rigid balanced braided monoidal category with enough compact projective objects gives rise to a system of mapping class group representations compatible with the gluing along marked intervals. A motivation to consider…
Properties of morphisms represented by so-called 'string diagrams' of monoidal categories (and their braided and symmetric derivatives), mainly their resistance in value to isotopic deformation, have made the usage of graphical calculi…
A one-degree-of-freedom graph is a graph obtained from a minimally rigid graph in the plane and removing an edge. For such graph, the set of realisations with fixed edge length, modulo rotations and reflections, is an algebraic curve. The…
Network Models with couplings between link pairs are the simplest models for a class of networks with Higher Order interactions. In this paper we give an analytic, general solution to this family of Random Graph Models extending previous…
Generalized strata of meromorphic differentials are loci in the usual strata of differentials, where certain sets of residues sum up to zero. They appear naturally in the boundary of the multi-scale compactification of the usual strata.…
Each partition $\lambda = (\lambda_1, \lambda_2, ..., \lambda_n)$ determines a so-called Ferrers tableau or, equivalently, a Ferrers bipartite graph. Its edge ideal, dubbed Ferrers ideal, is a squarefree monomial ideal that is generated by…
Understanding the topology of decision regions is central to explaining the inner workings of deep neural networks. Prior empirical work has provided evidence that these regions are path connected. We study a stronger topological question:…
Every link diagram can be represented as a signed ribbon graph. However, different link diagrams can be represented by the same ribbon graphs. We determine how checkerboard colourable diagrams of links in real projective space, and virtual…
We give the first analysis of the computational complexity of {\it coalition structure generation over graphs}. Given an undirected graph $G=(N,E)$ and a valuation function $v:2^N\rightarrow\RR$ over the subsets of nodes, the problem is to…
Categories of partitions are combinatorial structures arising from the representation theory of certain compact quantum groups and are linked to classical diagram algebras such as the Temperley-Lieb algebra. In this paper, we present…
A labelled, undirected graph is a graph whose edges have assigned labels, from a specific set. Given a labelled, undirected graph, the well-known minimum labelling spanning tree problem is aimed at finding the spanning tree of the graph…
We obtain formulae for the minimum transformation degrees of the most well-studied families of finite diagram monoids, including the partition, Brauer, Temperley--Lieb and Motzkin monoids. For example, the partition monoid $P_n$ has degree…