Difference between revisions of "Combinatorics"
(→Books) |
Flamefoxx99 (talk | contribs) m (→Books) |
||
| Line 13: | Line 13: | ||
* Introductory | * Introductory | ||
** ''the Art of Problem Solving Introduction to Counting and Probability'' by David Patrick [http://www.artofproblemsolving.com/Books/AoPS_B_Item.php?item_id=202 (details)] | ** ''the Art of Problem Solving Introduction to Counting and Probability'' by David Patrick [http://www.artofproblemsolving.com/Books/AoPS_B_Item.php?item_id=202 (details)] | ||
| − | * Intermediate | + | * Intermediate |
** ''the Art of Problem Solving Intermediate Counting and Probability'' by David Patrick [http://www.artofproblemsolving.com/Books/AoPS_B_Item.php?item_id=302 (details)] | ** ''the Art of Problem Solving Intermediate Counting and Probability'' by David Patrick [http://www.artofproblemsolving.com/Books/AoPS_B_Item.php?item_id=302 (details)] | ||
**''Combinatorics:A Guided Tour'' by David R. Mazur.Follow this [http://books.google.co.in/books?id=yI4Jx5Obr08C&pg=PA15&lpg=PA15&dq=overcounting+combinatorics&source=bl&ots=5R05q-YhEq&sig=xLGDWSWSn52t1h2ZVmbzqQ8qhHw&hl=en&sa=X&ei=OwKyT9_2C4qo2wXV1bj-CA&sqi=2#v=onepage&q=overcounting%20combinatorics&f=false (link)] | **''Combinatorics:A Guided Tour'' by David R. Mazur.Follow this [http://books.google.co.in/books?id=yI4Jx5Obr08C&pg=PA15&lpg=PA15&dq=overcounting+combinatorics&source=bl&ots=5R05q-YhEq&sig=xLGDWSWSn52t1h2ZVmbzqQ8qhHw&hl=en&sa=X&ei=OwKyT9_2C4qo2wXV1bj-CA&sqi=2#v=onepage&q=overcounting%20combinatorics&f=false (link)] | ||
| − | * 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 11:00, 3 June 2013
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.
Student Guides to Combinatorics
- Introductory topics in combinatorics
- Intermediate topics in combinatorics
- Olympiad topics in combinatorics
Resources
Listed below are various combinatorics resources including books, classes, and websites.
Books
- Introductory
- the Art of Problem Solving Introduction to Counting and Probability by David Patrick (details)
- Intermediate
- Undergraduate
- Generatingfunctionology by Herbert S. Wilf. Free fulltext download here: [1]
