Combinatorially Determined Zeroes of Bernstein--Sato Ideals for Tame and Free Arrangements
arXiv:1909.00547
Abstract
For a central, not necessarily reduced, hyperplane arrangement equipped with any factorization and for dividing , we consider a more general type of Bernstein--Sato ideal consisting of the polynomials satisfying the functional equation Generalizing techniques due to Maisonobe, we compute the zero locus of the standard Bernstein--Sato ideal in the sense of Budur (i.e. for any factorization of a free and reduced and for certain factorizations of a non-reduced . We also compute the roots of the Bernstein--Sato polynomial for any power of a free and reduced arrangement. If is tame, we give a combinatorial formula for the roots lying in For and any factorization of a line arrangement, we compute the zero locus of this ideal. For free and reduced arrangements of larger rank, we compute the zero locus provided and give good estimates otherwise. Along the way we generalize a duality formula for that was first proved by Narváez-Macarro for reduced, , and As an application, we investigate the minimum number of hyperplanes one must add to a tame so that the resulting arrangement is free. This notion of freeing a divisor has been explicitly studied by Mond and Schulze, albeit not for hyperplane arrangements. We show that small roots of the Bernstein--Sato polynomial of can force lower bounds for this number.
arXiv commentRevised for clarity throughout; in particular the abstract and introduction are largely rewritten and some proofs expanded. Note that the last few propositions of Section 2 were removed. (These are true but have more involved proofs than originally presented.) Proposition 2.26 suffices for our purposes. No major results or arguments changed. Final version to appear in Journal of Singularities