Using Zeilberger's factorization of two-stack-sortable permutations, we write a functional equation --- of a strange sort --- that defines their generating function according to five statistics: length, number of descents, number of right-to-left and left-to-right maxima, and a fifth statistic that is closely linked to the factorization. Then, we show how one can translate this functional equation into a polynomial one. We thus prove that our five-variable generating function for two-stack-sortable permutations is algebraic of degree 20. 1 Introduction The aim of this paper is twofold. Our first intention is to draw attention on the factorization of two-stacksortable permutations described by Zeilberger in [22]. Among other advantages...
We investigate a generalization of stacks that we call - machines. We show how this viewpoint rapidl...
Stacks which allow elements to be pushed into any of the top r positions and popped from any of the ...
23 pagesIn this article, we give a polynomial algorithm to decide whether a given permutation $\sigm...
AbstractIn his Ph.D. thesis, Julian West (Permutations with restricted subsequences and stack-sortab...
Sorting organizes information for optimal usage, and our work examines the mathematics behind sortin...
In the 60’s, Knuth introduced stack-sorting and serial compositions of stacks. In par-ticular, one s...
Abstract. We consider the problem of factorization of permutations. We begin with a discussion of so...
AbstractOne of the most challenging problems in enumerative combinatorics is to count Wilf classes, ...
The study of permutations and permutation statistics dates back hundreds of years to the time of Eul...
AbstractWe consider the operation of stack-sorting studied by Knuth. We take the point of view that ...
There has been considerable interest recently in the subject of patterns in permutations and words, ...
We present an algorithm for finding a system of recurrence relations for the number of permutations ...
AbstractIn this paper we introduce and study a class of tableaux which we call permutation tableaux;...
This monograph provides a self-contained introduction to symmetric functions and their use in enumer...
We consider the set of permutations that are sortable after two passes through a pop stack. We chara...
We investigate a generalization of stacks that we call - machines. We show how this viewpoint rapidl...
Stacks which allow elements to be pushed into any of the top r positions and popped from any of the ...
23 pagesIn this article, we give a polynomial algorithm to decide whether a given permutation $\sigm...
AbstractIn his Ph.D. thesis, Julian West (Permutations with restricted subsequences and stack-sortab...
Sorting organizes information for optimal usage, and our work examines the mathematics behind sortin...
In the 60’s, Knuth introduced stack-sorting and serial compositions of stacks. In par-ticular, one s...
Abstract. We consider the problem of factorization of permutations. We begin with a discussion of so...
AbstractOne of the most challenging problems in enumerative combinatorics is to count Wilf classes, ...
The study of permutations and permutation statistics dates back hundreds of years to the time of Eul...
AbstractWe consider the operation of stack-sorting studied by Knuth. We take the point of view that ...
There has been considerable interest recently in the subject of patterns in permutations and words, ...
We present an algorithm for finding a system of recurrence relations for the number of permutations ...
AbstractIn this paper we introduce and study a class of tableaux which we call permutation tableaux;...
This monograph provides a self-contained introduction to symmetric functions and their use in enumer...
We consider the set of permutations that are sortable after two passes through a pop stack. We chara...
We investigate a generalization of stacks that we call - machines. We show how this viewpoint rapidl...
Stacks which allow elements to be pushed into any of the top r positions and popped from any of the ...
23 pagesIn this article, we give a polynomial algorithm to decide whether a given permutation $\sigm...