Related papers: Pasting in Simplicial Categories
We show that given any tiling of Euclidean space, any geometric patterns of points, we can find a patch of tiles (of arbitrarily large size) so that copies of this patch appear in the tiling nearly centered on a scaled and translated…
This thesis is devoted to the proof of a theorem showing the existence of a closed model category structure for weakly enriched categories. It requires first of all the definitions of weakly enriched categories and equivalences of weakly…
The additivity theorem for derivateurs associated to complicial biWaldhausen categories is proved. Also, to any exact category in the sense of Quillen a K-theory space is associated. This K-theory is shown to satisfy the additivity,…
We extend the framework of combinatorial model categories, so that the category of small presheaves over large indexing categories and ind-categories would be embraced by the new machinery called class-combinatorial model categories. The…
We propose a categorical framework to reason about scientific explanations: descriptions of a phenomenon meant to translate it into simpler terms, or into a context that has been already understood. Our motivating examples come from systems…
We prove a coherence theorem for actions of groups on monoidal categories. As an application we prove coherence for arbitrary braided $G$-crossed categories.
As an extension of positive and almost positive diagrams and links, we study two classes of links we call successively almost positive and weakly successively almost positive links. We prove various properties of polynomial invariants and…
This paper studies cutting and pasting groups (SK-groups) of pairs of manifolds. By a pair of manifolds we mean a manifold with a submanifold of strictly smaller dimension. Existing results in the unoriented category by Komiya are…
We prove a generalised interchange equality for 3-cells in a Gray-category, i.e. we show that it still holds modulo the unique isomorphism given by the Gray-categorical pasting theorem of Di Vittorio. This significantly simplifies many…
Categories of partial functions have become increasingly important principally because of their applications in theoretical computer science. In this note we prove that the category of partial bijections between sets as an…
We introduce enriched notions of purity depending on the left class $\mathcal E$ of a factorization system on the base $\mathcal V$ of enrichment. Ordinary purity is given by the class of surjective mappings in the category of sets. Under…
Diagram chasing is a customary proof method used in category theory and homological algebra. It involves an element-theoretic approach to show that certain properties hold for a commutative diagram. When dealing with abelian categories for…
We axiomatically define (pre-)Hilbert categories. The axioms resemble those for monoidal Abelian categories with the addition of an involutive functor. We then prove embedding theorems: any locally small pre-Hilbert category whose monoidal…
We prove that the classification diagram functor from the category of marked simplicial sets to the category of bisimplicial sets carries cartesian equivalences to Rezk equivalences. As a corollary, we obtain Mazel-Gee's theorem on…
In this paper we introduce the theory of ends and coends in the context of enriched bicategories. This will be an enriched version of the theory introduced in [Cor16], and a bicategorical version of the classical theory of enriched…
We develop the theory of exact completions of regular $\infty$-categories, and show that the $\infty$-categorical exact completion (resp. hypercompletion) of an abelian category recovers the connective half of its bounded (resp. unbounded)…
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…
Adhesive and quasiadhesive categories provide a general framework for the study of algebraic graph rewriting systems. In a quasiadhesive category any two regular subobjects have a join which is again a regular subobject. Vice versa, if…
In the semisimple case, we derive (asymptotic) formulas for the growth rate of the number of summands in tensor powers of the generating object in diagram/interpolation categories.
Starting with an algorithm to turn lists into full trees which uses non-obvious invariants and partial functions, we progressively encode the invariants in the types of the data, removing most of the burden of a correctness proof. The…