Exploring Decision Problems on Graphs with Sheaves: Insights from Emilio Minichiello’s Talk

An in-person talk given on November 13, 2024

Abstract: This semester I don’t feel like talking about my research. Instead I’ll talk about what I’ve learned from reading the paper Compositional Algorithms on Compositional Data: Deciding Sheaves on Presheaves by Althaus, Bumpus, Fairbanks and Rosiak. This paper is about how we can use sheaf theory to break apart a computational problem, solve it on small pieces, and then glue the solutions together to get a global solution to the computational problem. I’ll go through the main ideas of this paper, using the category of simple graphs with monomorphisms as a main example to showcase their results.