75 citations · 77 across the 5 of their papers we have counts for
4 papers · 1 filter
Pattern avoidance classes and subpermutations
M. D. Atkinson, M. M. Murphy, N. Ruskuc
Pattern avoidance classes of permutations that cannot be expressed as unions of proper subclasses can be described as the set of subpermutations of a single bijection. In the case…
The enumeration of simple permutations
M. H. Albert, M. D. Atkinson, M. Klazar
A simple permutation is one which maps no proper non-singleton interval onto an interval. We consider the enumeration of simple permutations from several aspects. Our results inclu…
Restricted permutations and queue jumping
M. H. Albert, R. E. L. Aldred, M. D. Atkinson +3
A connection between permutations that avoid 4231 and a certain queueing discipline is established. It is proved that a more restrictive queueing discipline corresponds to avoiding…
Regular closed classes of permutations
M. Albert, M. D. Atkinson, N. Ruskuc
Machines whose main purpose is to permute and sort data are studied. The sets of permutations that can arise are analysed by means of finite automata and avoided pattern techniques…