Polya Counting Theory: Combinatorics for Computer Science

The beautiful mathematical counting theory due originally to George P lya is developed and extended in this unit of study. We discuss many extensions of the classical results of P lya and address problems of actually constructing systems of distinct representatives under the constraints of symmetry. We focus on mathematical concepts as well as on the vizualization of algorithms through the use of graphical and pictorial methods.