Generalizations of two-stack-sortable permutations
Combinatorics
2007-05-23 v2
Abstract
In this thesis, we apply the stack sorting operator to -permutations and construct the functional equation for the generating function of two-stack-sortable -tuple -permutations counted by descents by using a factorization similar to Zeilberger's. We solve the functional equation and give explicit formulas for the number of two-stack-sortable -permutations.
Keywords
Cite
@article{arxiv.math/0209313,
title = {Generalizations of two-stack-sortable permutations},
author = {Dapeng Xu},
journal= {arXiv preprint arXiv:math/0209313},
year = {2007}
}
Comments
PH.D Thesis, 57 pages