Related papers: Towards M-Adhesive Categories based on Coalgebras …
Monographs are graph-like structures with directed edges of unlimited length that are freely adjacent to each other. The standard nodes are represented as edges of length zero. They can be drawn in a way consistent with standard graphs and…
Let K be a comonad on a model category M. We provide conditions under which the associated category of K-coalgebras admits a model category structure such that the forgetful functor to M creates both cofibrations and weak equivalences. We…
We introduce a class of algebras over a field $\mathbb{F}$ related to directed graphs in which all edges are labeled by nonzero elements of the field $\mathbb{F}$. If all labels are different from $1$, these algebras are axial algebras. We…
The study of abstraction and composition - the focus of category theory - naturally leads to sophisticated diagrams which can encode complex algebraic semantics. Consequently, these diagrams facilitate a clearer visual comprehension of…
We develop a notion of an algebra over an infinity-operad with values in infinity-categories which is completely intrinsic to the formalism of dendroidal sets. Its definition involves the notion of a coCartesian fibration of dendroidal sets…
We develop some foundations of commutative algebra, with a view towards algebraic geometry, in symmetric tensor categories. Most results establish analogues of classical theorems, in tensor categories which admit a tensor functor to some…
We develop a categorical framework for studying graphs of groups and their morphisms, with emphasis on pullbacks. More precisely, building on classical work by Serre and Bass, we give an explicit construction of the so-called…
We demonstrate that the most well-known approach to rewriting graphical structures, the Double-Pushout (DPO) approach, possesses a notion of sequential compositions of rules along an overlap that is associative in a natural sense. Notably,…
If M is a model category and Z is an object of M, then there are model category structures on the category of objects of M over Z and the category of objects of M under Z under which a map is a cofibration, fibration, or weak equivalence if…
In this article we describe properties of the 2-functor from the 2-category of comonads to the 2-category of functors that sends a comonad to its forgetful functor. This allows us to describe contexts where algebras over a monad are…
We show that it is equivalent, for certain sets of finite graphs, to be definable in CMS (counting monadic second-order logic, a natural extension of monadic second-order logic), and to be recognizable in an algebraic framework induced by…
To any directed graph we associate an algebra with edges of the graph as generators and with relations defined by all pairs of directed paths with the same origin and terminus. Such algebras are related to factorizations of polynomials over…
A class $\mathcal{G}$ of graphs is called hereditary if it is closed under taking induced subgraphs. We denote by $G^{epex}$ the class of graphs that are at most one edge away from being in $\mathcal{G}$. We note that $G^{epex}$ is…
We identify morphisms of strong profunctors as a categorification of quantum supermaps. These black-box generalisations of diagrams-with-holes are hence placed within the broader field of profunctor optics, as morphisms in the category of…
Our work over the past years shows that not only the collection of (for instance) all topological spaces gives rise to a category, but also each topological space can be seen individually as a category by interpreting the convergence…
Typed metagraphs are defined as hypergraphs with types assigned to hyperedges and their targets, and the potential to have targets of hyperedges connect to whole links as well as targets. Directed typed metagraphs (DTMGs) are introduced via…
Every smooth manifold contains particles which propagate. These form objects and morphisms of a category equipped with a functor to the category of Abelian groups, turning this into a 0+1 topological field theory. We investigate the…
Categories can be identified -- up to isomorphism -- with polynomial comonads on Set. The left Kan extension of a functor along itself is always a comonad -- called the density comonad -- so it defines a category when its carrier is…
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 show how an effect algebra $\mathcal{X}$ can be regarded as a category, where the morphisms $x \rightarrow y$ are the elements $f$ such that $x \leq f \leq y$. This gives an embedding $\mathbf{EA} \rightarrow \mathbf{Cat}$. The interval…