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 u(n) 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 u(n). The sortable permutations are characterized if r = 1 or s = 1 or r = s = 2 by a forbidden subsequence condition.</p
AbstractThe class SSn of stack sortable permutations is known to be in 1-1 correspondence with the s...
AbstractWe present the first nontrivial results on t-stack sortable permutations by constructively p...
Using Zeilberger's factorization of two-stack-sortable permutations, we write a functional equa...
Stacks which allow elements to be pushed into any of the top r positions and popped from any of the ...
AbstractThe permutations that can be sorted by two stacks in series are considered, subject to the c...
AbstractIn his Ph.D. thesis, Julian West (Permutations with restricted subsequences and stack-sortab...
In the 60’s, Knuth introduced stack-sorting and serial compositions of stacks. In par-ticular, one s...
Lower and upper bounds are given for the the number of permutations of length n generated by two sta...
Abstract. The enumeration of permutations with specific forbidden subsequences has applications in a...
We consider the set of permutations that are sortable after two passes through a pop stack. We chara...
Abstract. At the end of the 1960s, Knuth characterised in terms of forbidden patterns the permutatio...
AbstractWe consider the operation of stack-sorting studied by Knuth. We take the point of view that ...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1990.Includes bibliogr...
Sorting with stacks is a collection of problems that deal with sorting a sequence of numbers by push...
AMS Subject Classication: 05A15 Abstract. The enumeration of permutations with specic forbidden subs...
AbstractThe class SSn of stack sortable permutations is known to be in 1-1 correspondence with the s...
AbstractWe present the first nontrivial results on t-stack sortable permutations by constructively p...
Using Zeilberger's factorization of two-stack-sortable permutations, we write a functional equa...
Stacks which allow elements to be pushed into any of the top r positions and popped from any of the ...
AbstractThe permutations that can be sorted by two stacks in series are considered, subject to the c...
AbstractIn his Ph.D. thesis, Julian West (Permutations with restricted subsequences and stack-sortab...
In the 60’s, Knuth introduced stack-sorting and serial compositions of stacks. In par-ticular, one s...
Lower and upper bounds are given for the the number of permutations of length n generated by two sta...
Abstract. The enumeration of permutations with specific forbidden subsequences has applications in a...
We consider the set of permutations that are sortable after two passes through a pop stack. We chara...
Abstract. At the end of the 1960s, Knuth characterised in terms of forbidden patterns the permutatio...
AbstractWe consider the operation of stack-sorting studied by Knuth. We take the point of view that ...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1990.Includes bibliogr...
Sorting with stacks is a collection of problems that deal with sorting a sequence of numbers by push...
AMS Subject Classication: 05A15 Abstract. The enumeration of permutations with specic forbidden subs...
AbstractThe class SSn of stack sortable permutations is known to be in 1-1 correspondence with the s...
AbstractWe present the first nontrivial results on t-stack sortable permutations by constructively p...
Using Zeilberger's factorization of two-stack-sortable permutations, we write a functional equa...
DOI
Add to ORKG