Related papers: Linking diagrams for free
Polymer models are used to describe chromatin, which can be folded at different spatial scales by binding molecules. By folding, chromatin generates loops of various sizes. We present here a randomly cross-linked (RCL) polymer model, where…
Calculi of string diagrams are increasingly used to present the syntax and algebraic structure of various families of circuits, including signal flow graphs, electrical circuits and quantum processes. In many such approaches, the semantic…
For any Carter diagram $\Gamma$ containing 4-cycle, we introduce the partial Cartan matrix $B_L$, which is similar to the Cartan matrix associated with a Dynkin diagram. A linkage diagram is obtained from $\Gamma$ by adding one root…
In this paper we present the construction of a skeletal diagram category, which we call the square with bands category. This category extends the Temperley-Lieb (TL) category, where morphisms now include diagrams of embedded curves on…
Link prediction in complex networks has attracted considerable attention from interdisciplinary research communities, due to its ubiquitous applications in biological networks, social networks, transportation networks, telecommunication…
We introduce the notion of free decomposition spaces: they are simplicial spaces freely generated by their inert maps. We show that left Kan extension along the inclusion $j \colon \Delta_{\operatorname{inert}} \to \Delta$ takes general…
We construct algebraic and algebro-geometric models for the spaces of unparametrized paths. This is done by considering a path as a holonomy functional on indeterminate connections. For a manifold X, we construct a Lie algebroid P which…
The category $\mathbf{Rel}$ is the category of sets (objects) and relations (morphisms). Equipped with the direct product of sets, $\mathbf{Rel}$ is a monoidal category. Moreover, $\mathbf{Rel}$ is a locally posetal 2-category, since every…
We review some of the endeavors in trying to connect Petri nets with free symmetric monoidal categories. We give a list of requirement such connections should respect if they are meant to be useful for practical/implementation purposes. We…
For integers \(r\ge 2\), \(t\ge 1\) and a real number \(a\in(3/2,2]\), we study the typical structure of oriented graphs and digraphs that do not contain a blow-up \(T_{r+1}^t\) of a transitive tournament. We prove that almost every…
We introduce new techniques for working with presentations for a large class of (strict) tensor categories. We then apply the general theory to obtain presentations for partition, Brauer and Temperley-Lieb categories, as well as several…
The partition algebra is an associative algebra with a basis of set-partition diagrams and multiplication given by diagram concatenation. It contains as subalgebras a large class of diagram algebras including the Brauer, planar partition,…
In this paper we construct cumulants for stable random matrix models with single trace interactions of arbitrarily high even order. We obtain explicit and convergent expansions for it and we prove that it is an analytic function inside a…
We introduce an interesting class of left adequate monoids which we call pretzel monoids. These, on the one hand, are monoids of birooted graphs with respect to a natural `glue-and-fold' operation, and on the other hand, are shown to be…
It is known that the writhe calculated from any reduced alternating link diagram of the same (alternating) link has the same value. That is, it is a link invariant if we restrict ourselves to reduced alternating link diagrams. This is due…
Coherence theorems for covariant structures carried by a category have traditionally relied on the underlying term rewriting system of the structure being terminating and confluent. While this holds in a variety of cases, it is not a…
In this paper we develop an ideal structure theory for the class of left reductive regular semigroups and apply it to several subclasses of popular interest. In these classes we observe that the right ideal structure of the semigroup is…
Tape diagrams provide a graphical representation for arrows of rig categories, namely categories equipped with two monoidal structures, $\oplus$ and $\otimes$, where $\otimes$ distributes over $\oplus$. However, their applicability is…
Intuitively speaking, a bipartite graph is mirror if it can be drawn in the Cartesian plane in such a way that, the vertices of one stable are points in x=0, the vertices of the other stable set are points in x=1, the edges are straight…
We introduce the notion of rational links in the solid torus. We show that rational links in the solid torus are fully characterized by rational tangles, and hence by the continued fraction of the rational tangle. Furthermore, we generalize…