Related papers: Tape Diagrams for Monoidal Monads
We introduce regular languages of morphisms in free monoidal categories, with their associated grammars and automata. These subsume the classical theory of regular languages of words and trees, but also open up a much wider class of…
Circuit algebras, used in the study of finite-type knot invariants, are a symmetric analogue of Jones's planar algebras. They are very closely related to circuit operads, which are a variation of modular operads admitting an extra monoidal…
It is common to encounter symmetric monoidal categories $\mathcal{C}$ for which every object is equipped with an algebraic structure, in a way that is compatible with the monoidal product and unit in $\mathcal{C}$. We define this formally…
Building on structure observed in equivariant homotopy theory, we define an equivariant generalization of a symmetric monoidal category: a $G$-symmetric monoidal category. These record not only the symmetric monoidal products but also…
We describe a diagrammatic procedure which lifts strict monoidal actions from additive categories to categories of complexes avoiding any use of direct sums. As an application, we prove that every simple transitive $2$-representation of the…
We study the category of Reedy diagrams in a $\mm$-model category. Explicitly, we show that if K is a small category, V is a closed symmetric monoidal category and C is a closed V-module, then the diagram category V^K is a closed symmetric…
A groupoid is a small category in which each morphism has an inverse. A topological groupoid is a groupoid in which both sets of objects and morphisms have topologies such that all groupoid structure maps are continuous. The notion of…
In this paper we present cartesian structure for symmetric Gray-monoidal double categories. To do this we first introduce locally cubical Gray categories, which are three-dimensional categorical structures analogous to classical, locally…
We introduce and study knotoids. Knotoids are represented by diagrams in a surface which differ from the usual knot diagrams in that the underlying curve is a segment rather than a circle. Knotoid diagrams are considered up to Reidemeister…
This work contributes to clarifying several relationships between certain higher categorical structures and the homotopy type of their classifying spaces. Bicategories (in particular monoidal categories) have well understood simple…
In graph learning, maps between graphs and their subgraphs frequently arise. For instance, when coarsening or rewiring operations are present along the pipeline, one needs to keep track of the corresponding nodes between the original and…
It is well known that braided monoidal categories are the categorical algebras of the little two-dimensional disks operad. We introduce involutive little disks operads, which are Z/2Z-orbifold versions of the little disks operads. We…
Categories, n-categories, double categories, and multicategories (among others) all have similar definitions as collections of cells with composition operations. We give an explicit description of the information required to define any…
Each finite and connected bipartite graph induces a finite collection of non-isomorphic dessins d'enfants, that is, $2$-cell embeddings of it into some closed orientable surface. We describe an algorithm to compute all these dessins…
This work is about diagrammatic languages, how they can be represented, and what they in turn can be used to represent. More specifically, it focuses on representations and applications of string diagrams. String diagrams are used to…
The category of all monads over many-sorted sets (and over other "set-like" categories) is proved to have coequalizers and strong cointersections. And a general diagram has a colimit whenever all the monads involved preserve monomorphisms…
This note gives generators and relations for the strict monoidal category of probabilistic maps on finite cardinals (i.e., stochastic matrices).
Szlach\'anyi showed that bialgebroids can be characterised using skew monoidal categories. The characterisation reduces the amount of data, structure, and properties required to define them. Lack and Street provide a bicategorical account…
We present a new model of computation, described in terms of monoidal categories. It conforms the Church-Turing Thesis, and captures the same computable functions as the standard models. It provides a succinct categorical interface to most…
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…