The weak order on pattern-avoiding permutations

zbMath1300.05005MaRDI QIDQ405300

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

zbMATH Keywords

latticepermutation patternweak order

Mathematics Subject Classification ID

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

Related Items (1)

A distributive lattice structure connecting Dyck paths, noncrossing partitions and 312-avoiding permutations

Cites Work

• Duality of graded graphs
• \(q\)-Narayana numbers and the flag \(h\)-vector of \(J(\text \textbf{2}\times {\mathbf n})\)
• Finitely labeled generating trees and restricted permutations
• A distributive lattice structure connecting Dyck paths, noncrossing partitions and 312-avoiding permutations
• Cambrian lattices.
• Partial orderings of permutations and monotonicity of a rank correlation statistic
• Combinatorics of Coxeter Groups
• Restricted permutations
• Unnamed Item
• Unnamed Item
• Unnamed Item

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