Refined Restricted Permutations
| dc.creator | Robertson, Aaron | |
| dc.creator | Saracino, Dan | |
| dc.creator | Zeilberger, Doron | |
| dc.date | 2002-03-04 | |
| dc.date.accessioned | 2026-07-07T04:46:49Z | |
| dc.date.available | 2026-07-07T04:46:49Z | |
| dc.description | Define $S_n^k(α)$ to be the set of permutations of $\{1,2,...,n\}$ with exactly $k$ fixed points which avoid the pattern $α\in S_m$. Let $s_n^k(α)$ be the size of $S_n^k(α)$. We investigate $S_n^0(α)$ for all $α\in S_3$ as well as show that $s_n^k(132)=s_n^k(213)=s_n^k(321)$ and $s_n^k(231)=s_n^k(312)$ for all $0 \leq k \leq n$. | |
| dc.description | This article is dedicated to the memory of Rodica Simion | |
| dc.identifier | https://arxiv.org/abs/math/0203033 | |
| dc.identifier | http://arxiv.org/abs/math/0203033 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/63487 | |
| dc.subject | Combinatorics | |
| dc.subject | 05A15, 68R15 | |
| dc.title | Refined Restricted Permutations | |
| dc.type | text |