A simple permutation is one that never maps a nontrivial contiguous set of indices contiguously. Given a set of permutations that is closed under taking subpermutations and contains only finitely many simple permutations, we provide a framework for enumerating subsets that are restricted by properties belonging to a finite "query-complete set." Such properties include being even, being an alternating permutation, and avoiding a given generalised (blocked or barred) pattern. We show that the generating functions for these subsets are always algebraic, thereby generalising recent results of Albert and Atkinson. We also apply these techniques to the enumeration of involutions and cyclic closures.
|Translated title of the contribution||Simple permutations and algebraic generating functions|
|Pages (from-to)||423 - 441|
|Number of pages||18|
|Journal||Journal of Combinatorial Theory, Series A|
|Volume||115, issue 3|
|Publication status||Published - Apr 2008|