Timeline for Partitioning the set of vertices of a convex n-gon into nonintersecting polygons
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 5, 2022 at 6:31 | vote | accept | Janaka Rodrigo | ||
| Apr 1, 2022 at 13:42 | history | became hot network question | |||
| Apr 1, 2022 at 11:12 | comment | added | Max Alekseyev | Along the same lines as mathoverflow.net/q/417106 | |
| Apr 1, 2022 at 7:10 | answer | added | Timothy Budd | timeline score: 8 | |
| Apr 1, 2022 at 5:52 | history | edited | Per Alexandersson | CC BY-SA 4.0 |
made formula into tex
|
| Apr 1, 2022 at 5:51 | comment | added | Per Alexandersson | In Mathematica, one can check for specific k: With[{k = 7}, {Sum[(-1)^r Binomial[2 k - 2, r] (5 k - 2 - r)^(2 k - 2), {r, 0, 2 k - 2}] , (2 k - 2)! }] | |
| Apr 1, 2022 at 5:42 | history | asked | Janaka Rodrigo | CC BY-SA 4.0 |