The weak order on pattern-avoiding permutations (Q405300)

From MaRDI portal
Revision as of 00:10, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
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