---
title: Symmetric-Group Character Expansion
url: https://www.emergentmind.com/topics/symmetric-group-character-expansion
type: topic
---

# Symmetric-Group Character Expansion

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 [2503.17552]. 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 \(p_\rho\) is the power-sum symmetric function [1912.08576]. This realizes class functions on \(S_n\) as coefficients in power-sum-to-Schur expansions.

The classical combinatorial engine for such expansions is the Murnaghan–Nakayama rule. For a cycle type \(\mu=(\mu_1,\dots,\mu_r)\vdash n\), one has
\[
p_\mu=\sum_{\lambda\vdash n}\chi^\lambda(\mu)\,s_\lambda,
\]
and \(\chi^\lambda(\mu)\) is computed as a signed sum over ribbon tableaux of shape \(\lambda\) and type \(\mu\) [2503.17552]. 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 \(\{\chi^\lambda\}\).

A useful consequence is that any class function \(f\) on \(S_n\) admits an expansion
\[
f=\sum_{\lambda\vdash n} a_\lambda\,\chi^\lambda,
\]
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
\[
J_i=\sum_{1\le j<i}(j\,i).
\]
These commuting elements generate a maximal commutative subalgebra of \(\mathbb{C}[S_n]\), and symmetric functions in \(J_1,\dots,J_n\) lie in the center \(Z_n\). The fundamental theorem quoted by Lassalle states that if \(\lambda\vdash n\), then
\[
f(J_1,\dots,J_n)\cdot \chi^\lambda=f(A_\lambda)\,\chi^\lambda,
\]
where \(A_\lambda\) is the alphabet of contents of \(\lambda\) [1005.2346].

Writing
\[
f(J_1,\dots,J_n)=\sum_{\mu\vdash n} a_\mu(n)\,C_\mu
\]
in the basis of class sums \(C_\mu\), one obtains the central-character expansion identity
\[
f(A_\lambda)=\sum_{\mu\vdash n} a_\mu(n)\,\theta^\lambda_\mu,
\]
where \(\theta^\lambda_\mu\) is the central character of \(C_\mu\) on \(S^\lambda\) [1005.2346]. This makes the coefficients \(a_\mu(n)\) 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, \(e_k(J_1,\dots,J_n)\) is the sum of all permutations with exactly \(n-k\) cycles, while one-row Hall–Littlewood functions \(P_{(k)}(x;t)\) interpolate between power sums and complete symmetric functions through
\[
P_{(k)}(x;0)=h_k(x),\qquad P_{(k)}(x;1)=p_k(x)
\]
and admit class expansions with coefficients determined by explicit recurrences [1005.2346]. Leading terms are governed by Catalan and Narayana polynomials. In this sense, central symmetric-group character expansion is simultaneously a class expansion in \(\mathbb{C}[S_n]\), 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 \(\mu\), let \(\Xi_\mu\) be the multiset of eigenvalues of its permutation matrix. Then there exists an inhomogeneous symmetric-function basis \(\{\tilde s_\lambda\}\) such that
\[
\tilde s_\lambda[\Xi_\mu]=\chi^{(n-|\lambda|,\lambda)}(\mu)
\]
for \(n\) sufficiently large [1510.00438]. This is the irreducible character basis. Its top homogeneous component is \(s_\lambda\), but lower-degree terms encode stability in the first row direction.

The same framework introduces the induced trivial character basis \(\{\tilde h_\lambda\}\), defined recursively from multiset partitions by
\[
h_\lambda=\sum_{\pi}\tilde h_{m(\pi)},
\]
and satisfying evaluation formulas for induced trivial characters of Young subgroups [1510.00438]. These bases are related by stable Kostka-type transition matrices, and the product structure in the irreducible basis is governed by stable Kronecker coefficients:
\[
\tilde s_\lambda\cdot \tilde s_\mu=\sum_\nu \overline g^\nu_{\lambda,\mu}\,\tilde s_\nu
\]
[1510.00438].

