Combinatorics

3 credits · Undergraduate

Elements of enumerative analysis including permutations, combinations, generating functions, recurrence relations, the principle of inclusion and exclusion, and Polya's theorem. Some special topics will be treated as class interest and background indicate (e.g., Galois fields, theory of codes, and block designs). Students unfamiliar with permutations, combinations, and basic counting techniques should take 3700 prior to 4700. Prerequisite: 2501, 2600, or all of 2100, 2300, and 2410. [3] (MNS)