Combinatorial Analysis

4 Credits.

Counting techniques: generating functions, recurrence relations, Polya’s theorem. Combinatorial designs: Latin squares, finite geometries, balanced incomplete block designs. Emphasis on problem solving. Recommended Course Background: AS.553.291 or AS.110.201Students who have received credit for AS.110.106 and/or AS.110.107 taken prior to Fall 2020 should contact the course instructor to determine whether they can receive permission to register for this course.