Cubulation of Bruhat graphs
Abstract
For an arbitrary Coxeter system and any , we investigate the condition that the Bruhat graph for the interval can be cubulated, meaning roughly that this graph can be spanned by a product of subintervals of . Results of Carrell-Peterson and Elias-Williamson imply that if can be cubulated, then the Kazhdan-Lusztig polynomial for all . We consider the converse to this result. For finite and the longest element in , so that for all , we use normal form forests to construct cubulations of in types and . However, in some exceptional types, we determine elements such that but cannot be cubulated. We then prove that if there are infinitely many such that can be cubulated, then must be of type for some . Finally, for of type , we exhibit a cubulation of for each of the infinitely many such that for all .
Cite
@article{arxiv.2504.03046,
title = {Cubulation of Bruhat graphs},
author = {Alex Bishop and Elizabeth Milićević and Anne Thomas},
journal= {arXiv preprint arXiv:2504.03046},
year = {2026}
}
Comments
35 pages; 10 figures, most in color. Version 2: new title, reorganization and shortening of some content, added discussion of equivalence between Lehmer codes and cubulations, added discussion of our computations