A pattern avoidance criterion for free inversion arrangements

From MaRDI portal
Publication:737979

DOI10.1007/S10801-015-0663-5zbMATH Open1348.14129arXiv1409.7299OpenAlexW1584184930MaRDI QIDQ737979FDOQ737979


Authors: William Slofstra Edit this on Wikidata


Publication date: 12 August 2016

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1409.7299




Recommendations




Cites Work


Cited In (2)





This page was built for publication: A pattern avoidance criterion for free inversion arrangements

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q737979)