The weak order on pattern-avoiding permutations (Q405300)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The weak order on pattern-avoiding permutations |
scientific article; zbMATH DE number 6340239
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The weak order on pattern-avoiding permutations |
scientific article; zbMATH DE number 6340239 |
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
0 references
0 references
0.8015154600143433
0 references
0.7984467148780823
0 references
0.7976759672164917
0 references
0.7750946879386902
0 references
0.773978054523468
0 references
