Timeline for Closed form for a binomial product sum
Current License: CC BY-SA 4.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 2, 2022 at 5:32 | history | edited | Vishnu Namboothiri K | CC BY-SA 4.0 |
added 14 characters in body
|
| Jan 7, 2022 at 4:07 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Dec 8, 2021 at 3:06 | answer | added | Vishnu Namboothiri K | timeline score: 0 | |
| Nov 30, 2021 at 0:05 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Oct 30, 2021 at 23:42 | answer | added | AstroNi | timeline score: 1 | |
| Oct 30, 2021 at 6:09 | comment | added | Vishnu Namboothiri K | @AstroNi Thank you for the clarification; but where can I find a good combinatorial reasoning that this represents the Fubini numbers? Also, I can see that there is a generating function for Fubini numbers from the Wikipedia page on Fubini numbers. Is it possible to get such a generating function for a general $j$? | |
| Oct 28, 2021 at 18:10 | comment | added | Peter Taylor | For $j < n$ this counts ordered partitions of the set $\{1, \ldots, n\}$ in which the first part has size $n - j$. It's not obvious that there should be a closed form expression for this, especially since no closed form expression for the simpler case $j = n$ is listed in the referenced OEIS entry. | |
| Oct 28, 2021 at 17:16 | comment | added | AstroNi | The $n=j$ case is Fubini numbers from the combinatorial interpretation of this sum | |
| S Oct 28, 2021 at 2:47 | review | First questions | |||
| Oct 28, 2021 at 5:37 | |||||
| S Oct 28, 2021 at 2:47 | history | asked | Vishnu Namboothiri K | CC BY-SA 4.0 |