Deletion theorem and combinatorics of hyperplane arrangements

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

We show that the deletion theorem of a free arrangement is combinatorial, i.e., whether we can delete a hyperplane from a free arrangement keeping freeness depends only on the intersection lattice. In fact, we give a sufficient and necessary condition for the deletion theorem in terms of characteristic polynomials. As a corollary, we prove that whether a free arrangement has a free filtration is also combinatorial. The proof is based on the result about a minimal set of generators of a logarithmic derivation module of a multiarrangement which satisfies the b 2 -equality.

Original languageEnglish
Pages (from-to)581-595
Number of pages15
JournalMathematische Annalen
Volume373
Issue number1-2
DOIs
Publication statusPublished - Feb 8 2019

All Science Journal Classification (ASJC) codes

  • Mathematics(all)

Fingerprint Dive into the research topics of 'Deletion theorem and combinatorics of hyperplane arrangements'. Together they form a unique fingerprint.

  • Cite this