Joint student colloquium
Cameron Williams, Pure Mathematics & Cameron Marcott, Combinatorics Optimization, University of Waterloo
"Cameron and Cameron Present the Cyclic Sieving Phenomena with Cameron and Cameron "
We show how basic representation theory can be used to count the fixed points of a set under the action of a cyclic group. This basic representation theory has deep combinatorial applications only recently described as the "cyclic sieving phenomena".