Lehmer code transforms and Mahonian statistics on permutations

DOI10.1016/J.DISC.2012.11.030MaRDI QIDQ1939572zbMATH OpenOpenAlexFDO

Authors Vincent Vajnovszki

Publication date 4 March 2013

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1203.3964

zbMATH Keywords

combinations of vincular patternsMahonian statisticspermutation code

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15)

Abstract: 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.

Recommendations

• Generalized permutation patterns and a classification of the Mahonian statistics
• New permutation coding and equidistribution of set-valued statistics
• Mahonian STAT on words
• A new Euler-Mahonian constructive bijection
• Babson-Steingrímsson statistics are indeed Mahonian (and sometimes even Euler-Mahonian)

Cited in

(11)

• Tests and proofs for custom data generators
• The equidistribution of some length-three vincular patterns on \(S_n(132)\)
• Equidistributions of Mahonian statistics over pattern avoiding permutations
• Two characterizations of the shape of the base poset derived from the Lehmer code of a permutation using permutation patterns.
• Efficient generation of restricted growth words
• The equidistribution of some Mahonian statistics over permutations avoiding a pattern of length three
• The statistic \texttt{pinv} for number system
• A permutation code preserving a double Eulerian bistatistic
• Homomesies on permutations: An analysis of maps and statistics in the FindStat database
• Interval and -interval rational parking functions
• Mahonian STAT on words

This page was built for publication: Lehmer code transforms and Mahonian statistics on permutations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1939572)