Symmetric-Group Character Expansion

• Symmetric-group character expansion is the process of expressing structured Sₙ functions or group-algebra elements in an irreducible-character basis using explicit combinatorial formulas.
• Central expansions leverage Jucys–Murphy elements and classic rules like the Murnaghan–Nakayama rule to connect power-sum symmetric functions with irreducible character evaluations.
• Advanced frameworks extend these ideas to stable, noncentral, and comparative settings, linking symmetric-group characters to representations of wreath products and hyperoctahedral groups.

Searching arXiv for the cited papers to ground the article in current literature. Symmetric-group character expansion is the problem of expressing structured functions or group-algebra elements associated with $\mathfrak{S}_n$ in an irreducible-character basis, or, equivalently, in closely related symmetric-function bases. In the formulation of "Partial permutations and character evaluations," it means: given a structured element of the group algebra of $\mathfrak{S}_n$, express its action (or its image under irreducible characters) in a combinatorial way that is both explicit and efficient (Hamaker et al., 21 Mar 2025). In the broader literature, this theme includes classical class-function expansions by Frobenius and Murnaghan–Nakayama, central expansions via Jucys–Murphy elements, stable symmetric-function bases encoding irreducible characters, noncentral expansions for partial permutations, and character correspondences linking $\mathfrak{S}_n$ to wreath products, hyperoctahedral groups, and related Gelfand-pair constructions.

1. Classical character-theoretic framework

Irreducible complex representations of $S_n$ are indexed by partitions $\lambda\vdash n$, and the corresponding irreducible characters are constant on conjugacy classes, hence determined by cycle type. In symmetric-function language, the Frobenius character formula identifies the Schur function $s_\lambda$ with the character $\Theta_\lambda$ through

$$s_\lambda=\sum_{\rho\vdash m}\frac{\Theta_\lambda(c_\rho)}{|Z(c_\rho)|}\,p_\rho,$$

where $c_\rho$ is the conjugacy class of cycle type $\rho$ and $\mathfrak{S}_n$0 is the power-sum symmetric function (Lübeck et al., 2019). This realizes class functions on $\mathfrak{S}_n$1 as coefficients in power-sum-to-Schur expansions.

The classical combinatorial engine for such expansions is the Murnaghan–Nakayama rule. For a cycle type $\mathfrak{S}_n$2, one has

$\mathfrak{S}_n$3

and $\mathfrak{S}_n$4 is computed as a signed sum over ribbon tableaux of shape $\mathfrak{S}_n$5 and type $\mathfrak{S}_n$6 (Hamaker et al., 21 Mar 2025). In this setting, symmetric-group character expansion is fundamentally an expansion of class functions, or of central group-algebra elements such as class sums, into the irreducible basis $\mathfrak{S}_n$7.

A useful consequence is that any class function $\mathfrak{S}_n$8 on $\mathfrak{S}_n$9 admits an expansion

$\mathfrak{S}_n$0

with coefficients obtained from orthogonality. This classical picture is the reference point for later generalizations: the key difficulty in modern work is to retain comparably explicit formulas when the object being expanded is no longer central.

2. Central expansions via Jucys–Murphy elements

A major branch of symmetric-group character expansion concerns central elements obtained from symmetric functions in the Jucys–Murphy elements

$\mathfrak{S}_n$1

These commuting elements generate a maximal commutative subalgebra of $\mathfrak{S}_n$2, and symmetric functions in $\mathfrak{S}_n$3 lie in the center $\mathfrak{S}_n$4. The fundamental theorem quoted by Lassalle states that if $\mathfrak{S}_n$5, then

$\mathfrak{S}_n$6

where $\mathfrak{S}_n$7 is the alphabet of contents of $\mathfrak{S}_n$8 (Lassalle, 2010).

Writing

$\mathfrak{S}_n$9

in the basis of class sums $S_n$0, one obtains the central-character expansion identity

$S_n$1

where $S_n$2 is the central character of $S_n$3 on $S_n$4 (Lassalle, 2010). This makes the coefficients $S_n$5 the precise bridge between symmetric functions of Jucys–Murphy elements and symmetric-group character data.

The resulting class expansions are explicit for several standard families. For example, $S_n$6 is the sum of all permutations with exactly $S_n$7 cycles, while one-row Hall–Littlewood functions $S_n$8 interpolate between power sums and complete symmetric functions through

$S_n$9

and admit class expansions with coefficients determined by explicit recurrences (Lassalle, 2010). Leading terms are governed by Catalan and Narayana polynomials. In this sense, central symmetric-group character expansion is simultaneously a class expansion in $\lambda\vdash n$0, a content-evaluation formula on partitions, and a shifted-symmetric-function expansion.

3. Symmetric functions as stable character bases

A different viewpoint treats irreducible characters themselves as symmetric functions. For a permutation of cycle type $\lambda\vdash n$1, let $\lambda\vdash n$2 be the multiset of eigenvalues of its permutation matrix. Then there exists an inhomogeneous symmetric-function basis $\lambda\vdash n$3 such that

