Pattern avoidance and the Bruhat order.

DOI10.1016/j.jcta.2006.10.003zbMath1146.05054arXivmath/0604322MaRDI 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

interval; Coxeter group; Bruhat order; pattern; order ideal; reduced decomposition; Boolean poset

Mathematics Subject Classification ID

06A07: Combinatorics of partially ordered sets

20F55: Reflection and Coxeter groups (group-theoretic aspects)

Related Items

Cellular resolutions of ideals defined by nondegenerate simplicial homomorphisms, Repetition in reduced decompositions, On the cyclically fully commutative elements of Coxeter groups., Homology of the Boolean complex, Fibonacci numbers, reduced decompositions, and 321/3412 pattern classes, The enumeration of maximally clustered permutations, Pattern avoidance and Boolean elements in the Bruhat order on involutions, Homotopy type of the Boolean complex of a Coxeter system., Reduced decompositions with one repetition and permutation pattern avoidance

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