flâneur — a map of the web's best reading

Understanding sheaves §1 – Merlin's Notebook

bmbumpus.com · 73 words · saved by 1 readers

Sheaves came up in my last post, so , since I’m quite new to sheaves, I figured it would be a good idea to learn some more about them. Naturally, I decided to share my notes with you. The boo…

[…] Tree-shaped structured decompositions are among the simplest to compute upon. The tree-shape clearly displays the recursive structure of any graph that is obtained as a colimit of such a decomposition and this structure can be exploited algorithmically. Let’s see how to compute sheaves on such decompositions. (By the way, if you’re new to sheaves, I’ve collected some notes on sheaves in a previous post; you can find it here.) […] Loading… Reply

Explore this link on the map →

related reading