output
19992026
most citedSciPy 1.0--Fundamental Algorithms for Scientific Computing in Python

40.2k citations

Showing math.CTShow all

29 papers · 1 filter

math.CT2026

A Critical Pair Enumeration Algorithm for String Diagram Rewriting

Anna Matsui, Innocent Obi, Guillaume Sabbagh +4

Critical pair analysis provides a convenient and computable criterion of confluence, which is a fundamental property in rewriting theory, for a wide variety of rewriting systems. B…

math.CT2025

The free bifibration on a functor

Bryce Clarke, Gabriel Scherer, Noam Zeilberger

We consider the problem of constructing the free bifibration generated by a functor of categories . This problem was previously considered by Lamarche, and is closely…

math.CT2025

Exponentiable virtual double categories and presheaves for double categories

Nathanael Arkor

Given a pair of pseudo double categories and , the lax functors from to , along with their transformations, modules, and multimodulati…

math.CT2025

Dagger-Drazin Inverses

Robin Cockett, Jean-Simon Pacaud Lemay, Priyaa Varshinee Srinivasan

Drazin inverses are a special kind of generalized inverses that can be defined for endomorphisms in any category. A natural question to ask is whether one can somehow extend the no…

math.CT2024

Equivalences in diagrammatic sets

Clémence Chanavat, Amar Hadzihasanovic

We show that diagrammatic sets, a topologically sound alternative to polygraphs and strict -categories, admit an internal notion of equivalence in the sense of coinductive weak…

math.CT2024

Di- is for Directed: First-Order Directed Type Theory via Dinaturality

Andrea Laretto, Fosco Loregian, Niccolò Veltri

We show how dinaturality plays a central role in the interpretation of directed type theory where types are interpreted as (1-)categories and directed equality is represented by $\…

math.CT2024

Automata and coalgebras in categories of species

Fosco Loregian

We study generalized automata (in the sense of Adámek-Trnková) in Joyal's category of (set-valued) combinatorial species, and as an important preliminary step, we study coalgebras…

math.CT2023★ 2 cited

Obstructions to Compositionality

Caterina Puca, Amar Hadzihasanovic, Fabrizio Genovese +1

Compositionality is at the heart of computer science and several other areas of applied category theory such as computational linguistics, categorical quantum mechanics, interpreta…

math.CT2023★ 1 cited

Protocol Choice and Iteration for the Free Cornering

Chad Nester, Niels Voorneveld

We extend the free cornering of a symmetric monoidal category, a double categorical model of concurrent interaction, to support branching communication protocols and iterated commu…

math.CT2023★ 1 cited

String Diagrams for Premonoidal Categories

Mario Román, Paweł Sobociński

Premonoidal categories are monoidal categories without the interchange law while effectful categories are premonoidal categories with a chosen monoidal subcategory of interchanging…

math.CT2023★ 1 cited

Optics for Premonoidal Categories

James Hefford, Mario Román

We further the theory of optics or "circuits-with-holes" to encompass premonoidal categories: monoidal categories without the interchange law. Every premonoidal category gives rise…

math.CT2023★ 1 cited

Collages of String Diagrams

Dylan Braithwaite, Mario Román

We introduce collages of string diagrams as a diagrammatic syntax for glueing multiple monoidal categories. Collages of string diagrams are interpreted as pointed bimodular profunc…

math.CT2023★ 1 cited

Completeness for categories of generalized automata

Guido Boccali, Andrea Laretto, Fosco Loregian +1

We present a slick proof of completeness and cocompleteness for categories of -automata, where the span of maps that usually defines a determinist…

math.CT2023★ 2 cited

Bicategories of Automata, Automata in Bicategories

Guido Boccali, Andrea Laretto, Fosco Loregian +1

We study bicategories of (deterministic) automata, drawing from prior work of Katis-Sabadini-Walters, and Di Lavore-Gianola-Román-Sabadini-Sobociński, and linking their bicategorie…

math.CT2022★ 2 cited

Data Structures for Topologically Sound Higher-Dimensional Diagram Rewriting

Amar Hadzihasanovic, Diana Kessler

We present a computational implementation of diagrammatic sets, a model of higher-dimensional diagram rewriting that is "topologically sound": diagrams admit a functorial interpret…

math.CT2022

Fibrational Linguistics (FibLang): Language Acquisition

Fabrizio Genovese, Fosco Loregian, Caterina Puca

In this work we show how FibLang, a category-theoretic framework concerned with the interplay between language and meaning, can be used to describe vocabulary acquisition, that is…

math.CT2022

Monoidal Width: Capturing Rank Width

Elena Di Lavore, Paweł Sobociński

Monoidal width was recently introduced by the authors as a measure of the complexity of decomposing morphisms in monoidal categories. We have shown that in a monoidal category of c…

math.CT2022★ 2 cited

Promonads and String Diagrams for Effectful Categories

Mario Román

Premonoidal and Freyd categories are both generalized by non-cartesian Freyd categories: effectful categories. We construct string diagrams for effectful categories in terms of the…

math.CT2022★ 2 cited

Cornering Optics

Guillaume Boisseau, Chad Nester, Mario Román

We show that the category of optics in a monoidal category arises naturally from the free cornering of that category. Further, we show that the free cornering of a monoidal categor…

math.CT2021

Dialectica Petri Nets

Elena Di Lavore, Wilmer Leal, Valeria de Paiva

The categorical modeling of Petri nets has received much attention recently. The Dialectica construction has also had its fair share of attention. We revisit the use of the Dialect…

math.CT2021

A Variety Theorem for Relational Universal Algebra

Chad Nester

We develop an analogue of universal algebra in which generating symbols are interpreted as relations. We prove a variety theorem for these relational algebraic theories, in which w…

math.CT2021

Situated Transition Systems

Chad Nester

We construct a monoidal category of open transition systems that generate material history as transitions unfold, which we call situated transition systems. The material history ge…

math.CT2021★ 1 cited

Differential 2-rigs

Fosco Loregian, Todd Trimble

We study the notion of a "differential 2-rig", a category R with coproducts and a monoidal structure distributing over them, also equipped with an endofunctor D : R -> R that satis…

math.CT2021★ 4 cited

A Categorical Semantics for Hierarchical Petri Nets

Fabrizio Romano Genovese, Jelle Herold, Fosco Loregian +1

We show how a particular variety of hierarchical nets, where the firing of a transition in the parent net must correspond to an execution in some child net, can be modelled utilizi…