Work

Pattern Avoidance Classes and Subpermutations

Year: 2005
Type: article
Abstract: 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 that this bijection is a permutation of the natural numbers a structure theorem is given. The structure theorem shows that the class is almost closed under direct sums or has a rational generating function.
Language: English
Open Access status: diamond
OpenAlex ID: W1566532125
FWCI: 2.433
Cites: 9
Cited by: 15
Related to: 10