Back to Search
Start Over
The freeness of ideal subarrangements of Weyl arrangements
- Source :
- Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AT,..., Iss Proceedings (2014)
- Publication Year :
- 2014
- Publisher :
- Discrete Mathematics & Theoretical Computer Science, 2014.
-
Abstract
- A Weyl arrangement is the arrangement defined by the root system of a finite Weyl group. When a set of positive roots is an ideal in the root poset, we call the corresponding arrangement an ideal subarrangement. Our main theorem asserts that any ideal subarrangement is a free arrangement and that its exponents are given by the dual partition of the height distribution, which was conjectured by Sommers-Tymoczko. In particular, when an ideal subarrangement is equal to the entire Weyl arrangement, our main theorem yields the celebrated formula by Shapiro, Steinberg, Kostant, and Macdonald. The proof of the main theorem is classification-free. It heavily depends on the theory of free arrangements and thus greatly differs from the earlier proofs of the formula.
Details
- Language :
- English
- ISSN :
- 13658050
- Volume :
- DMTCS Proceedings vol. AT,...
- Issue :
- Proceedings
- Database :
- Directory of Open Access Journals
- Journal :
- Discrete Mathematics & Theoretical Computer Science
- Publication Type :
- Academic Journal
- Accession number :
- edsdoj.f0277c8030d84dfeb8609c049b18d8ee
- Document Type :
- article
- Full Text :
- https://doi.org/10.46298/dmtcs.2418