Add to ORKGWe introduce an algorithm to determine when a sorting operation, such as stack-sort or bubble-sort, outputs a given pattern. The algorithm provides a new proof of the description of West-2-stack-sortable permutations, that is permutations that are completely sorted when passed twice through a stack, in terms of patterns. We also solve the long-standing problem of describing West-3-stack-sortable permutations. This requires a new type of generalized permutation pattern we call a decorated pattern
AbstractThe permutations that can be sorted by two stacks in series are considered, subject to the c...
In the last years, different types of patterns in permutations have been studied: vincular, bivincul...
A permutation is said to avoid a pattern if it does not contain any subsequence which is order-isomo...
We introduce an algorithm to determine when a sorting operation, such as stack-sort or bubble-sort, ...
We consider the set of permutations that are sortable after two passes through a pop stack. We chara...
In the 60’s, Knuth introduced stack-sorting and serial compositions of stacks. In par-ticular, one s...
The subject of pattern avoiding permutations has its roots in computer science, namely in the proble...
AbstractIn his Ph.D. thesis, Julian West (Permutations with restricted subsequences and stack-sortab...
New automatic methods for enumerating permutation classes are introduced. The first is Struct, which...
Sorting organizes information for optimal usage, and our work examines the mathematics behind sortin...
Given two permutations sigma (of length k) and pi (of length n), the permutation pi is said to conta...
Cette thèse porte sur l'étude des classes de permutations à motifs exclus. Une analyse combinatoire ...
The Block Sorting problem is to sort a given permutation moving blocks. A block is defined as a subs...
We introduce the Dual Bubble Sort operator B\u2c6 (a sorting algorithm such that, if σ=α1&...
There is a deep connection between permutations and trees. Certain sub-structures of permutations, c...
AbstractThe permutations that can be sorted by two stacks in series are considered, subject to the c...
In the last years, different types of patterns in permutations have been studied: vincular, bivincul...
A permutation is said to avoid a pattern if it does not contain any subsequence which is order-isomo...
We introduce an algorithm to determine when a sorting operation, such as stack-sort or bubble-sort, ...
We consider the set of permutations that are sortable after two passes through a pop stack. We chara...
In the 60’s, Knuth introduced stack-sorting and serial compositions of stacks. In par-ticular, one s...
The subject of pattern avoiding permutations has its roots in computer science, namely in the proble...
AbstractIn his Ph.D. thesis, Julian West (Permutations with restricted subsequences and stack-sortab...
New automatic methods for enumerating permutation classes are introduced. The first is Struct, which...
Sorting organizes information for optimal usage, and our work examines the mathematics behind sortin...
Given two permutations sigma (of length k) and pi (of length n), the permutation pi is said to conta...
Cette thèse porte sur l'étude des classes de permutations à motifs exclus. Une analyse combinatoire ...
The Block Sorting problem is to sort a given permutation moving blocks. A block is defined as a subs...
We introduce the Dual Bubble Sort operator B\u2c6 (a sorting algorithm such that, if σ=α1&...
There is a deep connection between permutations and trees. Certain sub-structures of permutations, c...
AbstractThe permutations that can be sorted by two stacks in series are considered, subject to the c...
In the last years, different types of patterns in permutations have been studied: vincular, bivincul...
A permutation is said to avoid a pattern if it does not contain any subsequence which is order-isomo...