Combinatorial model categories have presentations
Daniel Dugger
Abstract
We show that every combinatorial model category can be obtained, up to Quillen equivalence, by localizing a model category of diagrams of simplicial sets. This says that any combinatorial model category can be built up from a category of `generators' and a set of `relations'---that is, any combinatorial model category has a presentation.
Create a lesson
Related papers
Constructive Bounds for the Topological Expressivity of Neural Networks
Kosio Beshkov
The (right) homotopy between two A∞-morphisms
Mattia Ornaghi
Reconstruction of graphs and surfaces from derived categories
Oscar Harr
Critical Point Theory for the Distance Function on PL-Spaces
Dirk Siersma
Derived plethystic algebra
Benjamin Antieau, Edith Hübner, Dmitry Kubrak et al.
The first homology of square-section braid groups
Minh Pham, Nicholas Wawrykow, Jacob Zweiback