Difference between revisions of "Math 450: Combinatorics"
From MathWiki
(→Textbooks) |
(→Additional topics) |
||
| Line 34: | Line 34: | ||
=== Additional topics === | === Additional topics === | ||
| + | Possibly Ramsey theory | ||
=== Courses for which this course is prerequisite === | === Courses for which this course is prerequisite === | ||
[[Category:Courses|450]] | [[Category:Courses|450]] | ||
Revision as of 08:55, 1 November 2010
Contents
Catalog Information
Title
Combinatorics.
(Credit Hours:Lecture Hours:Lab Hours)
(3:3:0)
Offered
Su
Prerequisite
Description
Permutations, combinations, recurrence relations, applications. Students will learn the basics of combinatorics and its relation to the other areas of mathematics, including algebra and analysis.
Desired Learning Outcomes
Prerequisites
Minimal learning outcomes
Permutations and combinations basics, including the Pigeonhole Principle, binomial coefficients and the Binomial Theorem, Stirling's Approximation, Inclusion/exclusion, Generating functions and recurrence relations (rational functions), Groups, permutations and counting problems -- Polya's Theorem
Textbooks
Possible textbooks for this course include (but are not limited to):
- Richard A. Brualdi, Introductory Combinatorics (5th Edition), Prentice Hall, 2010.
- Chapters 5-9 of Alan Tucker's Applied Combinatorics, John Wiley & Sons, Inc., 2002.
- Chapters 1-4 of Russell Merris' Combinatorics, 2nd edition, John Wiley & Sons, Inc., 2003.
Additional topics
Possibly Ramsey theory
