I wish to show that $\sum_{k=0}^n {n\choose k}(\alpha + k)^k (\beta + n - k)^{(n-k)} = \sum_{k=0}^n {n\choose k}(\gamma + k)^k (\delta + n - k)^{(n-k)}$ given that $\alpha + \beta = \gamma + \delta$.
Both sides appear to be the n-th coefficient in the product of some exponential generating series, namely $F(y,x) = \sum_{n=0}^{\infty} (y+n)^n / n!$, and that $F(y,x) = \exp(y\times T(x))$ for some series $T(x)$. It seems to be exponential because we could then have $F(a+b,x) = F(a,x) F(b,x)$.
I have thought to use the Lagrange inversion theorem in a manner similar to some proofs of Abel's binomial theorem. Namely, if $T(x)$ is the solution to $T(x) = x \phi (T(x))$ for some invertible $\phi(x)$ in $\mathbb{Z} [[x]]$, then for $f(y,x) = exp(yx)$ we would have:
$[x^n]f(yT(x)) = \frac{1}{n} [x^{n-1}] f'(x) \phi(x)^n = (y+n)^n / n!$.
The issue is then in showing such a $\phi(x)$ exists. Unfortunately, my attempts using this approach have not been successful. Could I have some hints or suggestions on how to proceed?
Regards,
Garnet