EN.553.671
Combinatorial Analysis
An introduction to combinatorial analysis at the graduate level. Meets concurrently with 553.471. 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: EN.553.291 or AS.110.201
Sources
- Course catalogue ↗2026–2027