$\lambda\vdash n$4

for $\lambda\vdash n$5 sufficiently large (Orellana et al., 2015). This is the irreducible character basis. Its top homogeneous component is $\lambda\vdash n$6, but lower-degree terms encode stability in the first row direction.

The same framework introduces the induced trivial character basis $\lambda\vdash n$7, defined recursively from multiset partitions by

$\lambda\vdash n$8

and satisfying evaluation formulas for induced trivial characters of Young subgroups (Orellana et al., 2015). These bases are related by stable Kostka-type transition matrices, and the product structure in the irreducible basis is governed by stable Kronecker coefficients: $\lambda\vdash n$9 (Orellana et al., 2015).

The Hopf-algebraic refinement of this theory gives explicit product and coproduct rules for $s_\lambda$0, $s_\lambda$1, and $s_\lambda$2, together with inhomogeneous power-sum analogues $s_\lambda$3 and $s_\lambda$4 (Orellana et al., 2018). In particular, $s_\lambda$5 has coproduct

$s_\lambda$6

while $s_\lambda$7 has Littlewood–Richardson coproduct. A plausible implication is that symmetric-group character expansion in this stable regime is best regarded as a Hopf-theoretic calculus: multiplication encodes stable tensor products, coproduct encodes restriction, and evaluation at permutation eigenvalues recovers ordinary character values.

4. Noncentral expansions: partial permutations and local statistics

The most explicit recent extension beyond class sums is the theory of partial permutations. For sequences

$s_\lambda$8

with distinct entries, define

$s_\lambda$9

where the sum ranges over all permutations $\Theta_\lambda$0 satisfying $\Theta_\lambda$1 for $\Theta_\lambda$2 (Hamaker et al., 21 Mar 2025). The element $\Theta_\lambda$3 is the group-algebra avatar of the indicator statistic for the event $\Theta_\lambda$4, and these elements span the space of $\Theta_\lambda$5-local statistics.

The key novelty is that $\Theta_\lambda$6 is not central. The associated directed graph $\Theta_\lambda$7 has edges $\Theta_\lambda$8, and every connected component is either a directed cycle or a directed path. This yields a cycle type $\Theta_\lambda$9 and a path type $$s_\lambda=\sum_{\rho\vdash m}\frac{\Theta_\lambda(c_\rho)}{|Z(c_\rho)|}\,p_\rho,$$0, with

$$s_\lambda=\sum_{\rho\vdash m}\frac{\Theta_\lambda(c_\rho)}{|Z(c_\rho)|}\,p_\rho,$$1

(Hamaker et al., 21 Mar 2025). The atomic symmetric function attached to $$s_\lambda=\sum_{\rho\vdash m}\frac{\Theta_\lambda(c_\rho)}{|Z(c_\rho)|}\,p_\rho,$$2 factorizes as

$$s_\lambda=\sum_{\rho\vdash m}\frac{\Theta_\lambda(c_\rho)}{|Z(c_\rho)|}\,p_\rho,$$3

where $$s_\lambda=\sum_{\rho\vdash m}\frac{\Theta_\lambda(c_\rho)}{|Z(c_\rho)|}\,p_\rho,$$4 is the ordinary power-sum symmetric function and $$s_\lambda=\sum_{\rho\vdash m}\frac{\Theta_\lambda(c_\rho)}{|Z(c_\rho)|}\,p_\rho,$$5 is a new path power sum (Hamaker et al., 21 Mar 2025).

The path part is governed by a path Murnaghan–Nakayama rule: $$s_\lambda=\sum_{\rho\vdash m}\frac{\Theta_\lambda(c_\rho)}{|Z(c_\rho)|}\,p_\rho,$$6 where $$s_\lambda=\sum_{\rho\vdash m}\frac{\Theta_\lambda(c_\rho)}{|Z(c_\rho)|}\,p_\rho,$$7 is a signed sum over monotonic ribbon tilings. Combining this with the classical Murnaghan–Nakayama rule for the cycle part yields the hybrid character formula

$$s_\lambda=\sum_{\rho\vdash m}\frac{\Theta_\lambda(c_\rho)}{|Z(c_\rho)|}\,p_\rho,$$8

(Hamaker et al., 21 Mar 2025). This converts a priori $$s_\lambda=\sum_{\rho\vdash m}\frac{\Theta_\lambda(c_\rho)}{|Z(c_\rho)|}\,p_\rho,$$9-term sums into finite combinatorial expressions driven by path/cycle structure.

The same work shows that

$c_\rho$0

so the desired character values are exactly the Schur coefficients. It also proves a support restriction: $c_\rho$1 in the Schur expansion of $c_\rho$2, making the noncentral character expansion sparse (Hamaker et al., 21 Mar 2025). For fixed $c_\rho$3, once $c_\rho$4, the set of monotonic tilings stabilizes and is finite. This suggests that local statistics admit a genuinely stable noncentral character calculus.

5. Wreath products, hyperoctahedral groups, and base change

