Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

If I have given the following generating function

$$B = \sum_{n > 0} x^n \sum_{k_1 + \cdots + k_c = n} a(k_1) \cdots a(k_c)$$

is it possible to obtain a nice convolution expression for $a(k_1) \cdots a(k_c)$ in terms of some generating function A?

What bothers me is the summation-constraint $k_1 + \cdots + k_c = n$ of the inner sum, thus it is not straight forward for me to come up with a convolution.

share|improve this question
    
This must be a homework, so I've tagged it as such. Feel free to roll back if it is not. –  Sasha Mar 9 '12 at 1:45
    
@Sasha no its not, but I am glad if it looks easy, because I don't have an approach for it, but I am no expert in this field. –  steven Mar 9 '12 at 1:47
add comment

1 Answer

up vote 2 down vote accepted

Here goes: $$ \begin{eqnarray} B(x) &=& \sum_{n > 0} x^n \sum_{k_1 + \cdots + k_c = n} a(k_1) \cdots a(k_c) = \sum_{n > 0} x^n \sum_{k_1,\ldots, k_c >0 } \delta_{n, k_1+\cdots+k_c} a(k_1) \cdots a(k_c) \\ &=& \sum_{k_1,\ldots, k_c >0 } \left( \sum_{n > 0} x^n \delta_{n, k_1+\cdots+k_c} \right) a(k_1) \cdots a(k_c) \\ &=& \sum_{k_1,\ldots, k_c >0 } x^{k_1 + \cdots+k_c} a(k_1) \cdots a(k_c) = \left( \sum_{k_1 >0 } x^{k_1} a(k_1)\right) \cdots \left( \sum_{k_c >0 } x^{k_c} a(k_c)\right) = (A(x))^c \end{eqnarray} $$

share|improve this answer
add comment

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.