From Bruhat intervals to intersection lattices and a conjecture of Postnikov

From MaRDI portal
Publication:1024360

DOI10.1016/J.JCTA.2008.09.001zbMATH Open1207.05006arXiv0710.1220OpenAlexW2102216927WikidataQ122945768 ScholiaQ122945768MaRDI QIDQ1024360FDOQ1024360

John Shareshian, Svante Linusson, Jonas Sjöstrand, Axel Hultman

Publication date: 17 June 2009

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Abstract: We prove the conjecture of A. Postnikov that (A) the number of regions in the inversion hyperplane arrangement associated with a permutation winSn is at most the number of elements below w in the Bruhat order, and (B) that equality holds if and only if w avoids the patterns 4231, 35142, 42513 and 351624. Furthermore, assertion (A) is extended to all finite reflection groups. A byproduct of this result and its proof is a set of inequalities relating Betti numbers of complexified inversion arrangements to Betti numbers of closed Schubert cells. Another consequence is a simple combinatorial interpretation of the chromatic polynomial of the inversion graph of a permutation which avoids the above patterns.


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





Cites Work


Cited In (13)






This page was built for publication: From Bruhat intervals to intersection lattices and a conjecture of Postnikov

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