Related papers: Tapes as Stochastic Matrices of String Diagrams
We show that the categories of directed and undirected reflexive graphs carry exactly two (up to isomorphism) biclosed monoidal structures.
Heaps are para-associative ternary operations bijectively exemplified by groups via the operation $(x,y,z) \mapsto x y^{-1} z$. They are also ternary self-distributive, and have a diagrammatic interpretation in terms of framed links.…
The first part of the paper explains how to encode a one-cocycle and a two-cocycle on a group $G$ with values in its representation by networks of planar trivalent graphs with edges labelled by elements of $G$, elements of the…
The category Set_* of sets and partial functions is well-known to be traced monoidal, meaning that a partial function S+U -/-> T+U can be coherently transformed into a partial function S -/-> T. This transformation is generally described in…
The differential systems satisfied by orthogonal polynomials with arbitrary semiclassical measures supported on contours in the complex plane are derived, as well as the compatible systems of deformation equations obtained from varying such…
In this paper we describe a general framework for constructing examples of locally linear semistrict monoidal 2-categories covering many examples appearing in link homology theory. The main input datum is a closed foam evaluation formula.…
We present a categorical model for intuitionistic linear logic where objects are polynomial diagrams and morphisms are simulation diagrams. The multiplicative structure (tensor product and its adjoint) can be defined in any locally…
In this paper polynomial maps are represented by the use of matrices whose entries are numbered by pair of multiindices and a new product of such matrices is introduced. A matrix representation of composition of polynomial maps is given. In…
Graphs can be associated with a matrix according to some rule and we can find the spectrum of a graph with respect to that matrix. Two graphs are cospectral if they have the same spectrum. Constructions of cospectral graphs help us…
In this paper the chordal graph structures of polynomial sets appearing in triangular decomposition in top-down style are studied when the input polynomial set to decompose has a chordal associated graph. In particular, we prove that the…
We study Jacobi matrices on star-like graphs, which are graphs that are given by the pasting of a finite number of half-lines to a compact graph. Specifically, we extend subordinacy theory to this type of graphs, that is, we find a…
In these notes we investigate BIBDs with $\lambda=1$ that present subdesigns evenly covering both blocks and vertices: we determine some of their basic properties, consequence of already existing results in the literature, with regards to…
It is well-known that every vertex-transitive graph admits a representation as a coset graph. In this paper, we extend this construction by introducing monodromy graphs defined through double cosets. Our main result establishes that every…
Monads govern computational side-effects in programming semantics. They can be combined in a ''bottom-up'' way to handle several instances of such effects. Indexed monads and graded monads do this in a modular way. Here, instead, we equip…
We prove that every class of graphs $\mathscr C$ that is monadically stable and has bounded twin-width can be transduced from some class with bounded sparse twin-width. This generalizes analogous results for classes of bounded linear…
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…
Coalgebras in a Kleisli category yield a generic definition of trace semantics for various types of labelled transition systems. In this paper we apply this generic theory to generative probabilistic transition systems, short PTS, with…
We universally characterize the produoidal category of monoidal lenses over a monoidal category. In the same way that each category induces a cofree promonoidal category of spliced arrows, each monoidal category induces a cofree produoidal…
Categorical probability has recently seen significant advances through the formalism of Markov categories, within which several classical theorems have been proven in entirely abstract categorical terms. Closely related to Markov categories…
Every small monoidal category with universal finite joins of central idempotents is monoidally equivalent to the category of global sections of a sheaf of local monoidal categories on a topological space. Every small stiff monoidal category…