Enumeration and Wilf-classification of permutations avoiding five patterns of length 4

被引：0

作者：

Mansour, Toufik ^{[1
]}

机构：

[1] Univ Haifa, Dept Math, IL-3498838 Haifa, Israel

来源：

CONTRIBUTIONS TO MATHEMATICS | 2020年 / 1卷

关键词：

pattern avoidance; Wilf-equivalence; generating functions; GENERATING TREES;

D O I：

10.47443/cm.2020.0006

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

Let S n be the symmetric group of all permutations of n letters. We show that there are exactly 3441 distinct Wilf classes for the permutations avoiding five patterns of length 4. Moreover, for each T subset of S 4 with #T T = 5 , we determine the generating function for the number of permutations in Sn(T), n ( T ) , the set of all permutations of length n that avoid each pattern in T .

引用

页码：1 / 10

页数：10

共 25 条

[1] Enumeration and Wilf-classification of permutations avoiding four patterns of length 4
Mansour, Toufik
DISCRETE MATHEMATICS LETTERS, 2020, 3 : 67 - 94
[2] Wilf-classification of mesh patterns of short length
Hilmarsson, Isak
Jonsdottir, Ingibjoerg
Siguroardottir, Steinunn
Vioarsdottir, Lina
Ulfarsson, Henning
ELECTRONIC JOURNAL OF COMBINATORICS, 2015, 22 (04):
[3] Enumeration Schemes for Permutations Avoiding Barred Patterns
Pudwell, Lara
ELECTRONIC JOURNAL OF COMBINATORICS, 2010, 17 (01):
[4] Wilf classes of pairs of permutations of length 4
Le, I
ELECTRONIC JOURNAL OF COMBINATORICS, 2005, 12 (01):
[5] Asymptotic enumeration of permutations avoiding generalized patterns
Elizalde, S
ADVANCES IN APPLIED MATHEMATICS, 2006, 36 (02) : 138 - 155
[6] Permutations avoiding certain patterns: The case of length 4 and some generalizations
Bona, M
DISCRETE MATHEMATICS, 1997, 175 (1-3) : 55 - 67
[7] Avoiding patterns of length three in compositions and multiset permutations
Heubach, S
Mansour, T
ADVANCES IN APPLIED MATHEMATICS, 2006, 36 (02) : 156 - 174
[8] Enumeration of Dumont permutations avoiding certain four-letter patterns
Burstein, Alexander
Jones, Opel
DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2021, 22 (02):
[9] The Infinite limit of random permutations avoiding patterns of length three
Pinsky, Ross G.
COMBINATORICS PROBABILITY & COMPUTING, 2020, 29 (01): : 137 - 152
[10] Refined Restricted Permutations Avoiding Subsets of Patterns of Length Three
Toufik Mansour
Aaron Robertson
Annals of Combinatorics, 2002, 6 (3) : 407 - 418

← 1 2 3 →