For tame and free hyperplane arrangements, the zero loci of Bernstein-Sato ideals and the roots in [-1,0) of Bernstein-Sato polynomials are determined by the intersection lattice, with explicit combinatorial formulas.
Computing Milnor fiber monodromy for some projective hypersurfaces
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
We describe an algorithm computing the monodromy and the pole order filtration on the top Milnor fiber cohomology of hypersurfaces in $\mathbb{P}^n$ whose pole order spectral sequence degenerates at the second page. In the case of hyperplane arrangements and free, locally quasi-homogeneous hypersurfaces, and assuming a key conjecture, this algorithm is much faster than for a hypersurface as above. Our conjecture is supported by the results due to L. Narv\' ez Macarro and M. Saito on the roots of Bernstein-Sato polynomials of such hypersurfaces, by all the examples computed so far, and by one partial result. For hyperplane arrangements coming from reflection groups, a surprising symmetry of their pole order spectra on top cohomology is displayed in our examples. We also improve our previous results in the case of plane curves.
citation-role summary
citation-polarity summary
fields
math.AG 1years
2019 1verdicts
ACCEPT 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Combinatorially Determined Zeroes of Bernstein--Sato Ideals for Tame and Free Arrangements
For tame and free hyperplane arrangements, the zero loci of Bernstein-Sato ideals and the roots in [-1,0) of Bernstein-Sato polynomials are determined by the intersection lattice, with explicit combinatorial formulas.