Papers
Topics
Authors
Recent
2000 character limit reached

Bernstein--Sato polynomials of locally quasi-homogeneous divisors in $\mathbb{C}^{3}$

Published 13 Feb 2024 in math.AG, math.AC, math.CO, and math.CV | (2402.08342v2)

Abstract: We consider the Bernstein--Sato polynomial of a locally quasi-homogeneous polynomial $f \in R = \mathbb{C}[x_{1}, x_{2}, x_{3}]$. We construct, in the analytic category, a complex of $\mathscr{D}{X}[s]$-modules that can be used to compute the $\mathscr{D}{X}[s]$-dual of $\mathscr{D}{X}[s] f{s-1}$ as the middle term of a short exact sequence where the outer terms are well understood. This extends a result by Narv\'{a}ez Macarro where a freeness assumption was required. We derive many results about the zeroes of the Bernstein--Sato polynomial. First, we prove each nonvanishing degree of the zeroeth local cohomology of the Milnor algebra $H{\mathfrak{m}}{0} (R / (\partial f))$ contributes a root to the Bernstein--Sato polynomial, generalizing a result of M. Saito's (where the argument cannot weaken homogeneity to quasi-homogeneity). Second, we prove the zeroes of the Bernstein--Sato polynomial admit a partial symmetry about $-1$, extending a result of Narv\'{a}ez Macarro that again required freeness. We give applications to very small roots, the twisted Logarithmic Comparison Theorem, and more precise statements when $f$ is additionally assumed to be homogeneous. Finally, when $f$ defines a hyperplane arrangement in $\mathbb{C}{3}$ we give a complete formula for the zeroes of the Bernstein--Sato polynomial of $f$. We show all zeroes except the candidate root $-2 + (2 / \text{deg}(f))$ are (easily) combinatorially given; we give many equivalent characterizations of when the only non-combinatorial candidate root $-2 + (2/ \text{deg}(f))$ is in fact a zero of the Bernstein--Sato polynomial. One equivalent condition is the nonvanishing of $H_{\mathfrak{m}}{0}( R / (\partial f))_{\text{deg}(f) - 1}$.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.