论文信息 - Generalized Stack Permutations

Generalized Stack Permutations

Stacks which allow elements to be pushed into any of the top r positions and popped from any of the top s positions are studied. An asymptotic formula for the number un of permutations of length n sortable by such a stack is found in the cases r=1 or s=1. This formula is found from the generating function of un. The sortable permutations are characterized if r=1 or s=1 or r=s=2 by a forbidden subsequence condition.

Mike D. Atkinson | M. Atkinson

[1] Robert E. Tarjan,et al. Sorting Using Networks of Queues and Stacks , 1972, J. ACM.

[2] Vaughan R. Pratt,et al. Computing permutations with double-ended queues, parallel stacks and parallel queues , 1973, STOC.

[3] Zvezdelina Stankova,et al. Forbidden subsequences , 1994, Discret. Math..

[4] Julian West,et al. Generating trees and the Catalan and Schröder numbers , 1995, Discret. Math..

[5] Chi Wang,et al. Partitioning Permutations into Increasing and Decreasing Subsequences , 1996, J. Comb. Theory, Ser. A.

[6] Prosenjit Bose,et al. Pattern Matching for Permutations , 1993, WADS.

[7] Mike D. Atkinson,et al. Restricted permutations , 1999, Discret. Math..