Longest alternating subsequences in pattern-restricted permutations
The electronic journal of combinatorics, Tome 14 (2007)
Inspired by the results of Stanley and Widom concerning the limiting distribution of the lengths of longest alternating subsequences in random permutations, and results of Deutsch, Hildebrand and Wilf on the limiting distribution of the longest increasing subsequence for pattern-restricted permutations, we find the limiting distribution of the longest alternating subsequence for pattern-restricted permutations in which the pattern is any one of the six patterns of length three. Our methodology uses recurrences, generating functions, and complex analysis, and also yields more detailed information. Several ideas for future research are listed.
@article{10_37236_952,
author = {Ghassan Firro and Toufik Mansour and Mark C. Wilson},
title = {Longest alternating subsequences in pattern-restricted permutations},
journal = {The electronic journal of combinatorics},
year = {2007},
volume = {14},
doi = {10.37236/952},
zbl = {1120.05004},
url = {http://geodesic.mathdoc.fr/articles/10.37236/952/}
}
TY - JOUR AU - Ghassan Firro AU - Toufik Mansour AU - Mark C. Wilson TI - Longest alternating subsequences in pattern-restricted permutations JO - The electronic journal of combinatorics PY - 2007 VL - 14 UR - http://geodesic.mathdoc.fr/articles/10.37236/952/ DO - 10.37236/952 ID - 10_37236_952 ER -
Ghassan Firro; Toufik Mansour; Mark C. Wilson. Longest alternating subsequences in pattern-restricted permutations. The electronic journal of combinatorics, Tome 14 (2007). doi: 10.37236/952
Cité par Sources :