The weak order on pattern-avoiding permutations
From MaRDI portal
Recommendations
Cites work
- 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?)
- 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
- Partial orderings of permutations and monotonicity of a rank correlation statistic
- Restricted permutations
- \(q\)-Narayana numbers and the flag \(h\)-vector of \(J(\text \textbf{2}\times {\mathbf n})\)
Cited in
(11)- A refinement of weak order intervals into distributive lattices
- Restricted permutations
- The weak order on integer posets
- Pattern avoidance and Boolean elements in the Bruhat order on involutions
- Pattern avoidance and the Bruhat order.
- The Sperner property for 132-avoiding intervals in the weak order
- A distributive lattice structure connecting Dyck paths, noncrossing partitions and 312-avoiding permutations
- The equational theory of the weak Bruhat order on finite symmetric groups
- NBB bases of some lattices of pattern avoiding permutations.
- The weak Bruhat order on the symmetric group is Sperner
- Pattern avoidance in task-precedence posets
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)