Polya Counting Theory: Combinatorics for Computer Science - Softcover

Williamson, S. Gill

 
9781481100892: Polya Counting Theory: Combinatorics for Computer Science

Synopsis

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.

"synopsis" may belong to another edition of this title.