Timeline for Generating function for "descents" and "cycle-types", in tandem
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 9, 2022 at 16:20 | vote | accept | T. Amdeberhan | ||
| Apr 8, 2022 at 7:04 | history | became hot network question | |||
| Apr 8, 2022 at 0:50 | answer | added | Ira Gessel | timeline score: 10 | |
| Apr 7, 2022 at 23:10 | comment | added | Sam Hopkins | Close to what you want: the number of permutations with descent set $S\subseteq [n-1]$ and cycle type $\lambda$ is $\langle L_{\lambda}, s_{B_S}\rangle$ where $s_{B_S}$ is the ribbon Schur function and $L_{\lambda}$ is the Lyndon symmetric function. See Stanley's recent slides: math.mit.edu/~rstan/transparencies/permenum.pdf. | |
| Apr 7, 2022 at 23:00 | history | asked | T. Amdeberhan | CC BY-SA 4.0 |