Jump to content

Talk:Fundamental theorem of combinatorial enumeration

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Greg Kuperberg (talk | contribs) at 17:29, 26 May 2010. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Article is obscure and should be deleted

This article is an unintentional work of obfuscation. The name "fundamental theorem of combinatorial enumeration" is not standard and it could refer to any number of things. The theorem here that has been given that exalted status is a cumbersome and highly formal generalization of some good ideas in combinatorics. It is an unworkable idea for enumerative combinatorics to have a "fundamental theorem"; it is like having a universal solvent in chemistry. While the theorem here has some merit, the entire article should simply be folded into the article on symbolic combinatorics. Greg Kuperberg (talk) 17:29, 26 May 2010 (UTC)[reply]