The weak order on pattern-avoiding permutations
The electronic journal of combinatorics, Tome 21 (2014) no. 3
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.
DOI :
10.37236/4000
Classification :
05A05, 06A12, 06B99, 20B30
Mots-clés : weak order, permutation pattern, lattice
Mots-clés : weak order, permutation pattern, lattice
Affiliations des auteurs :
Brian Drake  1
@article{10_37236_4000,
author = {Brian Drake},
title = {The weak order on pattern-avoiding permutations},
journal = {The electronic journal of combinatorics},
year = {2014},
volume = {21},
number = {3},
doi = {10.37236/4000},
zbl = {1300.05005},
url = {http://geodesic.mathdoc.fr/articles/10.37236/4000/}
}
Brian Drake. The weak order on pattern-avoiding permutations. The electronic journal of combinatorics, Tome 21 (2014) no. 3. doi: 10.37236/4000
Cité par Sources :