Related papers: Rewriting in Free Hypergraph Categories
String diagrams are a powerful tool for reasoning about composite structures in symmetric monoidal categories. By representing string diagrams as graphs, equational reasoning can be done automatically by double-pushout rewriting. !-graphs…
This paper provides geometrical descriptions of the Frobenius monad freely generated by a single object. These descriptions are related to results connecting Frobenius algebras and topological quantum field theories. In these descriptions,…
The structure of monoidal categories in which every arrow is invertible is analyzed in this paper, where we develop a 3-dimensional Schreier-Grothendieck theory of non-abelian factor sets for their classification. In particular, we state…
Kan extensions provide a natural general framework for a variety of combinatorial problems. We have developed rewriting procedures for Kan extensions (over the category of sets) and this enables one program to address a wide range of…
A modular tensor category provides the appropriate data for the construction of a three-dimensional topological field theory. We describe the following analogue for two-dimensional conformal field theories: a 2-category whose objects are…
We show that the derived center of the category of simplicial algebras over every algebraic theory is homotopically discrete, with the abelian monoid of components isomorphic to the center of the category of discrete algebras. For example,…
Originally introduced in the context of the algebraic approach to term graph rewriting, the notion of gs-monoidal category has surfaced a few times under different monikers in the last decades. They can be thought of as symmetric monoidal…
It is known that the quantale of sup-preserving maps from a complete lattice to itself is a Frobenius quantale if and only if the lattice is completely distributive. Since completely distributive lattices are the nuclear objects in the…
We introduce the category of singular 2-dimensional cobordisms and show that it admits a completely algebraic description as the free symmetric monoidal category on a twin Frobenius algebra, by providing a description of this category in…
Frobenius-Schur indicators (or indicators for short) of objects in pivotal monoidal categories were defined and formulated by Ng and Schauenburg in 2007. In this paper, we introduce and study an analogous formula for indicators in the dual…
We extend the theory of Sweeder's measuring comonoids to the framework of duoidal categories: categories equipped with two compatible monoidal structures. We use one of the tensor products to endow the category of monoids for the other with…
We define a Frobenius algebra over fusion categories of the form Rep$(G)\boxtimes$Rep$(G)$ which generalizes the diagonal subgroup of $G\times G$. This allows us to extend field theoretical constructions which depend on the existence of a…
Grothendieck-Verdier categories (also known as $\ast$-autonomous categories) generalize rigid monoidal categories, with notable representation-theoretic examples including categories of bimodules, modules over Hopf algebroids, and modules…
To each symmetric graded Frobenius superalgebra we associate a W-algebra. We then define a linear isomorphism between the trace of the Frobenius Heisenberg category and a central reduction of this W-algebra. We conjecture that this is an…
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…
Polynomials in a category have been studied as a generalization of the traditional notion in mathematics. Their construction has recently been extended to higher groupoids, as formalized in homotopy type theory, by Finster, Mimram, Lucas…
The notion of proof-net category defined in this paper is closely related to graphs implicit in proof nets for the multiplicative fragment without constant propositions of linear logic. Analogous graphs occur in Kelly's and Mac Lane's…
The aim of this thesis is to present an extension to the string graphs of Dixon, Duncan and Kissinger that allows the finite representation of certain infinite families of graphs and graph rewrite rules, and to demonstrate that a logic can…
It is well-known that combinatorial circuits are modeled mathematically by string diagrams in a monoidal category. Given a gate set $\Sigma$, the circuits over $\Sigma$ can be thought of as string diagrams in the free monoidal category…
We study monoidal profunctors as a tool to reason and structure pure functional programs both from a categorical perspective and as a Haskell implementation. From the categorical point of view we approach them as monoids in a certain…