Directed Reading Project

Cyclic Sieving Phenomenon and Specht Module

A six-week guided study of cyclic actions, q-analogues, tableaux, and representation theory, centered on how combinatorial symmetry becomes visible through generating functions and Specht modules.

3 to 5 hours per week 1 hour weekly meeting 6-week syllabus

Theme

fixed points under cyclic symmetry

q-polynomials at roots of unity

tableaux, promotion, and characters

Description

This project investigates the cyclic sieving phenomenon (CSP), a striking connection between cyclic group actions, q-analogues, and combinatorics. In its simplest form, CSP asserts that evaluating a q-polynomial at roots of unity counts fixed points under a cyclic symmetry.

We will study how this appears in settings such as rotating lattice paths, promotion on standard Young tableaux, and descent statistics, then interpret these patterns through representation theory using Specht modules for the symmetric group.

The broader goal is to understand why cyclic sieving arises, how tableaux encode permutation structure, and how characters, major index, and q-hook-length formulas fit into a single story.

Learning Goals

  1. Understand the cyclic sieving phenomenon and core examples.
  2. Learn q-binomial coefficients and the q-hook-length formula.
  3. Compute standard Young tableaux, descent sets, and major index.
  4. Explore promotion and cyclic actions on combinatorial objects.
  5. Connect Specht modules, tableaux, and CSP in symmetric group representation theory.

Suggested Rhythm

  • 2 to 3 hours for reading and note-taking
  • 1 to 2 hours for worked examples or short exercises
  • 1 hour weekly meeting for discussion and synthesis

6-Week Study Plan

Each week is designed for a total workload of about 3 to 5 hours, including preparation for the weekly one-hour meeting.

Week 1

CSP from Rotating Objects

State the definition of cyclic sieving and understand one complete example from rotating combinatorial objects.

  • Read Sagan's survey, Sections 1 to 2, and skim the introduction of Reiner-Stanton-White.
  • Verify CSP for 2-subsets of [4] under rotation using the Gaussian binomial coefficient.
  • If time permits, repeat the example for binary words with two 1s.

Outcome: explain the CSP definition and one full example without relying on notes.

Week 2

Tableaux, Descents, and Major Index

Understand how a q-polynomial can be built from a statistic on standard Young tableaux.

  • Read a short section from Sagan or Fulton on Young diagrams and standard Young tableaux.
  • Learn the definitions of descent set and major index.
  • List all SYT of shapes (2,1) and (2,2), then compute Des(T), maj(T), and sum T q^maj(T).

Outcome: explain descent set and major index concretely in small examples.

Week 3

Hook Formulas and q-Hook Formulas

See fλ(q) as a q-analogue of the ordinary tableau count fλ.

  • Read about hook lengths and the ordinary hook-length formula.
  • Skim the q-hook or major-index formula without requiring a full proof.
  • Compute hook lengths and fλ for (3,1), (2,2), and (2,1,1).
  • Compare the q = 1 value of the q-hook expression with the ordinary hook formula.

Outcome: understand the relation between ordinary counting and q-counting for tableaux.

Week 4

Specht Modules Without Too Much Algebra

Understand the slogan that tableaux index bases for irreducible representations of Sn.

  • Read Sagan on tabloids, polytabloids, and Specht modules, focusing on examples more than proofs.
  • Construct the representations indexed by (3), (2,1), and (1,1,1) for S3.
  • Explain why dim Sλ equals the number of SYT of shape λ.

Outcome: describe how Specht modules connect tableaux to symmetric group representation theory.

Week 5

Promotion and Tableau CSP

Explain the rectangular-tableau CSP example concretely through promotion.

  • Read the promotion and CSP section of Sagan's survey and the introduction of Rhoades.
  • Compute promotion orbits for SYT of shape (2,2).
  • Evaluate the major-index polynomial at relevant roots of unity and compare with fixed tableaux.

Outcome: connect promotion, fixed points, and root-of-unity evaluations in one worked example.

Week 6

Why Representation Theory Explains CSP

Connect promotion, fixed points, q-hook or major-index polynomials, and Specht modules in one coherent story.

  • Read light background on characters, traces, and fake degrees from Sagan's survey or Rhoades.
  • Focus on the principle that trace equals fixed points when an operator permutes a basis.
  • Prepare a 5 to 8 minute mini-presentation or 1 to 2 page note on how Specht modules help explain CSP.

Outcome: give a final conceptual map of the project.

References

Primary texts and papers organized by subtopic.

Core References

Reiner, Stanton, White, The Cyclic Sieving Phenomenon , JCTA (2004). Use for the definition of CSP and foundational examples.

Bruce Sagan, The Cyclic Sieving Phenomenon: A Survey (2010). Readable overview with examples and common proof patterns.

Brendon Rhoades, Cyclic Sieving, Promotion, and Representation Theory (2010). Central source for promotion on rectangular SYT and the representation-theoretic explanation.

Bruce Sagan, The Symmetric Group: Representations, Combinatorial Algorithms, and Symmetric Functions , the main book reference for tableaux, Specht modules, and symmetric group representation theory.

Background and Backup References

William Fulton, Young Tableaux , a concise source for Young diagrams, tableaux, Schur functions, and representations of Sn and GLn.

Richard Stanley, Enumerative Combinatorics, Volume 2 for symmetric functions, hook-length formulas, principal specializations, P-partitions, and q-hook formulas.

Gordon James, The Representation Theory of the Symmetric Groups , a more algebraic backup source for tabloids, polytabloids, and Specht modules.

SageMath combinatorics documentation on cyclic sieving for computational experiments with q-binomial coefficients and roots of unity.

Weekly Log

Use this space to draft, submit, and revise a short summary for each week. Entries are saved in your browser on this device.

Selected entry

Week 1 Summary

Not saved yet

LaTeX is supported in the preview below. Use inline math like \(q^n - 1\) or display math like $$\sum_T q^{\mathrm{maj}(T)}$$.

Preview