Related papers: Hypergraph Categories
Hypergraphs, increasingly utilised for modelling complex and diverse relationships in modern networks, gain much attention representing intricate higher-order interactions. Among various challenges, cohesive subgraph discovery is one of the…
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…
These notes were originally developed as lecture notes for a category theory course. They should be well-suited to anyone that wants to learn category theory from scratch and has a scientific mind. There is no need to know advanced…
We present a formalization in Lean 4, within the framework of the mathematical library Mathlib, of the unbiasing process for symmetric monoidal categories. This is realized by extending the data of a symmetric monoidal category to a…
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…
A hypergraph is called an r by r grid if it is isomorphic to a pattern of r horizontal and r vertical lines. Three sets form a triangle if they pairwise intersect in three distinct singletons. A hypergraph is linear if every pair of edges…
Commutative Hilbertian Frobenius algebras are those commutative semi-group objects in the monoidal category of Hilbert spaces, for which the Hilbert adjoint of the multiplication satisfies the Frobenius compatibility relation, that is, this…
We associate a diagrammatic monoidal category $\mathcal{H}\textit{eis}_k(A;z,t)$, which we call the quantum Frobenius Heisenberg category, to a symmetric Frobenius superalgebra $A$, a central charge $k \in \mathbb{Z}$, and invertible…
Equality saturation, a technique for program optimisation and reasoning, has gained attention due to the resurgence of equality graphs (e-graphs). E-graphs represent equivalence classes of terms under rewrite rules, enabling simultaneous…
We exhibit the symmetric monoidal $\infty$-category $\mathrm{GrCob}$ of graph cobordisms between spaces as a full $\infty$-subcategory of the $\infty$-category $\mathrm{Psh}(\mathrm{Gr})$ of presheaves over $\mathrm{Gr}$, where…
We prove that the arrow category of a monoidal model category, equipped with the pushout product monoidal structure and the projective model structure, is a monoidal model category. This answers a question posed by Mark Hovey, and has the…
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,…
The category $\mathbf{Rel}$ is the category of sets (objects) and relations (morphisms). Equipped with the direct product of sets, $\mathbf{Rel}$ is a monoidal category. Moreover, $\mathbf{Rel}$ is a locally posetal 2-category, since every…
A relational structure is homomorphism-homogeneous (HH-homogeneous for short) if every homomorphism between finite induced substructures of the structure can be extended to a homomorphism over the whole domain of the structure. Similarly, a…
It is common to encounter symmetric monoidal categories $\mathcal{C}$ for which every object is equipped with an algebraic structure, in a way that is compatible with the monoidal product and unit in $\mathcal{C}$. We define this formally…
In this paper we give a summary of the comparisons between different definitions of so-called (\infty,1)-categories, which are considered to be models for \infty-categories whose n-morphisms are all invertible for n>1. They are also, from…
In this article we investigate which categorical structures of a category C are inherited by its arrow category. In particular, we show that a monoidal equivalence between two categories gives rise to a monoidal equivalence between their…
Given a hypergraph $\mathcal{H}$, the dual hypergraph of $\mathcal{H}$ is the hypergraph of all minimal transversals of $\mathcal{H}$. The dual hypergraph is always Sperner, that is, no hyperedge contains another. A special case of Sperner…
In this chapter we survey some particular topics in category theory in a somewhat unconventional manner. Our main focus will be on monoidal categories, mostly symmetric ones, for which we propose a physical interpretation. These are…
We present a novel attribute learning framework named Hypergraph-based Attribute Predictor (HAP). In HAP, a hypergraph is leveraged to depict the attribute relations in the data. Then the attribute prediction problem is casted as a…