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.

Author: S. Gill Williamson
Publisher: Createspace Independent Publishing Platform
Published: 11/29/2012
Pages: 66
Binding Type: Paperback
Weight: 0.39lbs
Size: 11.00h x 8.50w x 0.14d
ISBN: 9781481100892

This title is not returnable