Computing the monodromy and pole order filtration on Milnor fiber cohomology of plane curves - Archive ouverte HAL
Journal Articles Journal of Symbolic Computation Year : 2019

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.
Fichier principal
Vignette du fichier
comMFgenFINAL.pdf (351.75 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-01518716 , version 1 (04-07-2018)

Identifiers

Cite

Alexandru Dimca, Gabriel Sticlaru. Computing the monodromy and pole order filtration on Milnor fiber cohomology of plane curves. Journal of Symbolic Computation, 2019, 91, pp.98-115. ⟨10.1016/j.jsc.2018.06.015⟩. ⟨hal-01518716⟩
303 View
211 Download

Altmetric

Share

More