English
Related papers

Related papers: Rewriting for Symmetric Monoidal Categories with C…

200 papers

We discuss an explicit construction of a string dual for the Gaussian matrix model. Starting from the matrix model and employing Strebel differential techniques we deduce hints about the structure of the dual string. Next, following these…

High Energy Physics - Theory · Physics 2010-03-19 Shlomo S. Razamat

This paper investigates the use of symmetric monoidal closed (SMC) structure for representing syntax with variable binding, in particular for languages with linear aspects. In our setting, one first specifies an SMC theory T, which may…

Logic in Computer Science · Computer Science 2009-05-27 Richard Garner , Tom Hirschowitz , Aurélien Pardon

Motivated by the Moore-Segal axioms for an open-closed topological field theory, we consider planar open string topological field theories. We rigorously define a category 2Thick whose objects and morphisms can be thought of as open strings…

Quantum Algebra · Mathematics 2007-05-23 Aaron D. Lauda

This article aims to provide a novel formalization of the concept of computational irreducibility in terms of the exactness of functorial correspondence between a category of data structures and elementary computations and a corresponding…

Computational Complexity · Computer Science 2023-01-13 Jonathan Gorard

We consider commutative Frobenius pseudomonoids in the bicategory of spans, and we show that they are in correspondence with 2-Segal cosymmetric sets. Such a structure can be interpreted as a coherent 2-dimensional topological quantum field…

Algebraic Topology · Mathematics 2026-01-01 Sophia E Marx , Rajan Amit Mehta

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

When designing plans in engineering, it is often necessary to consider attributes associated to objects, e.g. the location of a robot. Our aim in this paper is to incorporate attributes into existing categorical formalisms for planning,…

Category Theory · Mathematics 2021-01-27 Spencer Breiner , John S. Nolan

In this paper I consider all possible properties from commutative algebra for polynomial composites and monoid domains. The aim is full characterization of these structures. I start with the examination of group, ring, modules properties,…

Commutative Algebra · Mathematics 2020-06-29 Lukasz Matysiak

This paper is a fundamental study of comodules and contramodules over a comonoid in a symmetric closed monoidal category. We study both algebraic and homotopical aspects of them. Algebraically, we enrich the comodule and contramodule…

Category Theory · Mathematics 2023-03-21 Katerina Hristova , John Jones , Dmitriy Rumynin

A foundational theory of compositional categorical rewriting theory is presented, based on a collection of fibration-like properties that collectively induce and intrinsically structure the large collection of lemmata used in the proofs of…

Logic in Computer Science · Computer Science 2023-07-17 Nicolas Behr , Russ Harmer , Jean Krivine

The recent developments in string theory suggest that the space-time coordinates should be generalized to non-commuting matrices. Postulating this suggestion as the fundamental geometrical principle, we formulate a candidate for covariant…

High Energy Physics - Theory · Physics 2009-10-30 Christiaan Hofman , Jae-Suk Park

The technique of \emph{equality saturation}, which equips graphs with an equivalence relation, has proven effective for program optimisation. We give a categorical semantics to these structures, called \emph{e-graphs}, in terms of Cartesian…

Logic in Computer Science · Computer Science 2025-05-21 Aleksei Tiurin , Chris Barrett , Dan R. Ghica , Nick Hu

We present a new and powerful algebraic framework for graph rewriting, based on drags, a class of graphs enjoying a novel composition operator. Graphs are embellished with roots and sprouts, which can be wired together to form edges. Drags…

Logic in Computer Science · Computer Science 2024-06-28 Nachum Dershowitz , Jean-Pierre Jouannaud , Fernando Orejas

In this paper, we study rewriting modulo a set of algebraic axioms in categories enriched in linear categories, called linear~$(2,2)$-categories. We introduce the structure of linear~$(3,2)$-polygraph modulo as a presentation of a…

Category Theory · Mathematics 2019-06-11 Benjamin Dupont

We introduce context-free languages of morphisms in monoidal categories, extending recent work on the categorification of context-free languages, and regular languages of string diagrams. Context-free languages of string diagrams include…

Formal Languages and Automata Theory · Computer Science 2024-04-17 Matt Earnshaw , Mario Román

Premonoidal categories are monoidal categories without the interchange law while effectful categories are premonoidal categories with a chosen monoidal subcategory of interchanging morphisms. In the same sense that string diagrams,…

Category Theory · Mathematics 2025-05-07 Mario Román , Paweł Sobociński

Suppose given a Frobenius category E, i.e. an exact category with a big enough subcategory B of bijectives. Let_E_ := E/B denote its classical stable category. For example, we may take E to be the category of complexes C(A) with entries in…

Category Theory · Mathematics 2007-05-23 Matthias Kuenzer

A double category is constructed from a `fattened' version of a given category, motivated in part by a context of parallel transport. We also study monoidal structures on the underlying category and on the fattened category.

Mathematical Physics · Physics 2012-05-17 Saikat Chatterjee , Amitabha Lahiri , Ambar N. Sengupta

We develop the theory of strong and commutative monads in the 2-dimensional setting of bicategories. This provides a framework for the analysis of effects in many recent models which form bicategories and not categories, such as those based…

Logic in Computer Science · Computer Science 2024-06-12 Hugo Paquet , Philip Saville

We introduce nominal string diagrams as, string diagrams internal in the category of nominal sets. This requires us to take nominal sets as a monoidal category, not with the cartesian product, but with the separated product. To this end, we…

Logic in Computer Science · Computer Science 2019-04-17 Samuel Balco , Alexander Kurz
‹ Prev 1 3 4 5 6 7 10 Next ›