Cyclic Sieving Phenomenon: Foundations & Applications

• Cyclic Sieving Phenomenon (CSP) is a structural correspondence that links fixed-point counts from cyclic group actions to the evaluation of q-analogue generating functions at roots of unity.
• It leverages combinatorial statistics, such as Mahonian and Eulerian indices, to expose underlying orbit structures and symmetry in finite sets.
• CSP offers practical methods in enumerative combinatorics to prove fixed-point identities and classify orbit structures, guiding both theoretical and computational approaches.

The Cyclic Sieving Phenomenon (CSP) is a structural correspondence that connects the fixed-point data of a cyclic group action on a finite set with the evaluation of a polynomial, typically a $q$-analogue, at roots of unity. Formally, for a finite set $X$, a cyclic action $c$ of order $n$ on $X$, and a statistic $\stat: X \to \mathbb N$ with generating function $X(q) = \sum_{x \in X} q^{\stat(x)}$, the triple $(X, X(q), c)$ exhibits the CSP if $X(\omega^d) = |\{ x \in X : c^d(x) = x \}|$ for all integers $d$, where $X$0 is a fixed primitive $X$1th root of unity (Adams et al., 2024).

1. Formal Definition and Foundational Principles

The defining feature of CSP is the exact match between the number of fixed points under powers of a cyclic operator and the evaluation of a generating function at corresponding roots of unity: $X$2 This phenomenon provides a unified mechanism to encode orbit- and symmetry-structure using $X$3-enumerative polynomials, such as Mahonian, Eulerian, or various $X$4-Catalan and Gaussian binomial polynomials, across a broad range of combinatorial settings (Adams et al., 2024).

2. Classification and Key Classes of Maps and Statistics

CSP has been verified for specific classes of actions and statistics, often stratified by orbit structure or involutive properties.

2.1 Equal-Orbit-Size Actions

If every $X$5-orbit in $X$6 has the same size $X$7, then any statistic with generating function $X$8 satisfying $X$9 and $c$0 for $c$1 yields the CSP.

Class	Order of $c$2	Statistic family/Generating function	CSP Status
Mahonian (maj, inv)	$c$3	$c$4	Verified
Rank	$c$5	$c$6	Verified
"Entry" statistics	$c$7 (rot)	$c$8	Verified
Toric promotion	$c$9	See below	Verified

2.2 Involutive Actions (Orbit size $n$0)

Many involutive actions, such as reverse and complement, yield all orbits of size two. For such cases, CSP reduces to showing $n$1 for the corresponding statistic generating function (Adams et al., 2024).

2.3 Involutions with Large Fixed Sets

Maps such as Corteel’s involution or the invert-Laguerre-heap map have $n$2 fixed points; others such as the Alexandersson–Kebede map have $n$3 fixed points. CSP holds by matching $n$4 with the fixed-point enumeration.

2.4 Conjugation by the Long Cycle

This map acts with orbits of sizes dividing $n$5 and underpins CSP for Eulerian-type polynomials and Mahonian linear combinations (Adams et al., 2024).

3. Representative Families and Generating Functions

Multiple statistics and polynomials are universally linked to CSP under various cyclic operators.

• Mahonian statistics: Major index (maj), number of inversions (inv), and related statistics (Denert, sorting index, etc.) with generating function $n$6 under any action with all orbits of size $n$7.
• Permutation structure statistics: Number of cycles, left/right-to-left maxima/minima, etc., with $n$8.
• Pattern and inversion counts: Specific statistics on inversion distance or consecutive patterns, some verified for all $n$9, others for only odd or even $X$0.
• Eulerian polynomials: Shareshian–Wachs Eulerian statistic, with $X$1, under conjugation.

Simultaneously, variants and refinements—such as the number of entries with certain local order statistics, or cycle-descent–based enumerations—are realized as CSP-polynomial/statistic correspondences (Adams et al., 2024).

4. Algorithmic and Computational Methodology

The systematic approach adopted involves:

