Boolean intersection ideals of permutations in the Bruhat order
From MaRDI portal
Abstract: Motivated by recent work with Mazorchuk, we characterize the conditions under which the intersection of two principal order ideals in the Bruhat order is boolean. That characterization is presented in three versions: in terms of reduced words, in terms of permutation patterns, and in terms of permutation support. The equivalence of these properties follows from an analysis of what it means to have a specific letter repeated in a permutation's reduced words; namely, that a specific 321-pattern appears.
Recommendations
Cites work
- Cells in affine Weyl groups. II
- Combinatorics of Coxeter Groups
- Homology of the Boolean complex
- Homotopy type of the Boolean complex of a Coxeter system.
- Intersecting principal Bruhat ideals and grades of simple modules
- Pattern avoidance and Boolean elements in the Bruhat order on involutions
- Pattern avoidance and the Bruhat order.
- Reduced decompositions and permutation patterns
- Reduced word manipulation: patterns and enumeration
- Repetition in reduced decompositions
- Some combinatorial properties of Schubert polynomials
- The range of repetition in reduced decompositions
Cited in
(4)
This page was built for publication: Boolean intersection ideals of permutations in the Bruhat order
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6098021)