The weak order on pattern-avoiding permutations (Q405300): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A distributive lattice structure connecting Dyck paths, noncrossing partitions and 312-avoiding permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5789040 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorics of Coxeter Groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(q\)-Narayana numbers and the flag \(h\)-vector of \(J(\text \textbf{2}\times {\mathbf n})\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Duality of graded graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4303668 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cambrian lattices. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restricted permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4236280 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finitely labeled generating trees and restricted permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial orderings of permutations and monotonicity of a rank correlation statistic / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 23:50, 8 July 2024

scientific article
Language Label Description Also known as
English
The weak order on pattern-avoiding permutations
scientific article

    Statements

    The weak order on pattern-avoiding permutations (English)
    0 references
    0 references
    4 September 2014
    0 references
    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.
    0 references
    weak order
    0 references
    permutation pattern
    0 references
    lattice
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references