Enumeration of permutations containing a prescribed number of occurrences of a pattern of length 3

Details Enumeration of permutations containing a prescribed number of occurrences of a pattern of length 3 Enumeration of permutations containing a prescribed number of occurrences of a pattern of length 3

2001-12-10

arxiv.org/abs/math/0112092v3

Mathematics

Combinatorics

Fixed errors in equation (19) and in the paper's last equation

Scientific paper

We consider the problem of enumerating the permutations containing exactly $k$ occurrences of a pattern of length 3. This enumeration has received a lot of interest recently, and there are a lot of known results. This paper presents an alternative approach to the problem, which yields a proof for a formula which so far only was conjectured (by Noonan and Zeilberger). This approach is based on bijections from permutations to certain lattice paths with ``jumps'', which were first considered by Krattenthaler.

Affiliated with

Also associated with

No associations

Rating

Enumeration of permutations containing a prescribed number of occurrences of a pattern of length 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 Enumeration of permutations containing a prescribed number of occurrences of a pattern of length 3, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Enumeration of permutations containing a prescribed number of occurrences of a pattern of length 3 will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-123734