Talk:Fundamental theorem of combinatorial enumeration
 | This article may be too technical for most readers to understand. (September 2010) |
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. Google reveals very few uses of the phrase "fundamental theorem of combinatorial enumeration", and most of the hits that it does have are derived from Wikipedia itself. The phrase is pretentious. The theorem here 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)
- I agree with Kuperberg, except that I don't know whether or not the article merits merging into another article. All his objections are valid. There is no such thing in enumerative combinatorics as an acknowledged "fundamental theorem". I also found the article to be extraordinarily technical, overspecialized, and obscure. Zaslav (talk) 02:14, 28 May 2011 (UTC)