3
$\begingroup$

Hi everybody,

This is my first question so I hope I will correctly be following the rules!

I am looking for a simplification of the expression

$$ m! \sum_{k=0}^n \binom{n}{k} \binom{\alpha k}{m} x^k, $$ where $n,m$ are integers and $0 < \alpha < 1$. Is it a known generating function? Or does it exist a simpler expression?

In the same order I am also trying to simplify the expression

$$ \sum_{k=1}^n k! \binom{\alpha l}{k} S(n,k) x^k,$$

where $l$ is an integer?

Many thanks for your answers!

$\endgroup$
2
  • $\begingroup$ General mathematics doesn't seem like an appropriate tag. $\endgroup$
    – Jim Conant
    Commented Jul 25, 2011 at 15:24
  • $\begingroup$ I am sorry, this is my first post! But I didn't know which tag I should use... $\endgroup$
    – David
    Commented Jul 26, 2011 at 9:12

1 Answer 1

2
$\begingroup$

Not sure that it helps, but letting $$ A_{m,n}(x) = m! \sum_{k=0}^n \binom{n}{k} \binom{\alpha k}{m} x^k $$ be the quantity you're studying, the generating function of $A_{m,n}(x)$ with respect to $m$ comes out to (if I haven't made an algebra error) $$ \sum_{m=0}^\infty A_{m,n}(x)\frac{y^m}{m!} = (1+x(1+y)^\alpha)^n. $$

$\endgroup$
2
  • $\begingroup$ Thanks for the answer! I can't see how you have this result though... However, I kind need a closed expression for $A_{m,n}(x)$ because I would need to take an expectation on $n$ (which is random)! Would you know where I could possibly find the answer? I have been looking for identities involving the generalization of falling factorials but I couldn't find any litterature... $\endgroup$
    – David
    Commented Jul 26, 2011 at 9:10
  • 1
    $\begingroup$ The formula is trivial, just reverse the order of summation and use the binomial theorem twice. What makes you think that your series will have a simple closed expression. Most series don't. $\endgroup$ Commented Jul 26, 2011 at 12:36

You must log in to answer this question.

Not the answer you're looking for? Browse other questions tagged .