The weak order on pattern-avoiding permutations

MaRDI QIDQ405300zbMATH OpenFDO

Authors Brian Drake

Publication date 4 September 2014

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL http://www.combinatorics.org/ojs/index.php/eljc/article/view/v21i3p15

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

latticepermutation patternweak order

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Semilattices (06A12) Lattices (06B99) Symmetric groups (20B30)

Review text

Summary: The weak order on the symmetric group is a well-known partial order which is also a lattice. We consider subposets of the weak order consisting of permutations avoiding a single pattern, characterizing the patterns for which the subposet is a lattice. These patterns have only a single small ascent or descent. We prove that all patterns for which the subposet is a sublattice have length at most three.

Recommendations

• Pattern avoidance in poset permutations
• Pattern avoidance and the Bruhat order.
• Restricted permutations
• A refinement of weak order intervals into distributive lattices
• The equational theory of the weak Bruhat order on finite symmetric groups

Cites work

• \(q\)-Narayana numbers and the flag \(h\)-vector of \(J(\text \textbf{2}\times {\mathbf n})\)
• A distributive lattice structure connecting Dyck paths, noncrossing partitions and 312-avoiding permutations
• Cambrian lattices.
• Combinatorics of Coxeter Groups
• Duality of graded graphs
• Finitely labeled generating trees and restricted permutations
• scientific article; zbMATH DE number 1268810 (Why is no real title available?)
• scientific article; zbMATH DE number 626018 (Why is no real title available?)
• scientific article; zbMATH DE number 3050845 (Why is no real title available?)
• Partial orderings of permutations and monotonicity of a rank correlation statistic
• Restricted permutations

Cited in

(12)

• The equational theory of the weak Bruhat order on finite symmetric groups
• The weak order on integer posets
• The weak Bruhat order on the symmetric group is Sperner
• Pattern avoidance and the Bruhat order.
• A refinement of weak order intervals into distributive lattices
• A distributive lattice structure connecting Dyck paths, noncrossing partitions and 312-avoiding permutations
• Pattern avoidance in task-precedence posets
• NBB bases of some lattices of pattern avoiding permutations.
• The Sperner property for 132-avoiding intervals in the weak order
• Restricted permutations
• K-orbit closures and Hessenberg varieties
• Pattern avoidance and Boolean elements in the Bruhat order on involutions

This page was built for publication: The weak order on pattern-avoiding permutations

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