Permutations avoiding a pattern from $S_k$ and at least two patterns from $S_3$
| dc.creator | Mansour, T. | |
| dc.date | 2000-07-31 | |
| dc.date.accessioned | 2026-07-07T04:36:35Z | |
| dc.date.available | 2026-07-07T04:36:35Z | |
| dc.description | In this paper, we find explicit formulas or generating functions for the cardinalities of the sets $S_n(T,τ)$ of all permutations in $S_n$ that avoid a pattern $τ\in S_k$ and a set $T$, $|T|\geq 2$, of patterns from $S_3$. The main body of the paper is divided into three sections corresponding to the cases $|T|=2,3$ and $|T|\geq 4$. As an example, in the fifth section, we obtain the complete classification of all cardinalities of the sets $S_n(T,τ)$ for $k=4$. | |
| dc.description | 13 pages, 1 table | |
| dc.identifier | https://arxiv.org/abs/math/0007194 | |
| dc.identifier | http://arxiv.org/abs/math/0007194 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/59652 | |
| dc.subject | Combinatorics | |
| dc.title | Permutations avoiding a pattern from $S_k$ and at least two patterns from $S_3$ | |
| dc.type | text |