期刊名称：International Journal of Combinatorial Optimization Problems and Informatics
印刷版ISSN：2007-1558
电子版ISSN：2007-1558
出版年度：2011
卷号：2
期号：2
页码：2-11
语种：English
出版社：International Journal of Combinatorial Optimization Problems and Informatics
其他摘要：A permutation is called simple if its only blocks i.e. subsets of the permutation consist of singleton and the permutation itself. For example, 2134 is not a simple permutation since it consists of a block 213 but 3142 is a simple permutation. The basis of a class of permutations is a set of patterns, which is minimal under involvement and do not belong to the permutation. In this paper we prove that the number of simple permutations an of the pattern class Av(321, 3412) follows the recurrence an = an¡1+an¡2 for n , 4 and the pattern class Av(321, 4123) follows the recurrence an = an¡2+an¡3 for n, 7. Thus, these pattern classes have polynomial growth.