• Extraction of maps and statistics (24 maps, 400 statistics) from FindStat via SageMath.
• For each $X$2, computing the orbit-structure of $X$3 on $X$4 for $X$5 and corresponding evaluations $X$6.
• Declaring “apparent CSP” when enumerative and polynomial data coincide for all divisors $X$7 of the order.
• Distinguishing provable instances (34 CSPs) from conjectural cases (3 CSPs; e.g., inversions at distance $X$8 for even $X$9; Coxeter-length difference under Simion–Schmidt map) (Adams et al., 2024).

Proof Techniques

• Evaluation of $\stat: X \to \mathbb N$0-factorials, Eulerian, and related polynomials at roots of unity.
• Orbit-decomposition and involutive parity-pairing arguments to derive values of $\stat: X \to \mathbb N$1 in fixed-point computations.
• Explicit generating function factorizations for statistics.

5. Detailed Description of Key Maps

This table summarizes principal maps for which CSP is systematically realized or analyzed (Adams et al., 2024):

Map Class	Description and Properties
Reverse $\stat: X \to \mathbb N$2 / Complement $\stat: X \to \mathbb N$3	Involutive, zero fixed points; $\stat: X \to \mathbb N$4
Rotation $\stat: X \to \mathbb N$5	Cyclic of order $\stat: X \to \mathbb N$6, all orbits size $\stat: X \to \mathbb N$7
Toric Promotion	On path graph, order $\stat: X \to \mathbb N$8, all orbits size $\stat: X \to \mathbb N$9
Lehmer-Code Rotation	On Lehmer codes, order $X(q) = \sum_{x \in X} q^{\stat(x)}$0
Corteel Map / Invert-Laguerre-Heap	Involution, $X(q) = \sum_{x \in X} q^{\stat(x)}$1 fixed points
Alexandersson–Kebede Map	Involution, $X(q) = \sum_{x \in X} q^{\stat(x)}$2 fixed points
Long Cycle Conjugation	Orbits of sizes dividing $X(q) = \sum_{x \in X} q^{\stat(x)}$3, deep rep. th.

Many of these maps admit explicit combinatorial or representation-theoretic constructions for their fixed-point sets and the corresponding statistic generating polynomials.

6. Classification and Orbit-Structure Theorems

A key structural theorem states: If all orbits of a cyclic map $X(q) = \sum_{x \in X} q^{\stat(x)}$4 have common size $X(q) = \sum_{x \in X} q^{\stat(x)}$5, and $X(q) = \sum_{x \in X} q^{\stat(x)}$6 is a polynomial with $X(q) = \sum_{x \in X} q^{\stat(x)}$7 and vanishing at all nontrivial $X(q) = \sum_{x \in X} q^{\stat(x)}$8th roots, then $X(q) = \sum_{x \in X} q^{\stat(x)}$9 is a CSP instance. For involutions with no fixed points (orbit size 2) and $(X, X(q), c)$0, CSP is immediate. When involutions have $(X, X(q), c)$1 or $(X, X(q), c)$2 fixed points, CSP holds provided $(X, X(q), c)$3 matches these cardinalities (Adams et al., 2024).

Conjugation actions with non-uniform orbit sizes rely on factorization formulas and character-theoretic results for associated permutation or fake-degree polynomials.

7. Significance, Contrasts with Homomesy, and Open Questions

An important outcome is that CSP is not inherently linked with homomesy: actions with the CSP (e.g., Corteel and invert-Laguerre maps) can be "homomesy-poor," while some homomesic actions are "CSP-poor" (e.g., Lehmer-code rotation). This distinction highlights that the algebraic and enumerative synchrony of CSP is more subtle and specialized than mere average-statistic invariance.

Unresolved conjectures include:

• CSP for inversions of distance $(X, X(q), c)$4 under reverse/complement for even $(X, X(q), c)$5.
• Coxeter-length difference under the Simion–Schmidt map (under Corteel and invert-Laguerre maps).
• Weak-exceedance midpoints under the same maps for $(X, X(q), c)$6.

Further exploration is suggested regarding CSP for pattern-replacing involutions, maps with orbit sizes varying in parity, and the connection between combinatorial, algebraic, and orbit-theoretic invariants in systematic enumeration (Adams et al., 2024).

---

References:

• "Cyclic sieving on permutations -- an analysis of maps and statistics in the FindStat database" (Adams et al., 2024)