MacMahon's theorem for a set of permutations with given descent indices and right-maximal records

MaRDI QIDQ2380467zbMATH OpenFDO

Authors A. Dzhumadil'daev

Publication date 26 March 2010

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/224676, http://www.emis.de/journals/EJC/Volume_17/Abstracts/v17i1r34.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

descent indexinversion codesmajor codespermutationsright maximal record

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Review text

Summary: We show that the major codes and inversion codes are equidistributed over a set of permutations with prescribed descent indices and right-maximal records.

Recommendations

• MacMahon's equidistribution theorem for \(k\)-Stirling permutations
• Equivalence classes of permutations modulo descents and left-to-right maxima
• Alternating permutations and the mth descents
• Major index over descent for pattern-avoiding permutations
• The joint distribution of descent and major index over restricted sets of permutations
• scientific article; zbMATH DE number 140099
• Mac{M}ahon-type identities for signed even permutations
• Exact and asymptotic enumeration of cyclic permutations according to descent set
• The enumeration of permutations whose posets have a maximum element
• Descents in t-sorted permutations

Cited in

(1)

• Han's bijection via permutation codes

This page was built for publication: MacMahon's theorem for a set of permutations with given descent indices and right-maximal records

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