Refined Restricted Permutations
Author(s) -
Aaron Robertson,
Dan Saracino,
Doron Zeilberger
Publication year - 2002
Publication title -
annals of combinatorics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.467
H-Index - 25
eISSN - 0219-3094
pISSN - 0218-0006
DOI - 10.1007/s000260200015
Subject(s) - combinatorics , mathematics , alpha (finance) , statistics , construct validity , psychometrics
Define $S_n^k(\alpha)$ to be the set of permutations of $\{1,2,...,n\}$ withexactly $k$ fixed points which avoid the pattern $\alpha \in S_m$. Let$s_n^k(\alpha)$ be the size of $S_n^k(\alpha)$. We investigate $S_n^0(\alpha)$for all $\alpha \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 \leqk \leq n$.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom