Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Supersolvability and the Koszul property of root ideal arrangements (1410.0195v1)

Published 1 Oct 2014 in math.CO and math.AC

Abstract: A root ideal arrangement $A_I$ 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, $A_I$ 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 $D_4$ and one in type $F_4$. By showing that $A_I$ is not line-closed if $I$ contains one of these, we deduce that the Orlik-Solomon algebra $OS(A_I)$ has the Koszul property if and only if $A_I$ is supersolvable.

Summary

We haven't generated a summary for this paper yet.