2000 character limit reached
Lexicographic shellability of sects (2312.15093v2)
Published 22 Dec 2023 in math.CO
Abstract: In this paper, we show that the Bruhat order on any sect of a symmetric variety of type $AIII$ is lexicographically shellable. Our proof proceeds from a description of these posets as rook placements in a partition shape which fits in a $p \times q$ rectangle. This allows us to extend an EL-labeling of the rook monoid given by Can to an arbitrary sect. As a special case, our result implies that the Bruhat order on matrix Schubert varieties is lexicographically shellable.
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.