Classical pattern distributions in $\mathcal{S}_{n}(132)$ and $\mathcal{S}_{n}(123)$
Classical pattern avoidance and occurrence are well studied in the symmetric group $\mathcal{S}_{n}$. In this paper, we provide explicit recurrence relations to the generating functions counting the number of classical pattern occurrence in the set of 132-avoiding permutations and the set of 123-avo...
Main Authors: | Dun Qiu, Jeffrey Remmel |
---|---|
Format: | Article |
Language: | English |
Published: |
Discrete Mathematics & Theoretical Computer Science
2019-11-01
|
Series: | Discrete Mathematics & Theoretical Computer Science |
Subjects: | |
Online Access: | https://dmtcs.episciences.org/5088/pdf |
Similar Items
-
Descent c-Wilf Equivalence
by: Quang T. Bach, et al.
Published: (2017-03-01) -
Equivalence classes of mesh patterns with a dominating pattern
by: Murray Tannock, et al.
Published: (2018-02-01) -
Positional Marked Patterns in Permutations
by: Sittipong Thamrongpairoj, et al.
Published: (2022-08-01) -
Enumeration of Dumont permutations avoiding certain four-letter patterns
by: Alexander Burstein, et al.
Published: (2021-07-01) -
The number of distinct adjacent pairs in geometrically distributed words
by: Margaret Archibald, et al.
Published: (2021-01-01)