Skip to main content

Timeline for A combinatorial identity

Current License: CC BY-SA 3.0

9 events
when toggle format what by license comment
Aug 15, 2017 at 16:42 answer added esg timeline score: 6
Aug 15, 2017 at 15:12 answer added Fedor Petrov timeline score: 4
Aug 15, 2017 at 9:35 comment added Fedor Petrov Combinatorial reformulation: consider all the trees $T$ on $\{0,1,\dots,K\}$ for which the vertices $1,2,\dots,p$ are in different components of $T\setminus \{0\}$. For each such a tree take a summand $(-K)^{\deg(0)-p}$. The sum equals $(K-2)!/(p-2)!$ for $p\geqslant 2$ and 0 for $p=0,1$.
Aug 14, 2017 at 9:13 history edited Honglu CC BY-SA 3.0
Add details for one of the question.
Aug 14, 2017 at 2:50 answer added Ira Gessel timeline score: 12
Aug 13, 2017 at 18:38 vote accept Honglu
Aug 13, 2017 at 13:53 answer added Fedor Petrov timeline score: 28
Aug 13, 2017 at 11:35 history edited Honglu CC BY-SA 3.0
added a few words to clarify.
Aug 13, 2017 at 11:29 history asked Honglu CC BY-SA 3.0