The weak order on pattern-avoiding permutations (Q405300): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 03:34, 30 January 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
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
