The symmetric monoidal theory of Interacting Hopf Algebras provides a sound and complete axiomatisation for linear relations over a given field. As is the case for ordinary relations, linear relations have a natural order that coincides with inclusion. In this paper, we give a presentation for this ordering by extending the theory of Interacting Hopf Algebras with a single additional inequation. We show that the extended theory gives rise to an abelian bicategory - a concept due to Carboni and Walters - and highlight similarities with the algebra of relations. Most importantly, the ordering leads to a well-behaved notion of refinement for signal flow graphs
Network theory uses the string diagrammatic language of monoidal categories to study graphical struc...
Signal flow graphs are combinatorial models for linear dynamical systems, playing a foundational rol...
Control theory uses 'signal-flow diagrams' to describe processes where real-valued functions of time...
The symmetric monoidal theory of Interacting Hopf Algebras provides a sound and complete axiomatisat...
Scientists in diverse fields use diagrammatic formalisms to reason about various kinds of networks,...
Diagrammatic reasoning has been successful in many areas of sciences, from engineering to computer s...
We introduce a graphical syntax for signal flow diagrams based on the language of symmetric monoidal...
We introduce a graphical syntax for signal flow diagrams based on the language of symmetric monoidal...
We introduce the theory IHR of interacting Hopf algebras, parametrised over a principal ideal domain...
We present by generators and equations the algebraic theory IH whose free model is the category ofli...
International audienceWe introduce IH, a sound and complete graphical theory of vector subspaces ove...
Bialgebras and their specialisation Hopf algebras are algebraic structures that challenge traditiona...
We introduce , double-struck Iâ a sound and complete graphical theory of vector subspaces over the f...
We use the framework of ``props" to study electrical circuits, signal-flow diagrams, and bond graphs...
A study of the classes of finite relations as enriched strict monoidal categories is presented in [C...
Network theory uses the string diagrammatic language of monoidal categories to study graphical struc...
Signal flow graphs are combinatorial models for linear dynamical systems, playing a foundational rol...
Control theory uses 'signal-flow diagrams' to describe processes where real-valued functions of time...
The symmetric monoidal theory of Interacting Hopf Algebras provides a sound and complete axiomatisat...
Scientists in diverse fields use diagrammatic formalisms to reason about various kinds of networks,...
Diagrammatic reasoning has been successful in many areas of sciences, from engineering to computer s...
We introduce a graphical syntax for signal flow diagrams based on the language of symmetric monoidal...
We introduce a graphical syntax for signal flow diagrams based on the language of symmetric monoidal...
We introduce the theory IHR of interacting Hopf algebras, parametrised over a principal ideal domain...
We present by generators and equations the algebraic theory IH whose free model is the category ofli...
International audienceWe introduce IH, a sound and complete graphical theory of vector subspaces ove...
Bialgebras and their specialisation Hopf algebras are algebraic structures that challenge traditiona...
We introduce , double-struck Iâ a sound and complete graphical theory of vector subspaces over the f...
We use the framework of ``props" to study electrical circuits, signal-flow diagrams, and bond graphs...
A study of the classes of finite relations as enriched strict monoidal categories is presented in [C...
Network theory uses the string diagrammatic language of monoidal categories to study graphical struc...
Signal flow graphs are combinatorial models for linear dynamical systems, playing a foundational rol...
Control theory uses 'signal-flow diagrams' to describe processes where real-valued functions of time...