MATH5705: Enumerative Combinatorics

4 Credits

Basic enumeration, bijections, inclusion-exclusion, recurrence relations, ordinary/exponential generating functions, partitions, Polya theory. Optional topics include trees, asymptotics, listing algorithms, rook theory, involutions, tableaux, permutation statistics. prereq: [2243 or 2373 or 2573], [2263 or 2283 or 2374 or 2574 or 3283]

View on University Catalog

All Instructors

B+ Average (3.189)Most Common: A (46%)

This total also includes data from semesters with unknown instructors.

39 students
SWFDCBA
  • 4.55

    /5

    Recommend
  • 4.69

    /5

    Effort
  • 4.61

    /5

    Understanding
  • 4.40

    /5

    Interesting
  • 4.85

    /5

    Activities


      Contribute on our Github

      Gopher Grades is maintained by Social Coding with data from Summer 2017 to Summer 2024 provided by the Office of Institutional Data and Research

      Privacy Policy