On multi-avoidance of generalized patterns

Details On multi-avoidance of generalized patterns On multi-avoidance of generalized patterns

2002-09-25

arxiv.org/abs/math/0209340v1

Mathematics

Combinatorics

26 pages

Scientific paper

In [Kit1] Kitaev discussed simultaneous avoidance of two 3-patterns with no internal dashes, that is, where the patterns correspond to contiguous subwords in a permutation. In three essentially different cases, the numbers of such $n$-permutations are $2^{n-1}$, the number of involutions in $\mathcal{S}_n$, and $2E_n$, where $E_n$ is the $n$-th Euler number. In this paper we give recurrence relations for the remaining three essentially different cases. To complete the descriptions in [Kit3] and [KitMans], we consider avoidance of a pattern of the form $x-y-z$ (a classical 3-pattern) and beginning or ending with an increasing or decreasing pattern. Moreover, we generalize this problem: we demand that a permutation must avoid a 3-pattern, begin with a certain pattern and end with a certain pattern simultaneously. We find the number of such permutations in case of avoiding an arbitrary generalized 3-pattern and beginning and ending with increasing or decreasing patterns.

Affiliated with

Also associated with

No associations

Rating

On multi-avoidance of generalized patterns 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 On multi-avoidance of generalized patterns, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On multi-avoidance of generalized patterns will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-366869