Permutation classes, sorting algorithms, and lattice paths
A permutation is said to avoid a pattern if it does not contain any subsequence which is order-isomorphic to it. Donald Knuth, in the first volume of his celebrated book "The art of Computer Programming", observed that the permutations that can be computed (or, equivalently, sorted) by som...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Doctoral Thesis |
| Language: | en |
| Published: |
Alma Mater Studiorum - Università di Bologna
2013
|
| Subjects: | |
| Online Access: | http://amsdottorato.unibo.it/6032/ |