Timeline for Partitioning the set of vertices of a convex n-gon into nonintersecting polygons
Current License: CC BY-SA 4.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 5, 2022 at 6:31 | vote | accept | Janaka Rodrigo | ||
| Apr 2, 2022 at 1:13 | comment | added | Janaka Rodrigo | @ Timothy Budd -This approach is really interesting and very quick. I think here you have to find 2k-2 nd backwards difference ( which I did in my research to derive general formula) and differentiate the function 2k-2 times then equal the coefficient of the highest power ot n . | |
| Apr 1, 2022 at 7:10 | history | answered | Timothy Budd | CC BY-SA 4.0 |