Computing the monodromy and pole order filtration on Milnor fiber cohomology of plane curves
Alexandru Dimca, Gabriel Sticlaru

TL;DR
This paper presents an algorithm to compute the monodromy and pole order filtration on the Milnor fiber cohomology of plane curves, linking it to Bernstein-Sato polynomials, with results supported by computational examples.
Contribution
It introduces a novel algorithm for calculating monodromy and pole order filtration on Milnor fiber cohomology of plane curves, including cases with non weighted homogeneous singularities.
Findings
Algorithm successfully computes filtrations for various plane curves.
Results support the conjecture in all computed examples.
Links between Milnor fiber cohomology and Bernstein-Sato polynomial are established.
Abstract
We describe an algorithm computing the monodromy and the pole order filtration on the Milnor fiber cohomology of any reduced projective plane curve . The relation to the zero set of Bernstein-Sato polynomial of the defining homogeneous polynomial for is also discussed. When 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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
