50 citations · 148 across the 32 of their papers we have counts for
3 papers · 2 filters
Permutations sortable by n-4 passes through a stack
Anders Claesson, Mark Dukes, Einar Steingrimsson
We characterise and enumerate permutations that are sortable by n-4 passes through a stack. We conjecture the number of permutations sortable by n-5 passes, and also the form of a…
Classification of bijections between 321- and 132-avoiding permutations
Anders Claesson, Sergey Kitaev
It is well-known, and was first established by Knuth in 1969, that the number of 321-avoiding permutations is equal to that of 132-avoiding permutations. In the literature one can…
Decompositions and statistics for beta(1,0)-trees and nonseparable permutations
Anders Claesson, Sergey Kitaev, Einar Steingrimsson
The subject of pattern avoiding permutations has its roots in computer science, namely in the problem of sorting a permutation through a stack. A formula for the number of permutat…