Sorting classes
The electronic journal of combinatorics, Tome 12 (2005)
Weak and strong sorting classes are pattern-closed classes that are also closed downwards under the weak and strong orders on permutations. They are studied using partial orders that capture both the subpermutation order and the weak or strong order. In both cases they can be characterised by forbidden permutations in the appropriate order. The connection with the corresponding forbidden permutations in pattern-closed classes is explored. Enumerative results are found in both cases.
DOI :
10.37236/1928
Classification :
05A15, 05A16
Mots-clés : pattern-closed classes, forbidden permutations
Mots-clés : pattern-closed classes, forbidden permutations
@article{10_37236_1928,
author = {M. H. Albert and R. E. L. Aldred and M. D. Atkinson and C. C. Handley and D. A. Holton and D. J. McCaughan},
title = {Sorting classes},
journal = {The electronic journal of combinatorics},
year = {2005},
volume = {12},
doi = {10.37236/1928},
zbl = {1074.05005},
url = {http://geodesic.mathdoc.fr/articles/10.37236/1928/}
}
TY - JOUR AU - M. H. Albert AU - R. E. L. Aldred AU - M. D. Atkinson AU - C. C. Handley AU - D. A. Holton AU - D. J. McCaughan TI - Sorting classes JO - The electronic journal of combinatorics PY - 2005 VL - 12 UR - http://geodesic.mathdoc.fr/articles/10.37236/1928/ DO - 10.37236/1928 ID - 10_37236_1928 ER -
M. H. Albert; R. E. L. Aldred; M. D. Atkinson; C. C. Handley; D. A. Holton; D. J. McCaughan. Sorting classes. The electronic journal of combinatorics, Tome 12 (2005). doi: 10.37236/1928
Cité par Sources :