Pattern avoidance and the Bruhat order.

DOI10.1016/j.jcta.2006.10.003zbMath1146.05054arXivmath/0604322OpenAlexW2151245892MaRDI QIDQ2371297

Bridget Eileen Tenner

Publication date: 4 July 2007

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0604322

zbMATH Keywords

intervalCoxeter groupBruhat orderpatternorder idealreduced decompositionBoolean poset

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Reflection and Coxeter groups (group-theoretic aspects) (20F55)

Related Items (31)

1324- and 2143-avoiding Kazhdan–Lusztig immanants and k-positivity ⋮ Spherical Schubert varieties and pattern avoidance ⋮ Homotopy type of the Boolean complex of a Coxeter system. ⋮ Labelled well-quasi-order for permutation classes ⋮ Intersecting principal Bruhat ideals and grades of simple modules ⋮ Depth in classical Coxeter groups ⋮ Cellular resolutions of ideals defined by nondegenerate simplicial homomorphisms ⋮ Tiling-based models of perimeter and area ⋮ Boolean intersection ideals of permutations in the Bruhat order ⋮ RSK tableaux and the weak order on fully commutative permutations ⋮ Classifying Levi-spherical Schubert varieties ⋮ Classification of Levi-spherical Schubert varieties ⋮ 123, 2143-avoiding Kazhdan-Lusztig immanants and \(k\)-positive matrices ⋮ Repetition in reduced decompositions ⋮ Boolean complexes of involutions ⋮ Enumerating in Coxeter Groups (Survey) ⋮ Reduced decompositions with one repetition and permutation pattern avoidance ⋮ On the cyclically fully commutative elements of Coxeter groups. ⋮ Homology of the Boolean complex ⋮ Self-dual intervals in the Bruhat order ⋮ The range of repetition in reduced decompositions ⋮ Toric Bruhat interval polytopes ⋮ Fibonacci numbers, reduced decompositions, and 321/3412 pattern classes ⋮ The enumeration of maximally clustered permutations ⋮ Coxeter combinatorics and spherical Schubert geometry ⋮ Reduced word manipulation: patterns and enumeration ⋮ Star factorizations and noncrossing partitions ⋮ Characterization of cyclically fully commutative elements in finite and affine Coxeter groups ⋮ Pattern avoidance and Boolean elements in the Bruhat order on involutions ⋮ Patterns in Inversion Sequences II: Inversion Sequences Avoiding Triples of Relations ⋮ On Schubert varieties of complexity one

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Criterion for smoothness of Schubert varieties in Sl(n)/B
• f-vectors and h-vectors of simplicial posets
• Bruhat order of Coxeter groups and shellability
• A combinatorial formula for Kazhdan-Lusztig polynomials
• Rhombic tilings of polygons and classes of reduced words in Coxeter groups
• Schubert varieties and short braidedness
• Bruhat intervals of length 4 in Weyl groups.
• Generating trees and forbidden subsequences
• Bruhat intervals as rooks on skew Ferrers boards
• Reduced decompositions and permutation patterns
• Combinatorics of Coxeter Groups
• Möbius inversion for the Bruhat ordering on a Weyl group
• Restricted permutations

This page was built for publication: Pattern avoidance and the Bruhat order.