English

A pattern avoidance criterion for free inversion arrangements

Combinatorics 2014-09-26 v1

Abstract

We show that the hyperplane arrangement of a coconvex set in a finite root system is free if and only if it is free in corank 4. As a consequence, we show that the inversion arrangement of a Weyl group element w is free if and only if w avoids a finite list of root system patterns. As a key part of the proof, we use a recent theorem of Abe and Yoshinaga to show that if the root system does not contain any factors of type C or F, then Peterson translation of coconvex sets preserves freeness. This also allows us to give a Kostant-Shapiro-Steinberg rule for the coexponents of a free inversion arrangement in any type.

Keywords

Cite

@article{arxiv.1409.7299,
  title  = {A pattern avoidance criterion for free inversion arrangements},
  author = {William Slofstra},
  journal= {arXiv preprint arXiv:1409.7299},
  year   = {2014}
}

Comments

20 pages. Corrects some errors from a preliminary version that was privately circulated

R2 v1 2026-06-22T06:05:48.899Z