Permutations avoiding a pattern from $S_k$ and at least two patterns from $S_3$

Details Permutations avoiding a pattern from $S_k$ and at least two patterns from $S_3$ Permutations avoiding a pattern from $S_k$ and at least two patterns from $S_3$

2000-07-31

arxiv.org/abs/math/0007194v1

Mathematics

Combinatorics

13 pages, 1 table

Scientific paper

In this paper, we find explicit formulas or generating functions for the cardinalities of the sets $S_n(T,\tau)$ of all permutations in $S_n$ that avoid a pattern $\tau\in S_k$ and a set $T$, $|T|\geq 2$, of patterns from $S_3$. The main body of the paper is divided into three sections corresponding to the cases $|T|=2,3$ and $|T|\geq 4$. As an example, in the fifth section, we obtain the complete classification of all cardinalities of the sets $S_n(T,\tau)$ for $k=4$.

Affiliated with

Also associated with

No associations

Rating

Permutations avoiding a pattern from $S_k$ and at least two patterns from $S_3$ 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 Permutations avoiding a pattern from $S_k$ and at least two patterns from $S_3$, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Permutations avoiding a pattern from $S_k$ and at least two patterns from $S_3$ will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-685502