Talk:Faà di Bruno's formula: Difference between revisions

Content deleted Content added

Inline

Revision as of 22:37, 31 October 2009

It would be useful to know more about the Faa di Bruno polynomials. They seem to be known as Faber polynomials although F di B's precedence is assured.

John McKay

129.199.98.69 06:27, 16 July 2007 (UTC)[reply]

Error in "explicite example"

The number of derivative-symbols for f',f, f' seems to be messy. ~~ —Preceding unsigned comment added by Druseltal2005 (talk • contribs) 08:11, 2 November 2007 (UTC)[reply]

Possible conflict of interest

Is the User:Michael Hardy who started this article and has been a prolific contributor to it any relation to the Michael Hardy whose paper in Electronic Journal of Combinatorics is reference [1]? Dewey process (talk) 22:34, 31 October 2009 (UTC)[reply]

Revision as of 22:34, 31 October 2009 edit Dewey process (talk \| contribs) 19 edits →Possible conflict of interest: new section ← Previous edit		Revision as of 22:37, 31 October 2009 edit undo Dewey process (talk \| contribs) 19 edits m →Possible conflict of interest: typo Next edit →
Line 13:		Line 13:
	== Possible conflict of interest ==		== Possible conflict of interest ==

	Is the [[User:Michael Hardy]] who started this article and has been a prolific contributor to it any relation to the Michael Hardy whose paper in [[~~Eletronic~~ Journal of Combinatorics]] is reference [1]? [[User:Dewey process\|Dewey process]] ([[User talk:Dewey process\|talk]]) 22:34, 31 October 2009 (UTC)		Is the [[User:Michael Hardy]] who started this article and has been a prolific contributor to it any relation to the Michael Hardy whose paper in [[Electronic Journal of Combinatorics]] is reference [1]? [[User:Dewey process\|Dewey process]] ([[User talk:Dewey process\|talk]]) 22:34, 31 October 2009 (UTC)