Permutations Restricted by Two Distinct Patterns of Length Three
| dc.creator | Robertson, Aaron | |
| dc.date | 2000-12-05 | |
| dc.date | 2000-12-07 | |
| dc.date.accessioned | 2026-07-25T23:02:28Z | |
| dc.description | Define $S_n(R;T)$ to be the number of permutations on $n$ letters which avoid all patterns in the set $R$ and contain each pattern in the multiset $T$ exactly once. In this paper we enumerate $S_n(\{α\};\{β\})$ and $S_n(\emptyset;\{α,β\})$ for all $α\neq β\in S_3$. The results for $S_n(\{α\};\{β\})$ follow from two papers by Mansour and Vainshtein. | |
| dc.description | 15 pages, some relevant reference brought to my attention (see section 4) | |
| dc.identifier | https://arxiv.org/abs/math/0012029 | |
| dc.identifier | http://arxiv.org/abs/math/0012029 | |
| dc.identifier.uri | https://dspace.dare.co.zw/handle/123456789/94923 | |
| dc.subject | Combinatorics | |
| dc.subject | 05A15 | |
| dc.title | Permutations Restricted by Two Distinct Patterns of Length Three | |
| dc.type | text |