English
Related papers

Related papers: PROPs for Linear Systems

200 papers

We establish a correspondence between modules and spans of algebras within a general monoidal 2-category $\mathfrak{C}$. Specifically, for an algebra $A$ in $\mathfrak{C}$, we construct a normalized lax 3-functor from the 2-category of…

Category Theory · Mathematics 2025-12-03 Hao Xu

Modular functors, i.e. consistent systems of projective representations of mapping class groups of surfaces, have been constructed for non-semisimple modular categories already decades ago. Concepts from homological algebra have not been…

Quantum Algebra · Mathematics 2022-01-07 Christoph Schweigert , Lukas Woike

We extend Lawvere-Pitts prop-categories (aka. hyperdoctrines) to develop a general framework for providing "algebraic" semantics for nonclassical first-order logics. This framework includes a natural notion of substitution, which allows…

Logic · Mathematics 2023-06-05 Colin Bloomfield , Yoshihiro Maruyama

For groups of a topological origin, such as braid groups and mapping class groups, an important source of interesting and highly non-trivial representations is given by their actions on the twisted homology of associated spaces; these are…

Algebraic Topology · Mathematics 2025-01-07 Martin Palmer , Arthur Soulié

Let $\mathcal C$ be a category with finite colimits, and let $(\mathcal E,\mathcal M)$ be a factorisation system on $\mathcal C$ with $\mathcal M$ stable under pushouts. Writing $\mathcal C;\mathcal M^{\mathrm{op}}$ for the symmetric…

Category Theory · Mathematics 2017-03-30 Brendan Fong

We show that a compact rigid balanced braided monoidal category with enough compact projective objects gives rise to a system of mapping class group representations compatible with the gluing along marked intervals. A motivation to consider…

Quantum Algebra · Mathematics 2026-02-24 Deniz Yeral

We discuss an example of a triangulated Hopf category related to SL(2). It is an equivariant derived category equipped with multiplication and comultiplication functors and structure isomorphisms. We prove some coherence equations for…

Quantum Algebra · Mathematics 2009-09-25 Volodymyr Lyubashenko

Milner's bigraphs are a general framework for reasoning about distributed and concurrent programming languages. Notably, it has been designed to encompass both the pi-calculus and the Ambient calculus. This paper is only concerned with…

Logic in Computer Science · Computer Science 2009-06-08 Tom Hirschowitz , Aurélien Pardon

Despite recent advances in the lattice representation theory of (generalized) symmetries, many simple quantum spin chains of physical interest are not included in the rigid framework of fusion categories and weak Hopf algebras. We…

Quantum Physics · Physics 2025-09-05 Yuhan Liu , Andras Molnar , Xiao-Qi Sun , Frank Verstraete , Kohtaro Kato , Laurens Lootens

Lenses are a well-established structure for modelling bidirectional transformations, such as the interactions between a database and a view of it. Lenses may be symmetric or asymmetric, and may be composed, forming the morphisms of a…

Machine Learning · Computer Science 2019-05-03 Brendan Fong , Michael Johnson

Given a finite modular tensor category, we associate with each compact surface with boundary a cochain complex in such a way that the mapping class group of the surface acts projectively on its cohomology groups. In degree zero, this action…

Quantum Algebra · Mathematics 2023-09-19 Simon Lentner , Svea Nora Mierach , Christoph Schweigert , Yorck Sommerhaeuser

Given a functor from any category into the category of topological spaces, one obtains a linear representation of the category by post-composing the given functor with a homology functor with field coefficients. This construction is…

Representation Theory · Mathematics 2024-12-02 Riju Bindua , Thomas Brüstle , Luis Scoccola

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…

Quantum Algebra · Mathematics 2025-10-27 Adrien Brochier , Lukas Woike

A partitioned process theory, as defined by Coecke, Fritz, and Spekkens, is a symmetric monoidal category together with an all-object-including symmetric monoidal subcategory. We think of the morphisms of this category as processes, and the…

Logic in Computer Science · Computer Science 2015-11-06 Brendan Fong , Hugo Nava-Kopp

In this paper, we extend diagrammatic reasoning in monoidal categories with algebraic operations and equations. We achieve this by considering monoidal categories that are enriched in the category of Eilenberg-Moore algebras for a monad.…

Logic in Computer Science · Computer Science 2024-01-30 Alejandro Villoria , Henning Basold , Alfons Laarman

We propose to extend ``invertibility'' to ``regularity'' for categories in general abstract algebraic manner. Higher regularity conditions and ``semicommutative'' diagrams are introduced. Distinction between commutative and…

Mathematical Physics · Physics 2007-05-23 Steven Duplij , Wladyslaw Marcinek

An operad describes a category of algebras and a (co)homology theory for these algebras may be formulated using the homological algebra of operads. A morphism of operads $f:\mathcal{O}\rightarrow\mathcal{P}$ describes a functor allowing a…

Rings and Algebras · Mathematics 2014-03-20 James Griffin

Hopf algebras, most generally in a semisimple abelian symmetric monoidal category, are here supposed to be commutative but not to be of finite-type, and their (equivariant) smoothness are discussed. Given a Hopf algebra $H$ in a category…

Rings and Algebras · Mathematics 2025-10-14 Kensuke Egami , Akira Masuoka , Kenta Suzuki

Diagrammatic sets are presheaves on a rich category of shapes, whose definition is motivated by combinatorial topology and higher-dimensional diagram rewriting. These shapes include representatives of oriented simplices, cubes, and positive…

Algebraic Topology · Mathematics 2024-07-16 Clémence Chanavat , Amar Hadzihasanovic

A supervised learning algorithm searches over a set of functions $A \to B$ parametrised by a space $P$ to find the best approximation to some ideal function $f\colon A \to B$. It does this by taking examples $(a,f(a)) \in A\times B$, and…

Category Theory · Mathematics 2019-05-02 Brendan Fong , David I. Spivak , Rémy Tuyéras