Related papers: A Compositional Framework for Bond Graphs

Associated to a simple root of a finite-dimensional complex semisimple Lie algebra, there are several endofunctors (defined by Arkhipov, Enright, Frenkel, Irving, Jantzen, Joseph, Mathieu, Vogan and Zuckerman) on the BGG category…

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…

Modular functors are traditionally defined as systems of projective representations of mapping class groups of surfaces that are compatible with gluing. They can formally be described as modular algebras over central extensions of the…

We study rewriting for equational theories in the context of symmetric monoidal categories where there is a separable Frobenius monoid on each object. These categories, also called hypergraph categories, are increasingly relevant: Frobenius…

We study adjoint and Frobenius pairs of functors, equivalences, and the Picard group for corings.

Entwined modules over cowreaths in a monoidal category are introduced. They can be identified to coalgebras in an appropriate monoidal category. It is investigated when such coalgebras are Frobenius (resp. separable), and when the forgetful…

For functors $L:\A\to \B$ and $R:\B\to \A$ between any categories $\A$ and $\B$, a {\em pairing} is defined by maps, natural in $A\in \A$ and $B\in \B$, $$\xymatrix{\Mor_\B (L(A),B) \ar@<0.5ex>[r]^{\alpha} & \Mor_\A…

Just as binary relations between sets may be understood as jointly monic spans, so too may equivalence relations on the disjoint union of sets be understood as jointly epic cospans. With the ensuing notion of composition inherited from the…

We consider certain categorical structures that are implicit in subfactor theory. Making the connection between subfactor theory (at finite index) and category theory explicit sheds light on both subjects. Furthermore, it allows various…

In this paper we explain the relationship between Frobenius objects in monoidal categories and adjunctions in 2-categories. In particular, we show that every Frobenius object in a monoidal category M arises from an ambijunction…

We introduce a graphical language for closed symmetric monoidal categories based on an extension of string diagrams with special bracket wires representing internal homs. These bracket wires make the structure of the internal hom functor…

This thesis is about trying to understand various aspects of partial symmetry using ideas from semigroup and category theory. In Chapter 2 it is shown that the left Rees monoids underlying self-similar group actions are precisely monoid…

We examine a variant of hypergraphs that we call interfaced linear hypergraphs, with the aim of creating a sound and complete graphical language for symmetric traced monoidal categories (STMCs) suitable for graph rewriting. In particular,…

We show that the construction due to Leinster and Weber of a generalized Lawvere theory for a familially representable monad on a (co)presheaf category, and the associated ``nerve'' functor from monad algebras to (co)presheaves, have an…

The theory of 2-monads entails that, for a strict monoidal category C, there is a strict monoidal category L(C) such that strict monoidal functors from L(C) are precisely the lax monoidal functors from C. We give an elementary,…

For logarithmic conformal field theories whose monodromy data is given by a not necessarily semisimple modular category, we solve the problem of constructing and classifying the consistent systems of correlators. The correlator construction…

A double category of relations is essentially a cartesian equipment with strong, discrete and functorial tabulators and for which certain local products satisfy a Frobenius Law. A double category of relations is equivalent to a double…

Given an exact functor between triangulated categories which admits both adjoints and whose cotwist is either zero or an autoequivalence, we show how to associate a unique full triangulated subcategory of the codomain on which the functor…

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…

This paper proposes a new, visual method to study numerical semigroups and the Frobenius problem. The method is based on building a so-called reduction graph, whose nodes usually correspond to monogenic semigroups, and whose edges can have…