The weak order on pattern-avoiding permutations
From MaRDI portal
Publication:405300
zbMATH Open1300.05005MaRDI QIDQ405300FDOQ405300
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
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
Permutations, words, matrices (05A05) Symmetric groups (20B30) Semilattices (06A12) Lattices (06B99)
Cites Work
- Title not available (Why is that?)
- Combinatorics of Coxeter Groups
- Restricted permutations
- Cambrian lattices.
- Title not available (Why is that?)
- Finitely labeled generating trees and restricted permutations
- Duality of graded graphs
- A distributive lattice structure connecting Dyck paths, noncrossing partitions and 312-avoiding permutations
- Partial orderings of permutations and monotonicity of a rank correlation statistic
- Title not available (Why is that?)
- \(q\)-Narayana numbers and the flag \(h\)-vector of \(J(\text \textbf{2}\times {\mathbf n})\)
Cited In (10)
- A refinement of weak order intervals into distributive lattices
- The weak Bruhat order on the symmetric group is Sperner
- Pattern avoidance and the Bruhat order.
- Restricted permutations
- Pattern avoidance and Boolean elements in the Bruhat order on involutions
- 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
- Pattern avoidance in task-precedence posets
- The Sperner property for 132-avoiding intervals in the weak order
- NBB bases of some lattices of pattern avoiding permutations.
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)
