MathOverflow is a question and answer site for professional mathematicians. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

In a Faa Di Bruno Formula there is an equation:


Is there any general solution for this equation.

For example for $m_1$+$m_2$+$m_3$+...+$m_n$=n, there is a simple algorithm calculating this. Thanks, Gevorg.

share|cite|improve this question
up vote 4 down vote accepted

I presume you want to solve this equation $\sum_{k=1}^{n}km_k=n$ for integer $m_k$ that sum to $s$. There is no general solution, valid for any $1\leq s\leq n$, but the problem can be reduced to a calculation of integer partitions, see Faa di Bruno's formula, lattices, and partitions (2005).

share|cite|improve this answer
Dear @Carlo Beenakker Thanks for answer. – veg_nw Mar 17 '14 at 15:20

You want to have a simpler summation in Faa Di Bruno Formula by avoiding using specific Diophantine equation? See this referrences

Voinov, V. G., & Nikulin, M. (1994). On power series, Bell polynomials, Hardy-Ramanujan-Rademacher problem and its statistical applications. Kybernetika, 30(3), 343-358.

Mortini, R. (2013). The Faa di Bruno formula revisited. Elemente der Mathematik, 68(1), 33-38.

share|cite|improve this answer
Dear @user48365 Thanks. Yes exactly I would like to have a simpler summation. – veg_nw Mar 17 '14 at 15:39

An algorithm in given in S. Blinnikov and R. Moessner, Expansions for nearly Gaussian distributions, Astron. Astrophys. Suppl. Ser. 130, 193 (1998).

(I'm not qualified to judge whether it's the best one or not)

share|cite|improve this answer

Your Answer


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.