Hostname: page-component-77f85d65b8-5ngxj Total loading time: 0 Render date: 2026-04-23T02:18:51.974Z Has data issue: false hasContentIssue false

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

Published online by Cambridge University Press:  06 November 2024

Daniel Bath*
Affiliation:
Departement Wiskunde, KU Leuven, Celestijnenlaan 200B, 3001 Leuven, Belgium

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).$

Information

Type
Algebraic and Complex Geometry
Creative Commons
Creative Common License - CCCreative Common License - BY
This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (https://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution, and reproduction in any medium, provided the original work is properly cited.
Copyright
© The Author(s), 2024. Published by Cambridge University Press