Refined Restricted Permutations Avoiding Subsets of Patterns of Length Three

Details Refined Restricted Permutations Avoiding Subsets of Patterns of Length Three Refined Restricted Permutations Avoiding Subsets of Patterns of Length Three

2002-03-30

arxiv.org/abs/math/0204005v1

Mathematics

Combinatorics

Scientific paper

Define $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$.

Affiliated with

Also associated with

No associations

Rating

Refined Restricted Permutations Avoiding Subsets of Patterns of Length Three does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Refined Restricted Permutations Avoiding Subsets of Patterns of Length Three, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Refined Restricted Permutations Avoiding Subsets of Patterns of Length Three will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-585028