Timeline for Is there a formula for the number of elements in $S_n$ having length $k$ with respect to the generators taken to be the transpositions?
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 17, 2016 at 12:59 | comment | added | Stefan Kohl♦ | @M.T: A reference is for example: T. Kyle Petersen, Eulerian Numbers, Birkhäuser, 2015, Page 96. | |
| Apr 17, 2016 at 12:01 | comment | added | M. T | Thank you all. Yes Stephan, this is exactly what I meant. Do you know a good reference for the information you posted? Thanks in advance | |
| Apr 16, 2016 at 18:32 | comment | added | Paul Broussous | This product is also called the Poincaré series of the Coxeter system $S_n$ ... | |
| Apr 16, 2016 at 16:05 | comment | added | Noam D. Elkies | I see that "Mahonian" = in honor of MacMahon; is that a common formation? (Cf. Descartes → cartesian, but Desargues → Desarguesian [though "Arguesian" is occasionally seen too].) | |
| Apr 16, 2016 at 16:01 | history | answered | Stefan Kohl♦ | CC BY-SA 3.0 |