Refined Restricted Permutations Avoiding Subsets of Patterns of Length Three

Simple item page
dc.creatorMansour, Toufik
dc.creatorRobertson, Aaron
dc.date2002-03-30
dc.date.accessioned2026-07-07T04:47:20Z
dc.date.available2026-07-07T04:47:20Z
dc.descriptionDefine $S_n^k(T)$ to be the set of permutations of $\{1,2,...,n\}$ with exactly $k$ fixed points which avoid all patterns in $T \subseteq S_m$. We enumerate $S_n^k(T)$, $T \subseteq S_3$, for all $|T| \geq 2$ and $0 \leq k \leq n$.
dc.identifierhttps://arxiv.org/abs/math/0204005
dc.identifierhttp://arxiv.org/abs/math/0204005
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/63679
dc.subjectCombinatorics
dc.subject05A15; 68R15
dc.titleRefined Restricted Permutations Avoiding Subsets of Patterns of Length Three
dc.typetext

Files

Collections

arXiv