Abstract

Hultman, Linusson, Shareshian, and Sjöstrand gave a pattern avoidance characterization of the permutations for which the number of chambers of its associated inversion arrangement is the same as the size of its lower interval in Bruhat order. Hultman later gave a characterization, valid for an arbitrary finite reflection group, in terms of distances in the Bruhat graph. On the other hand, the pattern avoidance criterion for permutations had earlier appeared in independent work of Sjöstrand and of Gasharov and Reiner. We give characterizations of the elements of the hyperoctahedral groups satisfying Hultman's criterion that is in the spirit of those of Sjöstrand and of Gasharov and Reiner. We also give a pattern avoidance criterion using the notion of pattern avoidance defined by Billey and Postnikov.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call