Timeline for The combinatorics of $(f \partial)^n$ in the noncommutative setting?
Current License: CC BY-SA 4.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 16, 2022 at 15:24 | vote | accept | M.G. | ||
| Apr 14, 2022 at 21:21 | comment | added | Max Alekseyev | @M.G.: This problem does not require any advanced methods: connection with $f_n$ can be easily proved by induction on $n$, while the formula for the coefficients is computed "backwards" - first picking $a_n$ parentheses containing $x_n$ from the product, then $a_{n-1}$ parentheses containing $x_{n-1}$ etc. Given that the formula works well in noncommutative case, I'd not be surprised if Comtet mentioned that in his paper (but I did not check). | |
| Apr 14, 2022 at 20:50 | comment | added | M.G. | Dear @Max Alekseyev, thank you very much for taking the time to write this down. I am not a combinatorialist, so I very much appreciate this. Do you know any good reference for the umbral methods you just employed, suitable for non-combinatorialists? | |
| Apr 14, 2022 at 20:34 | history | answered | Max Alekseyev | CC BY-SA 4.0 |