Pattern avoidance and the Bruhat order.

DOI10.1016/J.JCTA.2006.10.003zbMATH Open1146.05054arXivmath/0604322OpenAlexW2151245892MaRDI QIDQ2371297FDOQ2371297

Authors: Bridget Eileen Tenner 

Publication date: 4 July 2007

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

Abstract: The structure of order ideals in the Bruhat order for the symmetric group is elucidated via permutation patterns. A method for determining non-isomorphic principal order ideals is described and applied for small lengths. The permutations with boolean principal order ideals are characterized. These form an order ideal which is a simplicial poset, and its rank generating function is computed. Moreover, the permutations whose principal order ideals have a form related to boolean posets are also completely described. It is determined when the set of permutations avoiding a particular set of patterns is an order ideal, and the rank generating functions of these ideals are computed. Finally, the Bruhat order in types B and D is studied, and the elements with boolean principal order ideals are characterized and enumerated by length.

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

Recommendations

• Pattern avoidance and Boolean elements in the Bruhat order on involutions
• Boolean elements in the Bruhat order on twisted involutions
• The weak order on pattern-avoiding permutations
• Intervals and factors in the Bruhat order
• The sorting index and inversion number on order ideals of permutation groups

zbMATH Keywords

intervalCoxeter grouppatternBruhat orderorder idealreduced decompositionBoolean poset

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (48)

• Limit theorems for Poincaré polynomials of the Bruhat order on \(S_n\)
• On the cyclically fully commutative elements of Coxeter groups.
• Self-dual intervals in the Bruhat order
• Spherical Schubert varieties and pattern avoidance
• The weak order on pattern-avoiding permutations
• The dominance order for permutations
• Patterns in inversion sequences. II: Inversion sequences avoiding triples of relations
• Bruhat graphs and pattern avoidance
• Two characterizations of the shape of the base poset derived from the Lehmer code of a permutation using permutation patterns.
• Pattern avoidance and Boolean elements in the Bruhat order on involutions
• Separable elements in Weyl groups
• Toric Bruhat interval polytopes
• Reduced word manipulation: patterns and enumeration
• Repetition in reduced decompositions
• Prism permutations in the Bruhat order
• The sorting index and inversion number on order ideals of permutation groups
• Characterization of cyclically fully commutative elements in finite and affine Coxeter groups
• Hultman elements for the hyperoctahedral groups
• 1324- and 2143-avoiding Kazhdan–Lusztig immanants and k-positivity
• Pattern-avoiding polytopes
• Labelled well-quasi-order for permutation classes
• Classifying Levi-spherical Schubert varieties
• Enumerating in Coxeter groups (survey)
• On extremal permutations avoiding \(\omega_N=NN-1\dots 1\)
• 123, 2143-avoiding Kazhdan-Lusztig immanants and \(k\)-positive matrices
• Boolean intersection ideals of permutations in the Bruhat order
• Star factorizations and noncrossing partitions
• Intervals and factors in the Bruhat order
• Classification of Levi-spherical Schubert varieties
• Reduced decompositions with one repetition and permutation pattern avoidance
• Depth in classical Coxeter groups
• Invariant principal order ideals under Foata's transformation
• The range of repetition in reduced decompositions
• Intersecting principal Bruhat ideals and grades of simple modules
• Homotopy type of the Boolean complex of a Coxeter system.
• Homology of the Boolean complex
• Tiling-based models of perimeter and area
• On the outcome map of MVP parking functions: permutations avoiding 321 and 3412, and Motzkin paths
• On graphs of sets of reduced words
• On Schubert varieties of complexity one
• Fibonacci numbers, reduced decompositions, and 321/3412 pattern classes
• The enumeration of maximally clustered permutations
• RSK tableaux and the weak order on fully commutative permutations
• Cellular resolutions of ideals defined by nondegenerate simplicial homomorphisms
• Coxeter combinatorics and spherical Schubert geometry
• Odd diagrams, Bruhat order, and pattern avoidance
• Monomial ideals induced by permutations avoiding patterns
• Boolean complexes of involutions

Uses Software

• OEIS

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2371297)