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

Mathematics – Combinatorics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

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

     

Profile ID: LFWR-SCP-O-123734

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.