Another major meaning of symmetric-group character expansion is the expression of characters of other groups in terms of symmetric-group characters, or conversely the expression of special symmetric-group characters in terms of smaller Weyl-group data. For the hyperoctahedral group $c_\rho$5, Lübeck–Prasad’s identity, reproved combinatorially and generalized by Adin–Roichman, states that for $c_\rho$6 and $c_\rho$7,

$c_\rho$8

and more generally, for $c_\rho$9,

$\rho$0

(Adin et al., 2021). Here $\rho$1 has empty $\rho$2-core, and the sign $\rho$3 is determined combinatorially by row-color sequences and $\rho$4-inversions.

A complementary direction is the base-change construction between $\rho$5 and $\rho$6 or $\rho$7. There is an injective map

$\rho$8

defined by 2-core and 2-quotient, together with a norm map $\rho$9 on even-cycle conjugacy classes, such that

$\mathfrak{S}_n$00

for $\mathfrak{S}_n$01 a product of disjoint even cycles with at most one fixed point (Lübeck et al., 2019). In particular,

$\mathfrak{S}_n$02

for the fixed-point-free involution $\mathfrak{S}_n$03. This identifies the nonvanishing characters at $\mathfrak{S}_n$04 as precisely those in the image of base change.

At the block-theoretic level, Evseev constructs a canonical isometry between the principal block of $\mathfrak{S}_n$05 and that of $\mathfrak{S}_n$06, and proves a general theorem expressing virtual characters of wreath products in terms of induced characters from subgroups of the form $\mathfrak{S}_n$07 (Evseev, 2012). A plausible implication is that symmetric-group character expansion also serves as a mechanism for block correspondences: global characters of symmetric groups are matched with wreath-product characters, and the residual terms are controlled by induction from $\mathfrak{S}_n$08-local subgroups.

6. Generalized, asymptotic, and exceptional directions

The notion extends beyond ordinary class functions. For the unbalanced Gelfand pair

$\mathfrak{S}_n$09

the generalized characters

$\mathfrak{S}_n$10

form an orthogonal basis for $\mathfrak{S}_n$11-conjugacy invariant functions. Scarabotti proves a generalized Stanley–Féray–Śniady formula

$\mathfrak{S}_n$12

an expansion over factorizations and admissible cycle colorings (Scarabotti, 2011). This is a character-expansion theory for a noncentral commutative algebra intermediate between class functions and arbitrary functions on $\mathfrak{S}_n$13.

A second asymptotic direction fixes the conjugacy class and varies the Young diagram. Stanley character polynomials express normalized characters $\mathfrak{S}_n$14 on multirectangular Young diagrams $\mathfrak{S}_n$15 as explicit polynomials in the Stanley coordinates. For a rectangle,

$\mathfrak{S}_n$16

and for multirectangular diagrams there is the Stanley character formula summing over factorizations and colorings of cycle sets (Śniady, 2014). These expansions connect normalized characters to free cumulants and Kerov character polynomials.

On the algorithmic side, Holmes gives a recursion formula for irreducible characters of $\mathfrak{S}_n$17 that extends the branching theorem to cycle types without fixed points, providing an alternative to Murnaghan–Nakayama (Holmes, 2017). On the analytic side, Larsen–Shalev’s earlier $\mathfrak{S}_n$18 bound is sharpened to the exact bound

$\mathfrak{S}_n$19

when $\mathfrak{S}_n$20 has $\mathfrak{S}_n$21 cycles, with the refined bound

$\mathfrak{S}_n$22

when $\mathfrak{S}_n$23 has a fixed point; both are sharp (Larsen, 2024). This gives uniform control of character values in the fixed-cycle-number regime and passes to unipotent characters of $\mathfrak{S}_n$24 at regular semisimple elements with $\mathfrak{S}_n$25 irreducible factors.

Special symmetric-function identities also generate unusual character expansions. Westrem proves

$\mathfrak{S}_n$26

which implies vanishing of certain alternating sums of $\mathfrak{S}_n$27-characters indexed by $\mathfrak{S}_n$28 when $\mathfrak{S}_n$29 (Westrem, 2024). A later paper shows that Amdeberhan’s proposed equalities are not true in general, but proves interesting special cases leading to identities for degrees of symmetric-group characters and a new interpretation of Riordan numbers as sums of $\mathfrak{S}_n$30 over partitions with three parts of the same parity (Hemmer et al., 2 Sep 2025). This corrects a possible misconception that structured character-table identities of this type are universally valid.

Symmetric-group character expansion is therefore not a single technique but a family of interlocking formalisms. Its classical form expands class sums in irreducible characters; its central form expands symmetric functions of Jucys–Murphy elements in class sums and central characters; its stable form realizes characters as inhomogeneous symmetric functions; its noncentral form evaluates structured group-algebra elements such as $\mathfrak{S}_n$31; and its comparative form expresses wreath-product, hyperoctahedral, or generalized Gelfand-pair characters through symmetric-group data. The common feature is the replacement of brute-force summation by explicit combinatorics indexed by partitions, ribbons, tableaux, multiset partitions, paths, cycles, or factorization patterns.