Lehmer code transforms and Mahonian statistics on permutations

Details Lehmer code transforms and Mahonian statistics on permutations Lehmer code transforms and Mahonian statistics on permutations

2012-03-18

arxiv.org/abs/1203.3964v1

Mathematics

Combinatorics

Scientific paper

In 2000 Babson and Steingr{\'\i}msson introduced the notion of vincular patterns in permutations. They shown that essentially all well-known Mahonian permutation statistics can be written as combinations of such patterns. Also, they proved and conjectured that other combinations of vincular patterns are still Mahonian. These conjectures were proved later: by Foata and Zeilberger in 2001, and by Foata and Randrianarivony in 2006. In this paper we give an alternative proof of some of these results. Our approach is based on permutation codes which, like Lehmer's code, map bijectively permutations onto subexcedant sequences. More precisely, we give several code transforms (i.e., bijections between subexcedant sequences) which when applied to Lehmer's code yield new permutation codes which count occurrences of some vincular patterns.

Affiliated with

Also associated with

No associations

Rating

Lehmer code transforms and Mahonian statistics on permutations 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 Lehmer code transforms and Mahonian statistics on permutations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Lehmer code transforms and Mahonian statistics on permutations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-617728