Related papers: Six-Functor Formalisms I : Constructing functors u…
There is an ``algebraisation'' of the notion of weak factorisation system (w.f.s.) known as a natural weak factorisation system. In it, the two classes of maps of a w.f.s. are replaced by two categories of maps-with-structure, where the…
We introduce a formalism based on a combinatorial notion of cell complex subject to an inclusion-reversing duality operation. Our main goal is to open the way for a functorial definition of field theories in a context where no manifold or…
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 present a unified theory for formal mathematical systems including recursive systems closely related to formal grammars, including the predicate calculus as well as a formal induction principle. We introduce recursive systems generating…
The small object argument is a method for transfinitely constructing weak factorization systems originally motivated by homotopy theory. We establish a variant of the small object argument that is enriched over a cofibrantly generated weak…
Category theory is the language of homological algebra, allowing us to state broadly applicable theorems and results without needing to specify the details for every instance of analogous objects. However, authors often stray from the realm…
We extend the notion of a factorization system in a category to the realm of $\infty$-categories. To this end, we provide a description of the category of $\infty$-categories with factorization systems as the category of presheaves of…
The aim of these notes is to introduce the intuition motivating the notion of a "complicial set", a simplicial set with certain marked "thin" simplices that witness a composition relation between the simplices on their boundary. By varying…
We analyze the structure of left maps in algebraic weak factorization systems constructed using Garner's algebraic small object argument. We find that any left map can be constructed from generators in Bourke and Garner's double category of…
We study the circumstances under which one can reconstruct a stack from its associated functor of isomorphism classes. This is possible surprisingly often: we show that many of the standard examples of moduli stacks are determined by their…
In this work we discuss a new type of factorisation systems for \textbf{Ord}-enriched categories. We start by defining the new notion of lax weak orthogonality, which involves the existence of lax diagonal morphisms for lax squares. Using…
In categorical compositional semantics of natural language one studies functors from a category of grammatical derivations (such as a Lambek pregroup) to a semantic category (such as real vector spaces). We compositionally build…
Modular functors, i.e. consistent systems of projective representations of mapping class groups of surfaces, have been constructed for non-semisimple modular categories already decades ago. Concepts from homological algebra have not been…
We put a model structure on the category of categories internal to simplicial sets whose weak equivalences are reflected by the nerve functor to bisimplicial sets with Rezk's model structure. This model structure is shown to be Quillen…
We examine the use of classes to formulate several categorical notions. This leads to two proposals: an explicit structure for working with subobjects, and a hierarchy of $k$-classes. We apply the latter to both ordinary and higher…
From the work of Bauer and Lesnick, it is known that there is no functor from the category of pointwise finite-dimensional persistence modules to the category of barcodes and overlap matchings. In this work, we introduce sub-barcodes and…
We present a method to simplify expressions in the context of an equational theory. The basic ideas and concepts of the method have been presented previously elsewhere but here we tackle the difficult task of making it efficient in…
This article is an introduction to the basic generalized category theory used in recent work on an extension of the theory of categories and categorical logic, including parts of topos theory. We discuss functors, equivalences, natural…
Span categories provide an abstract framework for formalizing mathematical models of certain systems. The mathematical descriptions of some systems, such as classical mechanical systems, require categories that do not have pullbacks, and…
We realize the embedding functor from pseudotensor category to tensor category in a purely algebraic setting when the pseudotensor category is the category $\mathcal{M}(H)$ of left $H$-modules, which is originally defined by Beilinson and…