Related papers: Adhesive category theory for graph rewriting in Ro…
The category ${\rm Rel}(\mathcal{C})$ may be formed for any category $\mathcal{C}$ with finite limits using the same objects as $\mathcal{C}$ but whose morphisms from $X$ to $Y$ are binary relations in $\mathcal{C}$, that is, subobjects of…
Our aim is to give a fairly complete account on the construction of compatible model structures on exact categories and symmetric monoidal exact categories, in some cases generalizing previously known results. We describe the close…
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 consider constrained variants of graph homomorphisms such as embeddings, monomorphisms, full homomorphisms, surjective homomorpshims, and locally constrained homomorphisms. We also introduce a new variation on this theme which derives…
In the standard Category of Graphs, the graphs allow only one edge to be incident to any two vertices, not necessarily distinct, and the graph morphisms must map edges to edges and vertices to vertices while preserving incidence. We refer…
Constraint Satisfaction Problem (CSP) is a fundamental algorithmic problem that appears in many areas of Computer Science. It can be equivalently stated as computing a homomorphism $\mbox{$\bR \rightarrow \bGamma$}$ between two relational…
Category theory provides a compact method of encoding mathematical structures in a uniform way, thereby enabling the use of general theorems on, for example, equivalence and universal constructions. In this article we develop the method of…
In recent work by Johnson et al. (2022), a framework was described for the study of graph problems over classes specified by omitting each of a finite set of graphs as subgraphs. If a problem falls into the framework then its computational…
We develop a categorical and algebro-geometric treatment of localization for cohomological theories endowed with an open--closed recollement. Starting from a class on a space whose restriction to the open complement vanishes, we show that…
Node classification and graph classification are two graph learning problems that predict the class label of a node and the class label of a graph respectively. A node of a graph usually represents a real-world entity, e.g., a user in a…
Restriction categories were introduced to provide an axiomatic setting for the study of partially defined mappings; they are categories equipped with an operation called restriction which assigns to every morphism an endomorphism of its…
Derivators, introduced independently by Grothendieck and Heller in the 1980s, provide a categorical framework for studying homotopy theory. They are based on the idea that, while the homotopy 1-category of a single model category or…
The two pillars of Algebraic topology - Homology and homotopy theory rely on the availability of basic building blocks called cells. Cells take the form of simplexes, and have properties such as faces, sub-cells, convexity and…
We introduce two 2-categories which categorify the monodromic Hecke algebra. The first is algebraic in nature and generalizes Abe's theory of Soergel bimodules. The second is a diagrammatic category defined via generators and relations…
A functor from the category of directed trees with inclusions to the category of commutative C*-algebras with injective *-homomorphisms is constructed. This is used to define a functor from the category of directed graphs with inclusions to…
We study monoidal categories that enjoy a certain weakening of the rigidity property, namely, the existence of a dualizing object in the sense of Grothendieck and Verdier. We call them Grothendieck-Verdier categories. Notable examples…
Restriction categories provide a categorical framework for partiality. In this paper, we introduce three new categorical theories for partiality: local categories, partial categories, and inclusion categories. The objects of a local…
String diagrams are pictorial representations for morphisms of symmetric monoidal categories. They constitute an intuitive and expressive graphical syntax, which has found application in a very diverse range of fields including concurrency…
We provide a criterion for the existence of right approximations in cocomplete additive categories; it is a straightforward generalisation of a result due to El Bashir. This criterion is used to construct adjoint functors in homotopy…
Categorification is the process of finding category-theoretic analogs of set-theoretic concepts by replacing sets with categories, functions with functors, and equations between functions by natural isomorphisms between functors, which in…