Enumeration and wilf-classification of permutations avoiding four patterns of length 4

Toufik Mansour

Enumeration and wilf-classification of permutations avoiding four patterns of length 4

Department of Mathematics

Research output: Contribution to journal › Article › peer-review

Abstract

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

Original language	English
Pages (from-to)	67-94
Number of pages	28
Journal	Discrete Mathematics Letters
Volume	3
State	Published - 2020

Bibliographical note

Publisher Copyright:
© 2020 the author.

Keywords

Generating functions
Pattern avoidance
Wilf-equivalence

ASJC Scopus subject areas

Discrete Mathematics and Combinatorics

Cite this

@article{7a4ad72b3f624d7bbe136f6a74a6bb54,

title = "Enumeration and wilf-classification of permutations avoiding four patterns of length 4",

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

keywords = "Generating functions, Pattern avoidance, Wilf-equivalence",

author = "Toufik Mansour",

note = "Publisher Copyright: {\textcopyright} 2020 the author.",

year = "2020",

language = "English",

volume = "3",

pages = "67--94",

journal = "Discrete Mathematics Letters",

issn = "2664-2557",

publisher = "Shahin Digital Publisher",

}

TY - JOUR

T1 - Enumeration and wilf-classification of permutations avoiding four patterns of length 4

AU - Mansour, Toufik

PY - 2020

Y1 - 2020

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

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

KW - Generating functions

KW - Pattern avoidance

KW - Wilf-equivalence

UR - http://www.scopus.com/inward/record.url?scp=85103421133&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:85103421133

SN - 2664-2557

VL - 3

SP - 67

EP - 94

JO - Discrete Mathematics Letters

JF - Discrete Mathematics Letters

ER -

Enumeration and wilf-classification of permutations avoiding four patterns of length 4

Abstract

Bibliographical note

Keywords

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this