Supersolvability and the Koszul property of root ideal arrangements
Abstract
A root ideal arrangement AI is the set of reflecting hyperplanes corresponding to the roots in an order ideal I of the root poset on the positive roots of a finite crystallographic root system. A characterisation of supersolvable root ideal arrangements is obtained. Namely, AI is supersolvable if and only if I is chain peelable, meaning that it is possible to reach the empty poset from I by in each step removing a maximal chain which is also an order filter. In particular, supersolvability is preserved under taking subideals. We identify the minimal ideals that correspond to non-supersolvable arrangements. There are essentially two such ideals, one in type D4 and one in type F4. By showing that AI is not line-closed if I contains one of these, we deduce that the Orlik-Solomon algebra OS(AI) has the Koszul property if and only if AI is supersolvable.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.