Related papers: Collages of String Diagrams
Motivated by deep learning regimes with multiple interacting yet distinct model components, we introduce learning diagrams, graphical depictions of training setups that capture parameterized learning as data rather than code. A learning…
String diagrams provide a convenient graphical framework which may be used for equational reasoning about morphisms of monoidal categories. However, unlike term rewriting, rewriting string diagrams results in shorter equational proofs,…
We discuss string diagrams for timed process theories -- represented by duoidally-graded symmetric strict monoidal categories -- built upon the string diagrams of pinwheel double categories.
Assembly planning is a difficult problem for companies. Many disciplines such as design, planning, scheduling, and manufacturing execution need to be carefully engineered and coordinated to create successful product assembly plans. Recent…
Maximal chord diagrams up to all isomorphisms are enumerated. The enumerating formula is based on a bijection between rooted one-vertex one-face maps on locally orientable surfaces and a certain class of symmetric chord diagrams. This…
Monoidal algebraic structures consist of operations that can have multiple outputs as well as multiple inputs, which have applications in many areas including categorical algebra, programming language semantics, representation theory,…
In this paper we introduce and investigate the notions of diagrams and discrete extensions in the study of finitary $2$-representations of finitary $2$-categories.
It is well known that to give an oplax functor of bicategories $\mathbf{1}\to\mathscr{C}$ is to give a comonad in $\mathscr{C}$. Here we generalize this fact, replacing the terminal bicategory by any bicategory $\mathscr{A}$ for which the…
We introduce the notion of the space of parallel strings with partially summable labels, which can be viewed as a geometrically constructed group completion of the space of particles with labels. We utilize this to construct a machinery…
We provide a pipeline for generating syntax diagrams (also called railroad diagrams) from context free grammars. Syntax diagrams are a graphical representation of a context free language, which we formalize abstractly as a set of mutually…
We introduce a new combinatorial method to encode knots and links with applications to knot invariants. Clasp diagrams defined in this paper are combinatorial blueprints for building knot diagrams out of full twists on two strings rather…
The monoidal category of Soergel bimodules can be thought of as a categorification of the Hecke algebra of a finite Weyl group. We present this category, when the Weyl group is the symmetric group, in the language of planar diagrams with…
We use the string diagram calculus to give graphical proofs of the basic results of Etingof, Nikshych and Ostrik on fusion categories. These results include: the quadruple dual is canonically isomorphic to the identity, positivity of the…
Wiring diagrams usually serve as a tool in the study of arrangements of lines and pseudolines. In this paper we go in the opposite direction, using known properties of line arrangements to motivate certain equivalence relations and actions…
One goal of applied category theory is to better understand networks appearing throughout science and engineering. Here we introduce "structured cospans" as a way to study networks with inputs and outputs. Given a functor $L \colon…
Optics are a data representation for compositional data access, with lenses as a popular special case. Hedges has presented a diagrammatic calculus for lenses, but in a way that does not generalize to other classes of optic. We present a…
This paper introduces the concept of gluing in a general category, enabling us to define categories that admit glued-up objects. To achieve this, we introduce the notion of a gluing index category. Subsequently, we provide an entirely…
We introduce two families of diagrammatic monoidal supercategories. The first family, depending on an associative superalgebra, generalizes the oriented Brauer category. The second, depending on an involutive superalgebra, generalizes the…
We study the polyregular string-to-string functions, which are certain functions of polynomial output size that can be described using automata and logic. We describe a system of combinators that generates exactly these functions. Unlike…
Layered monoidal theories provide a categorical framework for studying scientific theories at different levels of abstraction, via string diagrammatic algebra. We introduce models for three closely related classes of layered monoidal…