MacMahon's theorem for a set of permutations with given descent indices and right-maximal records (Q2380467)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5687016
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | MacMahon's theorem for a set of permutations with given descent indices and right-maximal records |
scientific article; zbMATH DE number 5687016 |
Statements
MacMahon's theorem for a set of permutations with given descent indices and right-maximal records (English)
0 references
26 March 2010
0 references
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.
0 references
major codes
0 references
inversion codes
0 references
permutations
0 references
descent index
0 references
right maximal record
0 references
0.85983086
0 references
0.84343565
0 references
0.83844024
0 references
0.8374914
0 references
0.83139294
0 references
0.8241963
0 references
0.8208709
0 references
0.81887525
0 references
0 references
