Permutation Classes of Polynomial Growth

Abstract.A pattern class is a set of permutations closed under the formation of subpermutations. Such classes can be characterized as those permutations not involving a particular set of forbidden permutations. A simple collection of necessary and sufficient conditions on sets of forbidden permutations which ensure that the associated pattern class is of polynomial growth is determined. A catalogue of all such sets of forbidden permutations having three or fewer elements is provided together with bounds on the degrees of the associated enumerating polynomials.

[1]  Nikola Ruskuc,et al.  Regular closed sets of permutations , 2003, Theor. Comput. Sci..

[2]  Nikola Ruskuc,et al.  Partially Well-Ordered Closed Sets of Permutations , 2002, Order.

[3]  Nikola Ruskuc,et al.  Pattern Avoidance Classes and Subpermutations , 2005, Electron. J. Comb..

[4]  T. Mansour,et al.  Restricted 132-Avoiding Permutations , 2000, Adv. Appl. Math..

[5]  Mike D. Atkinson,et al.  Restricted permutations and the wreath product , 2002, Discret. Math..

[6]  Julian West,et al.  Generating trees and forbidden subsequences , 1996, Discret. Math..

[7]  Toufik Mansour,et al.  Counting Occurrences of 132 in a Permutation , 2002, Adv. Appl. Math..

[8]  Mike D. Atkinson,et al.  Restricted permutations , 1999, Discret. Math..

[9]  Vincent Vatter,et al.  Grid Classes and the Fibonacci Dichotomy for Restricted Permutations , 2006, Electron. J. Comb..

[10]  Martin Klazar,et al.  On Growth Rates of Closed Permutation Classes , 2003, Electron. J. Comb..

[11]  Gábor Tardos,et al.  Excluded permutation matrices and the Stanley-Wilf conjecture , 2004, J. Comb. Theory, Ser. A.