English

Arrangements of ideal type are inductively free

Combinatorics 2019-02-01 v2 Group Theory

Abstract

Extending earlier work by Sommers and Tymoczko, in 2016 Abe, Barakat, Cuntz, Hoge, and Terao established that each arrangement of ideal type AI\mathcal{A}_\mathcal{I} stemming from an ideal I\mathcal{I} in the set of positive roots of a reduced root system is free. Recently, R\"ohrle showed that a large class of the AI\mathcal{A}_\mathcal{I} satisfy the stronger property of inductive freeness and conjectured that this property holds for all AI\mathcal{A}_\mathcal{I}. In this article, we confirm this conjecture.

Keywords

Cite

@article{arxiv.1711.09760,
  title  = {Arrangements of ideal type are inductively free},
  author = {Michael Cuntz and Gerhard Roehrle and Anne Schauenburg},
  journal= {arXiv preprint arXiv:1711.09760},
  year   = {2019}
}

Comments

10 pages. arXiv admin note: text overlap with arXiv:1606.00617