Simple permutations and algebraic generating functions (Q2426423)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Simple permutations and algebraic generating functions |
scientific article |
Statements
Simple permutations and algebraic generating functions (English)
0 references
22 April 2008
0 references
This paper deals with simple permutations, that is with permutations that never map a nontrivial contiguous set of indices contiguously. For an arbitrary set of permutations that is closed under taking subpermutations and contains only finitely many simple permutations, there is given 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 generalized (blocked or barred) pattern. The authors prove that the generating functions of these subsets are always algebraic, generalizing some recent results of Albert and Atkinson. These techniques are also applied to enumerate the involutions and cyclic closures.
0 references
algebraic generating function
0 references
modular decomposition
0 references
permutation class
0 references
restricted permutation
0 references
simple permutation
0 references
substitution decomposition
0 references
0 references
0 references
0 references