Timeline for Parking functions to non-crossing partitions
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 3, 2018 at 8:54 | answer | added | JKreft | timeline score: 1 | |
| May 1, 2013 at 14:56 | answer | added | Biane Philippe | timeline score: 1 | |
| May 9, 2012 at 15:40 | vote | accept | Michael Falk | ||
| Apr 16, 2012 at 19:06 | answer | added | Christian Stump | timeline score: 8 | |
| Apr 15, 2012 at 9:25 | comment | added | Christian Stump | I'd love to get a complete answer to that question as well. During my flight in the morning, I figured a way to construct this bijection, but it is not completely "local" in your sense. For a primitive parking function (i.e., one that is weakly increasing) there is a fairly standard way to produce the corresponding maximal chain in the noncrossing partition lattice. And for non-primitive parking functions, there is a way to reorganize the maximal chain of the corresponding primitive rearrangement. If you are interested, I will write a full answer containing the construction. | |
| Apr 14, 2012 at 12:04 | history | asked | Michael Falk | CC BY-SA 3.0 |