A new derivation of the generating function for the major index (Q916662): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: On the Netto Inversion Number of a Sequence / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Bijective Proof of Stanley's Shuffling Theorem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3947818 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The (<i>q</i><i>r</i>)-Simon Newcomb problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3748279 / rank | |||
Normal rank |
Latest revision as of 09:52, 21 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A new derivation of the generating function for the major index |
scientific article |
Statements
A new derivation of the generating function for the major index (English)
0 references
1990
0 references
The following theorem is proved: There is a bijection between the set of partitions of m that fit inside a \(k\times (n-k)\) rectangle and the set consisting of permutations w of \(0^ k\) \(1^{n-k}\) having \(maj(w)=m\).
0 references