Related papers: A Compositional Framework for Bond Graphs
Circuit topology employs fundamental units of entanglement, known as soft contacts, for constructing knots from the bottom up, utilising circuit topology relations, namely parallel, series, cross, and concerted relations. In this article,…
We explain two related constructions on the data of two monoidal symmetric closed categories $\mathscr{A}$ and $\mathscr{E}$ and monoidal functors $F: \mathscr{E}\to \mathscr{A}$ and $G: \mathscr{A}\to \mathscr{E}$. In a first part, we…
We establish connectedness criteria for graphs associated to monomials in certain quotients of the mod 2 dual Steenrod algebra. We also investigate questions about trees and Hamilton cycles in the context of these graphs. Finally, we…
In this paper we adapt previous work on rewriting string diagrams using hypergraphs to the case where the underlying category has a traced comonoid structure, in which wires can be forked and the outputs of a morphism can be connected to…
This paper describes several cases of adjunction in the homomorphism preorder of relational structures. We say that two functors $\Lambda$ and $\Gamma$ between thin categories of relational structures are adjoint if for all structures…
Perfect graphs form one of the distinguished classes of finite simple graphs. In 2006, Chudnovsky, Robertson, Seymour and Thomas proved that a graph is perfect if and only if it has no odd holes and no odd antiholes as induced subgraphs,…
We introduce a formalism for computing bond percolation properties of a class of correlated and clustered random graphs. This class of graphs is a generalization of the Configuration Model where nodes of different types are connected via…
This article provides a general framework in the context of category theory where one can recognize as particular instances of the same abstract construction several notions of completion, envelope, and hull, such as the Boolean algebra…
Let $G$ be a bridgeless cubic graph. The Berge--Fulkerson Conjecture (1970s) states that $G$ admits a list of six perfect matchings such that each edge of $G$ belongs to exactly two of these perfect matchings. If answered in the…
We investigate functors between abelian categories having a left adjoint and a right adjoint that are \emph{similar} (these functors are called \emph{quasi-Frobenius functors}). We introduce the notion of a \emph{quasi-Frobenius bimodule}…
Let $\mathbb{k}$ be a characteristic zero domain. We define and study a diagrammatic monoidal $\mathbb{k}$-linear supercategory $\mathbf{Web}^{aff}_{A}$ associated to any locally unital Frobenius $\mathbb{k}$-superalgebra $A$. This category…
In the 20th century, individual technology products like the generator, telephone, and automobile were connected to form many of the large-scale, complex, infrastructure networks we know today: the power grid, the communication…
A connected planar cubic graph is called an $m$-barrel fullerene and denoted by $F(m,k)$, if it has the following structure: The first circle is an $m$-gon. Then $m$-gon is bounded by $m$ pentagons. After that we have additional k layers of…
We study the category whose objects are graphs of fixed genus and whose morphisms are contractions. We show that the corresponding contravariant module categories are Noetherian and we study two families of modules over these categories.…
We consider constrained variants of graph homomorphisms such as embeddings, monomorphisms, full homomorphisms, surjective homomorpshims, and locally constrained homomorphisms. We also introduce a new variation on this theme which derives…
String diagrams are a powerful and intuitive graphical syntax, originated in the study of symmetric monoidal categories. In the last few years, they have found application in the modelling of various computational structures, in fields as…
This thesis provides an introduction to the various category theory ideas employed in topological quantum field theory. These theories are viewed as symmetric monoidal functors from topological cobordism categories into the category of…
In categories of linear relations between finite dimensional vector spaces, composition is well-behaved only at pairs of relations satisfying transversality and monicity conditions. A construction of Wehrheim and Woodward makes it possible…
Calculi of string diagrams are increasingly used to present the syntax and algebraic structure of various families of circuits, including signal flow graphs, electrical circuits and quantum processes. In many such approaches, the semantic…
Linking diagrams with path composition are ubiquitous, for example: Temperley-Lieb and Brauer monoids, Kelly-Laplaza graphs for compact closed categories, and Girard's multiplicative proof nets. We construct the category Link=Span(iRel),…