Abstract by Shawn Green
Polya Counting for Lattices: An Introduction
Applications of Polya Enumeration will be discussed especially as it relates to 2 or 3 dimensional integer lattices and sublattices. A Consequence of Burnside's Lemma, Polya's Theorem allows for a more detailed enumeration of all symmetrically distinct colorings of the points in a lattice. This enumeration process has an applications in counting the number of symetrically distinct crystal structures.