The weak order on pattern-avoiding permutations

zbMATH Open1300.05005MaRDI QIDQ405300FDOQ405300

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.)

zbMATH Keywords

latticeweak orderpermutation pattern

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Combinatorics of Coxeter Groups
• Restricted permutations
• Cambrian lattices.
• 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
• \(q\)-Narayana numbers and the flag \(h\)-vector of \(J(\text \textbf{2}\times {\mathbf n})\)

Cited In (2)

• Restricted permutations
• A distributive lattice structure connecting Dyck paths, noncrossing partitions and 312-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)