English
Related papers

Related papers: Props in Network Theory

200 papers

We use the framework of "props" to study electrical circuits, signal-flow diagrams, and bond graphs. A prop is a strict symmetric monoidal category where the objects are natural numbers, with the tensor product of objects given by addition.…

Category Theory · Mathematics 2018-05-23 Brandon Coya

A PROP is a symmetric monoidal category whose objects are the nonnegative integers and whose tensor product on objects is addition. A morphism from $m$ to $n$ in a PROP can be visualized as a string diagram with $m$ input wires and $n$…

Category Theory · Mathematics 2015-05-04 Simon Wadsley , Nick Woods

In physics, Feynman diagrams are used to reason about quantum processes. In the 1980s, it became clear that underlying these diagrams is a powerful analogy between quantum physics and topology: namely, a linear operator behaves very much…

Quantum Physics · Physics 2020-12-30 John C. Baez , Mike Stay

We propose a graphical language that accommodates two monoidal structures: a multiplicative one for pairing and an additional one for branching. In this colored PROP, whether wires in parallel are linked through the multiplicative structure…

Logic in Computer Science · Computer Science 2025-12-29 Kostia Chardonnet , Marc de Visme , Benoît Valiron , Renaud Vilmart

A theory is developed which uses "networks" (directed acyclic graphs with some extra structure) as a formalism for expressions in multilinear algebra. It is shown that this formalism is valid for arbitrary PROPs (short for 'PROducts and…

Rings and Algebras · Mathematics 2012-04-12 Lars Hellström

Passive linear networks are used in a wide variety of engineering applications, but the best studied are electrical circuits made of resistors, inductors and capacitors. We describe a category where a morphism is a circuit of this sort with…

Category Theory · Mathematics 2018-11-22 John C. Baez , Brendan Fong

The notion of proof-net category defined in this paper is closely related to graphs implicit in proof nets for the multiplicative fragment without constant propositions of linear logic. Analogous graphs occur in Kelly's and Mac Lane's…

Category Theory · Mathematics 2007-05-23 K. Dosen , Z. Petric

This paper presents a unified algebraic, topological, and logical framework for electrical one-port networks based on \v{S}are's $m$-theory. Within this formalism, networks are represented by $m$-words (jorbs) over an ordered alphabet,…

Systems and Control · Electrical Eng. & Systems 2025-10-28 Marko Orešković , Ivana Kuzmanović Ivičić , Juraj Benić , Mario Essert

String diagrams can nicely express numerous computations in symmetric strict monoidal categories (SSMC). To be entirely exact, this is only true for props: the SSMCs whose monoid of objects are free. In this paper, we show a propification…

Category Theory · Mathematics 2022-05-17 Titouan Carette

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…

Quantum Physics · Physics 2024-07-02 James Hefford , Matt Wilson

We propose a categorical framework to reason about scientific explanations: descriptions of a phenomenon meant to translate it into simpler terms, or into a context that has been already understood. Our motivating examples come from systems…

Logic in Computer Science · Computer Science 2023-08-01 Leo Lobski , Fabio Zanasi

The tensor product of props was defined by Hackney and Robertson as an extension of the Boardman-Vogt product of operads to more general monoidal theories. Theories that factor as tensor products include the theory of commutative monoids…

Category Theory · Mathematics 2021-01-27 Amar Hadzihasanovic

The category of (colored) props is an enhancement of the category of colored operads, and thus of the category of small categories. The titular category has nice formal properties: it is bicomplete and is a symmetric monoidal category, with…

Category Theory · Mathematics 2017-01-03 Philip Hackney , Marcy Robertson

Petri networks and network models are two frameworks for the compositional design of systems of interacting entities. Here we show how to combine them using the concept of a "catalyst": an entity that is neither destroyed nor created by any…

Category Theory · Mathematics 2024-08-07 John C. Baez , John Foley , Joe Moeller

Control is a fundamental concept in quantum and reversible computational models. It enables the conditional application of a transformation to a system, depending on the state of another system. We introduce a general framework for…

Quantum Physics · Physics 2026-01-16 Noé Delorme , Simon Perdrix

Control theory uses `signal-flow diagrams' to describe processes where real-valued functions of time are added, multiplied by scalars, differentiated and integrated, duplicated and deleted. These diagrams can be seen as string diagrams for…

Category Theory · Mathematics 2016-11-24 Jason Michael Erbele

We introduce a new formalism for representing proofs in propositional logic called "scroll nets". Its fundamental construct is the "scroll", a topological notation for implication proposed by C. S. Peirce at the end of the 19th century as…

Logic in Computer Science · Computer Science 2025-07-29 Pablo Donato

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…

Algebraic Geometry · Mathematics 2007-05-23 David Garber , Mina Teicher , Uzi Vishne

We introduce the pro-tensor network, a categorification of the tensor network, as a fully rigorous yet graphically transparent framework for studying the collection of many many-body theories, which we dub many-many-body theory. We provide…

Strongly Correlated Electrons · Physics 2026-05-20 Gen Yue , Ansi Bai , Linqian Wu , Tian Lan

We introduce nominal string diagrams as string diagrams internal in the category of nominal sets. This leads us to define nominal PROPs and nominal monoidal theories. We show that the categories of ordinary PROPs and nominal PROPs are…

Logic in Computer Science · Computer Science 2023-06-22 Samuel Balco , Alexander Kurz
‹ Prev 1 2 3 10 Next ›