Related papers: Taming large categories
We define a notion of colimit for diagrams in a motivic category indexed by a presheaf of spaces (e.g. an \'etale classifying space), and we study basic properties of this construction. As a case study, we construct the motivic analogs of…
This paper describes the intense software filtering that has allowed the arXiv eprint repository to sort and process large numbers of submissions with minimal human intervention, making it one of the most important and influential cases of…
A general method for lifting weak factorization systems in a category S to model category structures on simplicial objects in S is described, analogously to the lifting of cotorsion pairs in Abelian categories to model category structures…
This paper describes TextTiling, an algorithm for partitioning expository texts into coherent multi-paragraph discourse units which reflect the subtopic structure of the texts. The algorithm uses domain-independent lexical frequency and…
This is an introduction to the study of abstract homotopy theory by means of model categories and $(\infty,1)$-categories. The only prerequisites are very basic general topology and abstract algebra. None categorical background is needed.…
Compact categories have lately seen renewed interest via applications to quantum physics. Being essentially finite-dimensional, they cannot accomodate (co)limit-based constructions. For example, they cannot capture protocols such as quantum…
We exhibit a Quillen equivalence between two model categories encoding the homotopy theory of stratified spaces : the model category of filtered simplicial sets, and that of filtered spaces. Additionally, we introduce a new class of…
The concept of category from mathematics happens to be useful to computer programmers in many ways. Unfortunately, all "good" explanations of categories so far have been designed by mathematicians, or at least theoreticians with a strong…
Given a suitable functor T:C -> D between model categories, we define a long exact sequence relating the homotopy groups of any X in C with those of TX, and use this to describe an obstruction theory for lifting an object G in D to C.…
Superpixel segmentation consists of partitioning images into regions composed of similar and connected pixels. Its methods have been widely used in many computer vision applications since it allows for reducing the workload, removing…
This document is an informal bibliography of the papers dealing with distributed approximation algorithms. A classic setting for such algorithms is bounded degree graphs, but there is a whole set of techniques that have been developed for…
The purpose of these notes is to collect in one place some facts on the category of finite totally ordered sets and some related categories. More specifically, we collect some results on them which will be useful for the study of iteratedly…
A restriction category is an abstract formulation for a category of partial maps, defined in terms of certain specified idempotents called the restriction idempotents. All categories of partial maps are restriction categories; conversely, a…
Building on a previous definition of homotopy limit of model categories, we give a definition of homotopy colimit of model categories. Using the complete Segal space model for homotopy theories, we verify that this definition corresponds to…
In this article we consider the homotopy theory of stratified spaces through a simplicial point of view. We first consider a model category of filtered simplicial sets over some fixed poset $P$, and show that it is a simplicial…
We construct a machine which takes as input a locally small symmetric closed complete multicategory $\mathsf V$. And its output is again a locally small symmetric closed complete multicategory $\mathsf V\text-\mathcal{C}at$, the…
Some aspects of basic category theory are developed in a finitely complete category $\C$, endowed with two factorization systems which determine the same discrete objects and are linked by a simple reciprocal stability law. Resting on this…
Machines whose main purpose is to permute and sort data are studied. The sets of permutations that can arise are analysed by means of finite automata and avoided pattern techniques. Conditions are given for these sets being enumerated by…
Quillen defined a {\em model category} to be a category with finite limits and colimits carrying a certain extra structure. In this paper, we show that only finite products and coproducts (in addition to the certain extra structure alluded…
We prove that the homotopy theory of parsummable categories (as defined by Schwede) with respect to the underlying equivalences of categories is equivalent to the usual homotopy theory of symmetric monoidal categories. In particular, this…