Related papers: Hypergraph Categories
Metric approximate categories, or metagories, for short, are metrically enriched graphs. Their structure assigns to every directed triangle in the graph a value which may be interpreted as the area of the triangle; alternatively, as the…
The goal of this paper is to prove coherence results with respect to relational graphs for monoidal monads and comonads, i.e. monads and comonads in a monoidal category such that the endofunctor of the monad or comonad is a monoidal functor…
We develop an algebraic and operational framework for quantum isomorphisms of hypergraphs, using tools from compact quantum group theory. We introduce a new synchronous version of the hypergraph isomorphism game whose game algebra uniformly…
A general result relating skew monoidal structures and monads is proved. This is applied to quantum categories and bialgebroids. Ordinary categories are monads in the bicategory whose morphisms are spans between sets. Quantum categories…
Given a symmetric monoidal $(\infty,n)$-category $\mathcal{C}$ and a space $X$, we address the problem of explicitly describing the symmetric monoidal $(\infty,n)$-category freely obtained from $\mathcal{C}$ by adjoining $X$ new…
As an example of the categorical apparatus of pseudo algebras over 2-theories, we show that pseudo algebras over the 2-theory of categories can be viewed as pseudo double categories with folding or as appropriate 2-functors into…
Process theories combine a graphical language for compositional reasoning with an underlying categorical semantics. They have been successfully applied to fields such as quantum computation, natural language processing, linear dynamical…
Category theory is a branch of mathematics that provides a formal framework for understanding the relationship between mathematical structures. To this end, a category not only incorporates the data of the desired objects, but also…
This paper introduces an inherently strict presentation of categories with products, coproducts, or symmetric monoidal products that is inspired by file systems and directories. Rather than using nested binary tuples to combine objects or…
We explore the connection between the notion of Hopf category and the categorification of the infinite dimensional Heisenberg algebra via graphical calculus proposed by M.Khovanov. We show that the existence of a Hopf structure on a…
In this paper, we introduce a cofibrant simplicial category that we call the free homotopy coherent adjunction and characterize its n-arrows using a graphical calculus that we develop here. The hom-spaces are appropriately fibrant, indeed…
A duality between the category of convex spaces and measurable spaces arises from the existence of the unit interval, which is an object in both these categories. The full subcategory of the category of convex spaces, consisting of just the…
A series of works has established rewriting as an essential tool in order to prove coherence properties of algebraic structures, such as MacLane's coherence theorem for monoidal categories, based on the observation that, under reasonable…
Adhesive and quasiadhesive categories provide a general framework for the study of algebraic graph rewriting systems. In a quasiadhesive category any two regular subobjects have a join which is again a regular subobject. Vice versa, if…
Given an algebraic theory which can be described by a (possibly symmetric) operad $P$, we propose a definition of the \emph{weakening} (or \emph{categorification}) of the theory, in which equations that hold strictly for $P$-algebras hold…
In this note we study symmetric monoidal functors from a symmetric monoidal 1-category to a cartesian symmetric monoidal $\infty$-category, which are in addition hypersheaves for a certain topology. We prove a symmetric monoidal version of…
Graphs and various graph-like combinatorial structures, such as preorders and hypergraphs, are ubiquitous in programming. This paper focuses on representing graphs in a purely functional programming language like Haskell. There are several…
To characterize categorical constraints - associativity, commutativity and monoidality - in the context of quasimonoidal categories, from a cohomological point of view, we define the notion of a parity (quasi)complex. Applied to groups…
We study a naturally occurring $E_{\infty}$-subalgebra of the full $E_2$-Hochschild cochain complex arising from coherent cochains. For group rings and certain category algebras, these cochains detect $H^*(B {\cal{C}})$, the simplicial…
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…