2000 character limit reached
Perverse sheaves and graphs on surfaces
Published 8 Jan 2016 in math.AT | (1601.01789v1)
Abstract: We give an explicit combinatorial description of the category Perv(S,N) of perverse sheaves on an oriented surface S (with boundary) with singularities at a given finite set N. The description is given in terms of any spanning graph K in S with the set of vertices N, so the category is defined entirely in terms of a ribbon graph. This description can be seen as an application, in the theory of perverse sheaves, of the idea of localization on a Lagrangian skeleton.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.