we cover a number of combinatorial objects which will be beneficial to the study of the cyclic sieving phenomenon--a recent combinatorial field of research first introduced by reiner, stanton and white. by introducing the study of dyck paths, set partitions, and q-analogues, we will study simple examples of how groups exhibit the cyclic sieving phenomenon. we will conclude this week's presentation with a buildup to an open conjecture and our current research program progress.