Timeline for Is there a bijection of permutations onto mathematical objects that preserve information about descents?
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 5, 2014 at 20:06 | vote | accept | symmetricuser | ||
| Oct 2, 2014 at 9:09 | answer | added | Martin Rubey | timeline score: 7 | |
| Oct 2, 2014 at 4:49 | comment | added | Martin Rubey | There is no need to restrict to fixed-point-free involutions, is there? | |
| Oct 2, 2014 at 2:32 | comment | added | Ira Gessel | The Robinson-Schensted correspondence restricted to FPFI is a bijection onto standard Young tableaux with every column of even length that preserves descents (i is a descent of a standard Young tableau if i+1 is to the left of i). | |
| Oct 2, 2014 at 2:30 | review | Close votes | |||
| Oct 2, 2014 at 12:39 | |||||
| Oct 2, 2014 at 2:10 | comment | added | darij grinberg | The map that sends a permutation to its descent set itself is a very useful thing. It is the map $S_n \to Q_n$ in Loday/Ronco "Hopf Algebra of the Planar Binary Trees" ( sciencedirect.com/science/article/pii/S0001870898917595 ), and factors through $Y_n$ as shown on page 1 of that paper. | |
| Oct 2, 2014 at 1:30 | review | First posts | |||
| Oct 2, 2014 at 2:17 | |||||
| Oct 2, 2014 at 1:29 | history | asked | symmetricuser | CC BY-SA 3.0 |