Timeline for Series defined by a fixed-point functional equation
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 29, 2013 at 19:13 | vote | accept | Samuele Giraudo | ||
| Mar 10, 2013 at 19:01 | history | edited | Zack Wolske | CC BY-SA 3.0 |
Added general method at the end
|
| Mar 10, 2013 at 17:51 | comment | added | Zack Wolske | Yes, and it seems to me to be much easier when all of your polynomials $P_i$ are homogeneous. I'll add it to the answer, because there is a bit of enumeration and subscripts don't look so nice in comments. | |
| Mar 10, 2013 at 14:28 | comment | added | Samuele Giraudo | Thanks Zack for your very detailed answer! Thus, it appears that recurrence relations for the $f_{n_1, \dots, n_k}$ are sums of lower terms with multinomial coefficients. Is there a generic way to obtain these relations directly from the functional equation and without specific trick? | |
| Mar 7, 2013 at 23:54 | comment | added | Zack Wolske | A typo in the code, $t+1/2$ instead of $t/2+1$, made the last function give the wrong values. It's now corrected, and agrees with "the number of maximal balanced binary trees" from your paper in Theoretical Computer Science (Feb. 2012, 420). | |
| Mar 7, 2013 at 23:51 | history | edited | Zack Wolske | CC BY-SA 3.0 |
deleted 588 characters in body
|
| Mar 7, 2013 at 0:30 | history | answered | Zack Wolske | CC BY-SA 3.0 |