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

被引：4

作者：

Dimca, Alexandru ^{[1
]}

Sticlaru, Gabriel ^{[2
]}

机构：

[1] Univ Cote Azur, CNRS, LJAD, Nice, France

[2] Ovidius Univ, Fac Math & Informat, Bd Mamaia 124, Constanta 900527, Romania

来源：

JOURNAL OF SYMBOLIC COMPUTATION | 2019年 / 91卷

关键词：

Plane curve; Milnor fiber; Monodromy; Pole order filtration; b-Function; B-FUNCTION; POLYNOMIALS; FIBRATIONS; SPECTRUM; IDEALS;

D O I：

10.1016/j.jsc.2018.06.015

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

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. (C) 2018 Elsevier Ltd. All rights reserved.

引用

页码：98 / 115

页数：18