2000 character limit reached
Bruhat intervals, subword complexes and brick polyhedra for finite Coxeter groups
Published 5 Mar 2021 in math.CO | (2103.03715v1)
Abstract: We study the interplay between the discrete geometry of Bruhat poset intervals and subword complexes of finite Coxeter systems. We establish connections between the cones generated by cover labels for Bruhat intervals and of root configurations for subword complexes, culminating in the notion of brick polyhedra for general subword complexes.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.