Computing the monodromy and pole order filtration on Milnor fiber cohomology of plane curves

Abstract

We describe an algorithm computing the monodromy and the pole order filtration on the Milnor fiber cohomology of any reduced projective plane curve C. The relation to the zero set of Bernstein-Sato polynomial of the defining homogeneous polynomial for C is also discussed. When C has some non weighted homogeneous singularities, then we have to assume that a conjecture holds in order to get some of our results. In all the examples computed so far this conjecture holds.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…