Addition–Deletion Theorems for factorizations of Orlik–Solomon algebras and nice arrangements

We study the notion of a nice partition or factorization of a hyperplane arrangement due to Terao from the early 1990s. The principal aim of this note is an analogue of Terao’s celebrated addition–deletion theorem for free arrangements for the class of nice arrangements. This is a natural setting for the stronger property of an inductive factorization of a hyperplane arrangement by Jambu and Paris.In addition, we show that supersolvable arrangements are inductively factored and that inductively factored arrangements are inductively free. Combined with our addition–deletion theorem this leads to the concept of an induction table for inductive factorizations.Finally, we prove that the notions of factored and inductively factored arrangements are compatible with the product construction for arrangements.