Related papers: Higher-order CPM Constructions
Categories, n-categories, double categories, and multicategories (among others) all have similar definitions as collections of cells with composition operations. We give an explicit description of the information required to define any…
Motivated by viewing categories as bimodule monoids over their isomorphism groupoids, we construct monoidal structures called plethysm products on three levels: that is for bimodules, relative bimodules and factorizable bimodules. For the…
By considering a generalisation of the CPM construction, we develop an infinite hierarchy of probabilistic theories, exhibiting compositional decoherence structures which generalise the traditional quantum-to-classical transition.…
We give a description of unital operads in a symmetric monoidal category as monoids in a monoidal category of unital $\Lambda$-sequences. This is a new variant of Kelly's old description of operads as monoids in the monoidal category of…
We construct a compact closed category out of any symmetric monoidal category by freely adding adjoints to its objects. The morphisms of the completion are defined as string diagrams annotated by objects and morphisms from the original…
We develop a theory of higher order structures in compact abelian groups. In the frame of this theory we prove general inverse theorems and regularity lemmas for Gowers's uniformity norms. We put forward an algebraic interpretation of the…
We present a method of constructing monoidal, braided monoidal, and symmetric monoidal bicategories from corresponding types of monoidal double categories that satisfy a lifting condition. Many important monoidal bicategories arise…
We introduce a functorial construction $\mathsf{C}$ which takes unitary magmas $\mathcal{M}$ as input and produces operads. The obtained operads involve configurations of chords labeled by elements of $\mathcal{M}$, called…
In this document, we collect a list of categorical structures on the category $\mathbf{Poly}$ of polynomial functors. There is no implied claim that this list is in any way complete. It includes: infinitely many monoidal structures, all but…
In categorical realizability, it is common to construct categories of assemblies and categories of modest sets from applicative structures. These categories have structures corresponding to the structures of applicative structures. In the…
We explore the sense in which the existing constructions for higher-order maps on quantum theory based on causality constraints and compositionality constraints respectively, coincide. More precisely, we construct a functor F : Caus(C) ->…
We produce a cofibrantly generated simplicial symmetric monoidal model structure for the category of (small unital) C*-categories, whose weak equivalences are the unitary equivalences. The closed monoidal structure consists of the maximal…
We study a functorial construction from the category of monoids to the category of set-operads and we give some combinatorial examples of applications.
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…
We construct bases for the spaces of higher order modular forms of all orders and weights. We also provide a cohomological interpretation of these forms.
Pursuing a generalization of group symmetries of modular categories to category symmetries in topological phases of matter, we study linear Hopf monads. The main goal is a generalization of extension and gauging group symmetries to category…
We show how monoidal adjunctions can be used to prove the existence of monoidal abelian envelopes of pseudo-tensor categories, in particular, those admitting a combinatorial description with certain properties. We derive concrete general…
Interpretation methods and their restrictions to polynomials have been deeply used to control the termination and complexity of first-order term rewrite systems. This paper extends interpretation methods to a pure higher order functional…
In arXiv:2209.06121, they defined a general plus construction for monoidal categories and showed that if the monoidal category is a unique factorization category, then the plus construction yields a Feynman category. In this paper, we will…
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…