Related papers: Remarks on combinatorial and accessible model cate…
We examine various categorical structures that can and cannot be constructed. We show that total computable functions can be mimicked by constructible functors. More generally, whatever can be done by a Turing machine can be constructed by…
We describe an equivalent formulation of algebraic weak factorisation systems, not involving monads and comonads, but involving double categories of morphisms equipped with a lifting operation satisfying lifting and factorisation axioms.
We show that the classifying category C(T) of a dependent type theory T with axioms for identity types admits a non-trivial weak factorisation system. We provide an explicit characterisation of the elements of both the left class and the…
We define quasi--locally presentable categories as big unions of coreflective subcategories which are locally presentable. Under appropriate hypotheses we prove a representability theorem for exact contravariant functors defined on a…
We generalize the small object argument in order to allow for its application to proper classes of maps (as opposed to sets of maps in Quillen's small object argument). The necessity of such a generalization arose with appearance of several…
We introduce a new class of categories generalizing locally presentable ones. The distinction does not manifest in the abelian case and, assuming Vopenka's principle, the same happens in the regular case. The category of complete partial…
We construct a wide subcategory of the category of finite association schemes with a collection of desirable properties. Our subcategory has a first isomorphism theorem analogous to that of groups. Also, standard constructions taking…
We generalize the concepts of locally presentable and accessible categories. Our framework includes such categories as small presheaves over large categories and ind-categories. This generalization is intended for applications in the…
We describe the structure of bimodules (over finite dimensional algebras) which have the property that the functor of tensoring with such a bimodule sends any module to a projective module. The main result is that all such bimodules are…
We introduce a notion of complexity of diagrams (and in particular of objects and morphisms) in an arbitrary category, as well as a notion of complexity of functors between categories equipped with complexity functions. We discuss several…
We distinguish between faint, weak, strong and strict localizations of categories at morphism families and show that this framework captures the different types of derived functors that are considered in the literature. More precisely, we…
It is well known that to give an oplax functor of bicategories $\mathbf{1}\to\mathscr{C}$ is to give a comonad in $\mathscr{C}$. Here we generalize this fact, replacing the terminal bicategory by any bicategory $\mathscr{A}$ for which the…
We prove an adjoint functor theorem in the setting of categories enriched in a monoidal model category $\mathcal V$ admitting certain limits. When $\mathcal V$ is equipped with the trivial model structure this recaptures the enriched…
It is shown that every concretizable category can be fully embedded into the category of accessible set functors and natural transformations.
In recent work of Lindenhovius and Zamdzhiev, it was established that the category of complete operator spaces, with completely contractive linear maps as morphisms, is locally countably presentable. In this work, we extend their conclusion…
We consider the lattice of all the weak factorization systems on a given finite lattice. We prove that it is semidistributive, trim and congruence uniform. We deduce a graph theoretical approach to the problem of enumerating transfer…
In this expository article, we will give an efficient functorial proof of the equivalence of various characterisations of purity in a finitely accessible additive category $\mathcal C$. The complications of the proofs for specific choices…
Given a pair of adjoint functors between two arbitrary categories it induces mutually inverse equivalences between the full subcategories of the initial ones, consisting of objects for which the arrows of adjunction are isomorphisms. We…
We show that additive induced-hereditary properties of coloured hypergraphs can be uniquely factorised into irreducible factors. Our constructions and proofs are so general that they can be used for arbitrary concrete categories of…
In the present article, we describe constructions of model structures on general bicomplete categories. We are motivated by the following question: given a category $\mathcal{C}$ with a subcategory $w\mathcal{C}$ closed under retracts, when…