Related papers: Linking diagrams for free
Classical diagram categories and monoids, including the Temperley--Lieb, Brauer, and partition cases, arise as special instances of the category of two dimensional cobordisms and admit additional twists that produce a large new family of…
We suggest a new random model for links based on meander diagrams and graphs. We then prove that trivial links appear with vanishing probability in this model, no link $L$ is obtained with probability 1, and there is a lower bound for the…
We introduce and study several affine (=annular in this paper) versions of the classical diagram algebras such as Temperley-Lieb, partition, Brauer, Motzkin, rook Brauer, rook, planar partition, and planar rook algebras. We give generators…
We give a complete description of the congruence lattices of the following finite diagram monoids: the partition monoid, the planar partition monoid, the Brauer monoid, the Jones monoid (also known as the Temperley-Lieb monoid), the Motzkin…
Many real-world complex networks are best modeled as bipartite (or 2-mode) graphs, where nodes are divided into two sets with links connecting one side to the other. However, there is currently a lack of methods to analyze properly such…
We study the class of planar Feynman integrals that can be constructed by sequentially intersecting traintrack diagrams without forming a closed traintrack loop. After describing how to derive a $2L$-fold integral representation of any…
String diagrams are a powerful tool for reasoning about physical processes, logic circuits, tensor networks, and many other compositional structures. The distinguishing feature of these diagrams is that edges need not be connected to…
We define the category of partitioned binary relations and show that it contains many classical diagram categories, including categories of binary relations, maps, injective maps, partitions, (oriented) Brauer diagrams and (oriented)…
The linear decomposition attack provides a serious obstacle to direct applications of noncommutative groups and monoids (or semigroups) in cryptography. To overcome this issue we propose to look at monoids with only big representations, in…
In this article, we study freeness of hyperplane arrangements. One of the most investigated arrangement is a graphic arrangement. Stanley proved that a graphic arrangement is free if and only if the corresponding graph is chordal and Dirac…
We construct a compact closed category out of any symmetric monoidal category by freely adding adjoints to its objects. The morphisms of the completion are defined as string diagrams annotated by objects and morphisms from the original…
We study the class L of link-types that admit a K4-minor-free diagram, i.e., they can be projected on the plane so that the resulting graph does not contain any subdivision of K4. We prove that L is the closure of a subclass of torus links…
Network models, which abstractly are given by lax symmetric monoidal functors, are used to construct operads for modeling and designing complex networks. Many common types of networks can be modeled with simple graphs with edges weighted by…
We investigate arrangements of hyperplanes whose normal vectors are given by connected subgraphs of a fixed graph. These include the resonance arrangement and certain ideal subarrangements of Weyl arrangements. We characterize those which…
A graph $G$ is nonseparating projective planar if $G$ has a projective planar embedding without a nonsplit link. Nonseparating projective planar graphs are closed under taking minors and are a superclass of projective outerplanar graphs. We…
In the first part of this paper we present a theory of proof nets for full multiplicative linear logic, including the two units. It naturally extends the well-known theory of unit-free multiplicative proof nets. A linking is no longer a set…
A linking pairing is a symetric bilinear pairing lambda: GxG --> Q/Z on a finite abelian group. The set of isomorphism classes of linking pairings is a non-cancellative monoid E under orthogonal sum, which is infinitely generated and…
The notion of proof-net category defined in this paper is closely related to graphs implicit in proof nets for the multiplicative fragment without constant propositions of linear logic. Analogous graphs occur in Kelly's and Mac Lane's…
The notion of noncrossing linked partition arose from the study of certain transforms in free probability theory. It is known that the number of noncrossing linked partitions of [n+1] is equal to the n-th large Schroder number $r_n$, which…
This paper gives a self-contained and complete proof of the isomorphism of freely generated monoids extracted from Temperley-Lieb algebras with monoids made of Kauffman's diagrams.