The Hopf-algebraic refinement of this theory gives explicit product and coproduct rules for \(\tilde s_\lambda\), \(\tilde h_\lambda\), and \(\tilde x_\lambda\), together with inhomogeneous power-sum analogues \(\mathbf p_\gamma\) and \(\overline{\mathbf p}_\gamma\) [1901.00378]. In particular, \(\tilde h_\lambda\) has coproduct
\[
\Delta(\tilde h_\lambda)=\sum_{\alpha+\beta=\lambda}\tilde h_\alpha\otimes \tilde h_\beta,
\]
while \(\tilde x_\lambda\) 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
\[
I=(i_1,\dots,i_k),\qquad J=(j_1,\dots,j_k)
\]
with distinct entries, define
\[
[I,J]:=\sum_{w(I)=J} w\in\mathbb{C}[\mathfrak{S}_n],
\]
where the sum ranges over all permutations \(w\) satisfying \(w(i_p)=j_p\) for \(p=1,\dots,k\) [2503.17552]. The element \([I,J]\) is the group-algebra avatar of the indicator statistic for the event \(w(I)=J\), and these elements span the space of \(k\)-local statistics.

The key novelty is that \([I,J]\) is not central. The associated directed graph \(G(I,J)\) has edges \(i_p\to j_p\), and every connected component is either a directed cycle or a directed path. This yields a cycle type \(v\) and a path type \(\mu\), with
\[
|\mu|+|v|=n,\qquad |\mu|-\ell(\mu)+|v|=k
\]
[2503.17552]. The atomic symmetric function attached to \((I,J)\) factorizes as
\[
A_{n,I,J}=p_\mu\cdot p_v,
\]
where \(p_v\) is the ordinary power-sum symmetric function and \(p_\mu\) is a new path power sum [2503.17552].

The path part is governed by a path Murnaghan–Nakayama rule:
\[
p_\mu = m(\mu)!\sum_\lambda \operatorname{MN}_\lambda^\mu\, s_\lambda,
\]
where \(\operatorname{MN}_\lambda^\mu\) 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
\[
\chi^\lambda([I,J])=m(\mu)!\sum_{\tau\vdash n-|v|}\operatorname{MN}_\tau^\mu\,\chi^{\lambda/\tau}(v)
\]
[2503.17552]. This converts a priori \((n-k)!\)-term sums into finite combinatorial expressions driven by path/cycle structure.

The same work shows that
\[
A_{n,I,J}=\sum_{\lambda\vdash n}\chi^\lambda([I,J])\,s_\lambda,
\]
so the desired character values are exactly the Schur coefficients. It also proves a support restriction:
\[
c_\lambda=0\quad\text{unless}\quad \lambda_1\ge n-k
\]
in the Schur expansion of \(A_{n,I,J}\), making the noncentral character expansion sparse [2503.17552]. For fixed \(k\), once \(n\ge 2k\), 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 \(B_n\cong C_2\wr S_n\), Lübeck–Prasad’s identity, reproved combinatorially and generalized by Adin–Roichman, states that for \(\Lambda\in\mathrm{Par}_2(2n)\) and \(\mu\vdash n\),
\[
\psi^\Lambda(\mu,\varnothing)=\varepsilon_2(\Lambda)\,\chi^\Lambda(2\mu),
\]
and more generally, for \(C_r\wr S_n\),
\[
\psi^{\boldsymbol\lambda}(\mu,\varnothing,\dots,\varnothing)=\mathrm{sign}_r(\Lambda)\,\chi^\Lambda(r\mu)
\]
[2107.11899]. Here \(\Lambda=\Phi_r(\boldsymbol\lambda)\) has empty \(r\)-core, and the sign \(\mathrm{sign}_r(\Lambda)\) is determined combinatorially by row-color sequences and \(r\)-inversions.

