Lower and upper bounds are given for the the number of permutations of length n generated by two stacks in series, two stacks in parallel, and a general deque.</p
We introduce and characterise grid classes, which are natural generalisations of other well-studied ...
In this thesis we study different methods of counting a large number of combinatorial objects: permu...
We prove that every sufficiently long simple permutation contains two long almost disjoint simple su...
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...
AbstractWe give a direct count of the number of permutations of n objects for which (a) all the cycl...
We obtain an upper and lower bound for the number of reduced words for a permutation in terms of the...
AbstractIt is proved that the number of permuations on 1, 2, ..., n with exactly one increasing subs...
We prove that the set of permutations generated by a stack of depth two and an infinite stack in ser...
We present two methods that for infinitely many patterns q provide better upper bounds for the numbe...
AbstractThe Polya-Schutzenberger-Tutte methodology of weight enumeration, combined with about 10 hou...
The graph of overlapping permutations is defined in a way analogous to the De Bruijn graph on string...
Let Xn be an n-element set. We give an alternative proof of Cauchy’s theorem for the number of...
Abstract. At the end of the 1960s, Knuth characterised in terms of forbidden patterns the permutatio...
We examine the sets of permutations that are sorted by two passes through a stack with a $D_8$ opera...
We introduce and characterise grid classes, which are natural generalisations of other well-studied ...
In this thesis we study different methods of counting a large number of combinatorial objects: permu...
We prove that every sufficiently long simple permutation contains two long almost disjoint simple su...
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...
AbstractWe give a direct count of the number of permutations of n objects for which (a) all the cycl...
We obtain an upper and lower bound for the number of reduced words for a permutation in terms of the...
AbstractIt is proved that the number of permuations on 1, 2, ..., n with exactly one increasing subs...
We prove that the set of permutations generated by a stack of depth two and an infinite stack in ser...
We present two methods that for infinitely many patterns q provide better upper bounds for the numbe...
AbstractThe Polya-Schutzenberger-Tutte methodology of weight enumeration, combined with about 10 hou...
The graph of overlapping permutations is defined in a way analogous to the De Bruijn graph on string...
Let Xn be an n-element set. We give an alternative proof of Cauchy’s theorem for the number of...
Abstract. At the end of the 1960s, Knuth characterised in terms of forbidden patterns the permutatio...
We examine the sets of permutations that are sorted by two passes through a stack with a $D_8$ opera...
We introduce and characterise grid classes, which are natural generalisations of other well-studied ...
In this thesis we study different methods of counting a large number of combinatorial objects: permu...
We prove that every sufficiently long simple permutation contains two long almost disjoint simple su...
DOI
Add to ORKG