MTHSC 855: Combinatorial Analysis, 3 cr. (3 and 0) F

Combinations; permutations; permutations with restricted position; Polya's theorem; principle of inclusion and exclusion; partitions; recurrence relations; generating functions; Mobius inversion; enumeration techniques; Ramsey numbers; finite projective and affine geometries; Latin rectangles; orthogonal arrays; block designs; error detecting and error correcting codes.

Prerequisite: MTHSC 311.