Papers
Topics
Authors
Recent
Search
2000 character limit reached

Hyperplane Arrangements Satisfy (un)Twisted Logarithmic Comparison Theorems, Applications to $\mathscr{D}_{X}$-modules

Published 3 Feb 2022 in math.AG, math.AC, and math.CO | (2202.01462v3)

Abstract: For a reduced hyperplane arrangement we prove the analytic Twisted Logarithmic Comparison Theorem, subject to mild combinatorial arithmetic conditions on the weights defining the twist. This gives a quasi-isomorphism between the twisted logarithmic de Rham complex and the twisted meromorphic de Rham complex. The latter computes the cohomology of the arrangement's complement with coefficients from the corresponding rank one local system. We also prove the algebraic variant (when the arrangement is central), and the analytic and algebraic (untwisted) Logarithmic Comparison Theorems. The last item positively resolves an old conjecture of Terao. We also prove that: every nontrivial rank one local system on the complement can be computed via these Twisted Logarithmic Comparison Theorems; these computations are explicit finite dimensional linear algebra. Finally, we give some $\mathscr{D}_{X}$-module applications: for example, we give a sharp restriction on the codimension one components of the multivariate Bernstein--Sato ideal attached to an arbitrary factorization of an arrangement. The bound corresponds to (and, in the univariate case, gives an independent proof of) M. Saito's result that the roots of the Bernstein--Sato polynomial of a non-smooth, central, reduced arrangement live in $(-2 + 1/d, 0).$

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

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.

Collections

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