### Metroplex Math Circle

Shared publicly -We are pleased to announce that the first topic of our 2013-2014 Metroplex Math Circle will be Pólya-Burnside Enumeration in Combinatorics, presented by our own Adithya Ganesh on September 14, 2013.

Burnside’s lemma from group theory has a broad scope of application in combinatorial enumeration problems. Pólya’s enumeration theorem, which generalizes Burnside’s lemma using generating functions, provides a remarkable framework to easily solve counting problems in which we want to regard two entities as equivalent under some symmetry.

Burnside’s lemma from group theory has a broad scope of application in combinatorial enumeration problems. Pólya’s enumeration theorem, which generalizes Burnside’s lemma using generating functions, provides a remarkable framework to easily solve counting problems in which we want to regard two entities as equivalent under some symmetry.

Pólya-Burnside Enumeration in Combinatorics — Adithya Ganesh

Sat, September 14, 2013, 2:00 PM CDT

The University of Texas at Dallas1

Add a comment...