activity
20242026
collaborators

6 papers

math.CT2026

A Parameterized Algorithm for Testing whether the Limit of a Diagram is Empty

Ernst Althaus, Benjamin Merlin Bumpus, James Fairbanks +2

A limit of a (small) diagram in a complete category can be thought of as specifying a set of equations involving the objects of . To motivate this intuitively,…

math.AT2026

Thomason-Type Model Structures on Simplicial Complexes and Graphs

Emilio Minichiello

In this paper we show that the Matsushita model structure on loop graphs, which is right-transferred from the Kan-Quillen model structure on simplicial sets, factors through two ot…

math.CT2026

Hypercovers in Differential Geometry

Cheyne Glass, Emilio Minichiello

In this paper we provide a simple proof that for several sites of interest in differential geometry, the local projective model structure and the Čech projective model structure a…

math.CT2025

Coverages and Grothendieck Toposes

Emilio Minichiello

These notes detail the basics of the theory of Grothendieck toposes from the viewpoint of coverages. Typically one defines a site as a (small) category equipped with a Grothendieck…

math.CT2025

Presenting Profunctors

Gabriel Goren-Roig, Joshua Meyers, Emilio Minichiello

Motivated by problems in categorical database theory, we introduce and compare two notions of presentation for profunctors, uncurried and curried, which arise intuitively from thin…

math.CT2024

A Mathematical Model of Package Management Systems

Gershom Bazerman, Emilio Minichiello, Raymond Puzio

This paper brings mathematical tools to bear on the study of package dependencies in software systems. We introduce structures known as Dependency Structures with Choice (DSC) that…