A complementary direction is the base-change construction between \(B_n\) and \(S_{2n}\) or \(S_{2n+1}\). There is an injective map
\[
BC:\operatorname{Irr}(B_n)\hookrightarrow \operatorname{Irr}(S_{2n})\ \text{or}\ \operatorname{Irr}(S_{2n+1})
\]
defined by 2-core and 2-quotient, together with a norm map \(Nm\) on even-cycle conjugacy classes, such that
\[
\Theta(BC(\pi))(w)=\epsilon(BC(\pi))\,\Theta(\pi)(Nm(w))
\]
for \(w\) a product of disjoint even cycles with at most one fixed point [1912.08576]. In particular,
\[
\Theta(BC(\pi))(w_0)=\epsilon(BC(\pi))\,\dim\pi
\]
for the fixed-point-free involution \(w_0\). This identifies the nonvanishing characters at \(w_0\) as precisely those in the image of base change.

At the block-theoretic level, Evseev constructs a canonical isometry between the principal block of \(S_{pw}\) and that of \(S_p\wr S_w\), and proves a general theorem expressing virtual characters of wreath products in terms of induced characters from subgroups of the form \(L\wr S_{w_1}\times\cdots\times L\wr S_{w_s}\) [1208.2380]. 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 \(p\)-local subgroups.

## 6. Generalized, asymptotic, and exceptional directions

The notion extends beyond ordinary class functions. For the unbalanced Gelfand pair
\[
(S_n\times S_{n-1},\mathrm{diag}\,S_{n-1}),
\]
the generalized characters
\[
\phi_{\lambda,\mu}(g)=\frac{1}{|S_{n-1}|}\sum_{h\in S_{n-1}}\chi^\lambda(gh)\,\chi^\mu(h)
\]
form an orthogonal basis for \(S_{n-1}\)-conjugacy invariant functions. Scarabotti proves a generalized Stanley–Féray–Śniady formula
\[
\phi_{\lambda,\mu}(\theta)=(n-1)^{\ell-1}\sum_{\gamma\sigma=\theta}\mathrm{sign}(\gamma)\,\mathcal N_{\lambda,\mu}(\gamma,\sigma),
\]
an expansion over factorizations and admissible cycle colorings [1103.1041]. This is a character-expansion theory for a noncentral commutative algebra intermediate between class functions and arbitrary functions on \(S_n\).

A second asymptotic direction fixes the conjugacy class and varies the Young diagram. Stanley character polynomials express normalized characters \(\Ch_\pi(\lambda)\) on multirectangular Young diagrams \(p\times q\) as explicit polynomials in the Stanley coordinates. For a rectangle,
\[
\Ch_\pi(p\times q)=\sum_{\sigma_1\sigma_2=\pi}(-1)^{\sigma_1}\,q^{\kappa(\sigma_1)}p^{\kappa(\sigma_2)},
\]
and for multirectangular diagrams there is the Stanley character formula summing over factorizations and colorings of cycle sets [1409.7533]. 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 \(S_n\) that extends the branching theorem to cycle types without fixed points, providing an alternative to Murnaghan–Nakayama [1712.08023]. On the analytic side, Larsen–Shalev’s earlier \(2^{k-1}k!\) bound is sharpened to the exact bound
\[
|\chi(g)|\le k!
\]
when \(g\in S_n\) has \(k\) cycles, with the refined bound
\[
|\chi(g)|\le (k-1)!
\]
when \(g\) has a fixed point; both are sharp [2411.08265]. This gives uniform control of character values in the fixed-cycle-number regime and passes to unipotent characters of \(SL_n(q)\) at regular semisimple elements with \(k\) irreducible factors.

Special symmetric-function identities also generate unusual character expansions. Westrem proves
\[
\sum_{\tilde\lambda\in Ev(\lambda)}(-1)^{\ell(\tilde\lambda)}p_{\tilde\lambda}
=2^{\ell(\lambda)}\prod_i m_{\lambda_i\lambda_i},
\]
which implies vanishing of certain alternating sums of \(\Sigma_{2n}\)-characters indexed by \(Ev(\lambda)\) when \(\mu_1>n\) [2410.04644]. 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 \(f^\lambda\) over partitions with three parts of the same parity [2509.02796]. 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 \([I,J]\); 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.

Source: https://www.emergentmind.com/topics/symmetric-group-character-expansion