Difference between revisions of "Combinatorics"
(→Student Guides to Combinatorics) |
(→See also) |
||
| Line 13: | Line 13: | ||
* Undergraduate | * Undergraduate | ||
** ''Generatingfunctionology'' by Herbert S. Wilf. Free fulltext download here: [http://www.math.upenn.edu/~wilf/DownldGF.html] | ** ''Generatingfunctionology'' by Herbert S. Wilf. Free fulltext download here: [http://www.math.upenn.edu/~wilf/DownldGF.html] | ||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
Revision as of 21:34, 8 February 2016
Combinatorics is the study of discrete structures in general, and enumeration on discrete structures in particular. For example, the number of three-cycles in a given graph is a combinatoric problem, as is the derivation of a non-recursive formula for the Fibonacci numbers, and so too methods of solving the Rubiks cube. Different kinds of counting problems can be approached by a variety of techniques, such as generating functions or the principle of inclusion-exclusion.
Resources
Listed below are various combinatorics resources including books, classes, and websites.
