![]() |
Discrete Mathematics & Theoretical Computer Science |
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-avoiding permutations.
Source : ScholeXplorer
HasVersion DOI 10.48550/arxiv.1810.10099
Qiu, Dun ; Remmel, Jeffrey ; |