2 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.AC2025
Algorithmic and Extremal Obstructions Through the Language of Cohomology
Anny Beatriz Azevedo, Benjamin Merlin Bumpus, Matteo Capucci +2
We model problems as presheaves that assign sets of certificates to input instances, and we show how to use presheaf Äech cohomology to capture the precise ways in which local sol…