Talk:Lagrange inversion theorem
From Wikipedia, the free encyclopedia
What about this:
∞ dn-1 / (w - a)n \ | (z - b)n g(z) = a + ∑ ------ | ----------- | | -------- n=1 (dw)n-1 \ (f(w) - b)n / | n! | w=a
--Edmund 02:23 Feb 22, 2003 (UTC)
Yup, the TeX is correct now. AxelBoldt 20:45 Mar 2, 2003 (UTC)
[edit] Examples
I think the use of the "group" in binary tree example unnecessary complicates things. If I didn't know what this is all about I wouldn't have guessed what is meant here. Can someone rewrite this in plain language, like "removing the root splits a binary tree into two subtrees, so accounting for the missing root vertex we have..."
Also, while I am here - the example with enumeration of labeled trees giving Cayley's formula is much more interesting, I say. Mhym 23:14, 22 July 2006 (UTC)