Generalizations of two-stack-sortable permutations
| dc.creator | Xu, Dapeng | |
| dc.date | 2002-09-23 | |
| dc.date | 2002-09-25 | |
| dc.date.accessioned | 2026-07-07T04:51:10Z | |
| dc.date.available | 2026-07-07T04:51:10Z | |
| dc.description | In this thesis, we apply the stack sorting operator to $r$-permutations and construct the functional equation for the generating function of two-stack-sortable $k$-tuple $r$-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 $r$-permutations. | |
| dc.description | PH.D Thesis, 57 pages | |
| dc.identifier | https://arxiv.org/abs/math/0209313 | |
| dc.identifier | http://arxiv.org/abs/math/0209313 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/65052 | |
| dc.subject | Combinatorics | |
| dc.title | Generalizations of two-stack-sortable permutations | |
| dc.type | text |