Related papers: Coherence in monoidal track categories
We define and develop the infrastructure of homotopical inverse diagrams in categories with attributes. Specifically, given a category with attributes $C$ and an ordered homotopical inverse category $I$, we construct the category with…
We use traced monoidal categories to give a precise general version of "geometry of interaction". We give a number of examples of both "particle-style" and "wave-style" instances of this construction. We relate these ideas to semantics of…
We develop a notion of iterated monoidal category and show that this notion corresponds in a precise way to the notion of iterated loop space. Specifically the group completion of the nerve of such a category is an iterated loop space and…
We construct model category structures for monoids and modules in symmetric monoidal model categories which satisfy an extra axiom, the monoidal axiom, with applications to symmetric spectra and $\Gamma$-spaces.
We give sufficient conditions for homotopical localization functors to preserve algebras over coloured operads in monoidal model categories. Our approach encompasses a number of previous results about preservation of structures under…
Univalent categories constitute a well-behaved and useful notion of category in univalent foundations. The notion of univalence has subsequently been generalized to bicategories and other structures in (higher) category theory. Here, we…
Retrieval of classical behaviour in quantum cosmology is usually discussed in the framework of minisuperspace models in the presence of scalar fields together with the inhomogeneous modes either of the gravitational or of the scalar fields.…
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…
We define bicategories internal to 2-categories. When the ambient 2-category is symmetric monoidal categories, this provides a convenient framework for encoding the structures of a symmetric monoidal 3-category. This framework is well…
Using the braided version of Lawvere's algebraic theories and Mac Lane's PROPs, we introduce polynomial identities for arbitrary algebraic structures in a braided monoidal category C as well as their codimensions in the case when C is…
This paper expands further on a category theoretical formulation of Hochschild cohomology for monoid objects in monoidal categories enriched over abelian groups, which has been studied in arXiv:1605.00842. This topic was also presented at…
The superform construction of supersymmetric invariants, which consists of integrating the top component of a closed superform over spacetime, is reviewed. The cohomological methods necessary for the analysis of closed superforms are…
We prove coherence theorems for Frobenius pseudomonoids and snakeorators in monoidal bicategories. As a consequence we obtain a 3d notation for proofs in nonsymmetric multiplicative linear logic, with a geometrical notion of equivalence,…
We prove coherence theorems for dualizable objects in monoidal bicategories and for fully dualizable objects in symmetric monoidal bicategories, describing coherent dual pairs and coherent fully dual pairs. These are property-like…
This paper considers the difficulty in the set-system approach to generalizing graph theory. These difficulties arise categorically as the category of set-system hypergraphs is shown not to be cartesian closed and lacks enough projective…
The notion of homomorphism indistinguishability offers a combinatorial framework for characterizing equivalence relations of graphs, in particular equivalences in counting logics within finite model theory. That is, for certain graph…
The category Set_* of sets and partial functions is well-known to be traced monoidal, meaning that a partial function S+U -/-> T+U can be coherently transformed into a partial function S -/-> T. This transformation is generally described in…
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…
A multicategory is what remains of a monoidal category when monoidal product is not available. A weak multicategory means that hom-sets are in fact categories, and in place of usual equations, there are natural isomorphisms, which have to…
This work contributes to clarifying several relationships between certain higher categorical structures and the homotopy type of their classifying spaces. Bicategories (in particular monoidal categories) have well understood simple…