Listed in: Mathematics and Statistics, as MATH-281
Amanda L. Folsom (Section 01)
This course emphasizes enumerative combinatorics, a classical subject in mathematics related to the theory of counting. Problems in this area often pertain to finding the number of possible arrangements of a set of objects under some particular constraints. This course incorporates a wide set of problems involving enumerative combinatorics, as well as theory and applications. Topics include the sum and product rules, combinations and permutations, binomial and multinomial coefficients, the principle of inclusion and exclusion, generating functions, recurrence relations, Catalan, Stirling, Bell and Eulerian numbers, partitions, tableaux, and stable marriage. Additional topics may vary.
Requisite: MATH 121, and MATH 220 or other prior experience with basic mathematical proof techniques (e.g., induction) by consent of instructor. Limited to 24 students. Fall semester. Professor Folsom.
Section 01
M 02:30 PM - 03:20 PM BEBU 107
W 02:30 PM - 03:20 PM BEBU 107
F 02:30 PM - 03:20 PM BEBU 107
Section 01
Tu 02:30 PM - 03:20 PM SMUD 206
This is preliminary information about books for this course. Please contact your instructor or the Academic Coordinator for the department, before attempting to purchase these books.
| ISBN | Title | Publisher | Author(s) | Comment | Book Store | Price |
|---|---|---|---|---|---|---|
| Combinatorics and Graph Theory | Springer | J.M Harris, J.L. Hirst and M.J. Mossinghoff | We will only cover section 2. Free to download from the Amherst network at SpringerLink https://link.springer.com/book/10.107/978-9-387-79711-3 | TBD |