--- title: 'Thrall’s Higher Lie Characters: Decompositions & Applications' url: https://www.emergentmind.com/topics/thrall-s-higher-lie-characters type: topic --- # Thrall’s Higher Lie Characters: Decompositions & Applications Searching arXiv for recent papers on Thrall’s higher Lie characters and related results. Thrall’s higher Lie characters are the symmetric-group characters, Frobenius characteristics, and \(GL(V)\)-module characters attached to the Poincaré–Birkhoff–Witt decomposition of the tensor algebra through the free Lie algebra. For \(V=\mathbb C^N\), the tensor algebra \(T(V)=\bigoplus_{n\ge 0}V^{\otimes n}\) satisfies \[ T(V)\cong U(L(V))\cong S(L(V))\cong \bigotimes_{n\ge 1} S(L_n(V)), \] where \(L(V)=\bigoplus_{n\ge 1}L_n(V)\) is the free Lie algebra and \(L_n(V)=L(V)\cap V^{\otimes n}\). If \(\lambda=(1^{m_1}2^{m_2}\cdots)\), the higher Lie module is \[ L_\lambda(V)=S^{m_1}(L_1(V))\otimes S^{m_2}(L_2(V))\otimes \cdots, \] and \[ T(V)\cong \bigoplus_{\lambda} L_\lambda(V). \] Thrall’s problem asks for the irreducible decomposition of each \(L_\lambda(V)\), equivalently the Schur expansion of its character. In the symmetric-group formulation, the same objects appear as induced characters from centralizers of permutations of cycle type \(\lambda\), and the literature alternates among the notations \(L_\lambda\), \(\psi^\lambda\), \(v^\lambda\), and \(\lie_\lambda\) for closely related realizations of the same family [2411.04302] [2509.12904] [2508.09898]. ## 1. Classical definition and equivalent realizations The classical higher Lie modules are indexed by partitions \(\lambda=1^{m_1}2^{m_2}\cdots\), with \[ \cL_\lambda(V)\coloneqq \Sym^{m_1}(\cL_1(V))\otimes \Sym^{m_2}(\cL_2(V))\otimes \cdots, \] so that \(T(V)\cong \bigoplus_{\lambda\in\Par}\cL_\lambda(V)\). In this form, Thrall’s problem is to determine the multiplicity of the irreducible polynomial \(GL(V)\)-module \(V^\mu\) inside \(\cL_\lambda(V)\), ideally by a direct combinatorial count [1808.06043]. A parallel representation-theoretic model is formulated in terms of centralizers. For \(\lambda=(1^{m_1}2^{m_2}\cdots)\vdash n\), if \(Z_\lambda\) is the centralizer in \(S_n\) of a permutation of cycle type \(\lambda\), then \[ Z_\lambda \simeq \prod_{i=1}^n S_{m_i}[Z_i]. \] Choosing a primitive irreducible character \(\zeta_i\) of \(Z_i\), one defines \[ \psi^\lambda = \operatorname{Ind}_{Z_\lambda}^{S_n} \left(S_{m_1}[\zeta_1]\otimes S_{m_2}[\zeta_2]\otimes \cdots \otimes S_{m_n}[\zeta_n]\right). \] An equivalent wreath-product recursion is also available: \[ \psi^\lambda = \operatorname{Ind}_{S_{m_1}[S_1]\times S_{m_2}[S_2]\times \cdots}^{S_n} \left( S_{m_1}[\psi^{(1)}]\otimes S_{m_2}[\psi^{(2)}]\otimes \cdots \right). \] In this language, the irreducible multiplicities are \[ c_\nu^\lambda := \langle \psi^\lambda,\chi^\nu\rangle, \] and Thrall’s problem becomes the search for a combinatorial interpretation of \(c_\nu^\lambda\) [2509.12904]. The conjugacy-class model is closely related. If \(C_\lambda\subset S_n\) is the conjugacy class of cycle type \(\lambda\), and \(w_\lambda\) is the product of the primitive linear characters on the cyclic wreath-product factors of \(Z_\lambda\), then \[ v^\lambda := w_\lambda \uparrow^{S_n} \] is a higher Lie character, and the Gessel–Reutenauer theorem identifies the quasisymmetric descent generating function of \(C_\lambda\) with its Frobenius characteristic: \[ Q(C_\lambda)=\operatorname{ch}(v^\lambda). \] This identification is one of the mechanisms by which higher Lie characters enter the combinatorics of descents and conjugacy classes [1909.04460]. ## 2. The single-row case and the classical pillars The case \(\lambda=(n)\), usually written \(L_n\), is the foundational special case. Three classical formulas organize the subject. Klyachko identifies the Schur–Weyl dual of \(L_n\) by \[ Ch(L_n;x)=FrobCh\!\left(\chi^1\uparrow_{C_n}^{S_n}\right). \] Brandt’s formula gives the same character in the power-sum basis: \[ Ch(L_n;x)=\frac1n\sum_{d\mid n}\mu(d)\,p_d(x)^{n/d}. \] Kraskiewicz–Weyman then gives the Schur coefficients by major-index congruences: \[ Ch(L_n;x)=\sum_{\mu\vdash n} a_{\mu,1}s_\mu(x), \qquad a_{\mu,1}=|\{T\in SYT(\mu): maj(T)\equiv_n 1\}|. \] This is the cleanest explicit decomposition presently available in the classical theory and remains the prototype for later extensions [2411.04302]. The same case admits a uniform word-and-necklace interpretation. For the induced cyclic representation \(\chi^r\ind_{C_n}^{S_n}\), \[ \Ch \chi^r\ind_{C_n}^{S_n} = \NFD_{n, r}^{\cont}(\mathbf{x}) = \F_{n, r}^{\cont}(\mathbf{x}) = \M_{n,r}^{\cont}(\mathbf{x}), \] where \(\NFD_{n,r}\) consists of necklaces of length \(n\) with frequency dividing \(r\), \(\F_{n,r}\) consists of words with \(\flex=r\), and \(\M_{n,r}\) consists of words with \(\maj_n=r\). The proof strategy combines a necklace basis for induced cyclic representations, a content-preserving bijection between \(\F_{n,r}\) and \(\NFD_{n,r}\), cyclic sieving to exchange \(\flex\) with \(\maj_n\), and RSK to pass from word generating functions to Schur expansions [1808.06043]. These formulas establish the methodological template for the broader subject. The one-row higher Lie character is simultaneously a free-Lie object, an induced cyclic character, a multiplicity-free power-sum expression, and a tableau-counting problem controlled by major index. Much of the later literature can be read as an attempt to preserve these four features for more general \(\lambda\). ## 3. Higher Lie modules, rectangles, and induced-character structure For general \(\lambda\), one basic reduction is to rectangles. By Littlewood–Richardson theory, it suffices in many constructions to focus on \(\lambda=(a^b)\), since \[ \cL_{(a^b)}(V)=\Sym^b(\cL_{(a)}(V)). \] The Schur–Weyl dual of \(\cL_{(a^b)}\) is \[ \chi_a^1\ind_{C_a \wr S_b}^{S_{ab}}, \] and, more generally, for \(\lambda=1^{b_1}2^{b_2}\cdots\), the dual of \(\cL_\lambda\) is induced from the centralizer \(Z_\lambda\): \[ \chi^{1,1}_\lambda\ind_{Z_\lambda}^{S_n}. \] This makes the higher Lie characters natural examples of induced characters from cyclic or wreath-product centralizers, and it explains why branching rules for \(C_a\wr S_b\hookrightarrow S_{ab}\) are structurally central to Thrall’s problem [1808.06043]. A prime-power deformation sharpens this viewpoint. For each subset \(S\) of the set of primes, the family \(Lie_n^S\) interpolates between the classical Lie representation and the conjugacy action on \(n\)-cycles: \[ Lie_n^\varnothing = Lie_n, \qquad Lie_n^{\mathcal P}=Conj_n. \] The associated series \[ L^S := \sum_{n>1} Lie_n^S \] has symmetric and exterior powers that serve as analogues of Thrall’s higher Lie modules. The central product formula is \[ H[L^S](t) = \prod_{n\in P(S)}(1-t^n p_n)^{-1}, \] which implies that the coefficient of \(t^n\) is a multiplicity-free sum of power sums over partitions whose parts lie in \(P(S)\). More generally, for a nonempty subset \(T\subseteq \mathbb Z_{>0}\), arithmetic Möbius inversion defines \[ f_n^T = \frac1n \sum_{d\mid n} u_T(d)\,p_d^{\,n/d}, \qquad F^T := \sum_{n>1} f_n^T, \] and the higher-Lie-type identity becomes \[ H[F^T] = \prod_{n\in T} (1-p_n)^{-1}. \] In plethystic form, \[ F^T = \sum_{m\in T} Lie[p_m]. \] This generalizes Thrall’s construction from one family of Lie characters to a class of symmetric-function systems governed by chosen sets of allowed part sizes [2107.06389]. ## 4. Tableau formulas and exact solutions for special families Recent work has made the combinatorial side of Thrall’s problem substantially more explicit. For \(\lambda=(\lambda_1,\dots,\lambda_r)\vdash n\), define consecutive blocks \[ B_{\lambda,i}=[\lambda_1+\cdots+\lambda_{i-1}+1,\ \lambda_1+\cdots+\lambda_i]. \] For \(T\in SYT(n)\), the \(i\)-th block descent set and block-major index are \[ Des_{\lambda,i}(T)=\{\, d-(\lambda_1+\cdots+\lambda_{i-1}) : d\in Des(T),\ d,d+1\in B_{\lambda,i}\,\}, \] \[ maj_{\lambda,i}(T)=\sum_{j\in Des_{\lambda,i}(T)}j. \] This leads to \[ SYT_\lambda(\mu) = \left\{T\in SYT(\mu): maj_{\lambda,i}(T)\equiv 1\pmod{\lambda_i}\text{ for all }i\right\}. \] A key lemma identifies these block-major indices with major indices of rectified subtableaux, which makes them compatible with product formulas for higher Lie modules [2605.17880]. When \(\lambda\) has distinct parts, the refined tableau condition already gives the exact Schur coefficients: \[ ch(L_\lambda)=\sum_{\mu\vdash n}|SYT_\lambda(\mu)|\,s_\mu. \] For hook shapes \((n-k,1^k)\) with \(0\le k\le n-2\), \[ ch(L_{(n-k,1^k)}) = \sum_{\mu\vdash n} \left|\{T\in SYT_{(n-k,1^k)}(\mu): Des(T)\subseteq [n-k]\}\right| s_\mu. \] These formulas recover the one-row case and extend it to a broader class of partitions [2605.17880]. The two-row rectangle \(\lambda=(n,n)\) is now solved. For \(\mu\vdash 2n\), define \[ SYT_{(n,n)}^{<}(\mu)=\{T\in SYT_{(n,n)}(\mu): T_{[n]}2\) appearing at most twice now admit explicit tableau models [2605.17880]. ## 5. Super analogues and extensions beyond type \(A\) A super version of Thrall’s problem starts with a super vector space \[ V=V_0\oplus V_1=\mathbb C^N\oplus \mathbb C^M. \] The free Lie superalgebra inside the tensor superalgebra yields a canonical decomposition \[ (V)\cong \bigoplus_A \widetilde{L}_A(V), \] where \(A=(a_{i,j})_{i,j\ge 0}\) is finitely supported with \(a_{0,0}=0\), and \[ \widetilde{L}_A = \bigotimes_{i,j\ge 0}\Gamma_j^{\,a_{i,j}}\big((V)_{i,j}\big), \qquad \Gamma_j(W)= \begin{cases} S(W), & j\text{ even},\\[2pt] \bigwedge(W), & j\text{ odd}. \end{cases} \] The corresponding super Thrall problem asks for the multiplicity of \(V^\lambda\) in \(\widetilde{L}_A\) in the stable limit \(N=M\to\infty\). In this setting, Brandt’s formula, Klyachko’s theorem, and the Kraskiewicz–Weyman major-index formula all admit super analogues [2411.04302]. The combinatorial innovation is the introduction of standard super tableaux \(SYT_\pm(\lambda)\), in which each entry \(i\) appears as either \(i\) or \(\overline{i}\). If \(\mathcal T_+\) is the underlying unbarred tableau, the super descent condition is \[ \big(i\in Des(\mathcal T_+) \text{ and } i+1\notin Neg(\mathcal T)\big) \quad\text{or}\quad \big(i\notin Des(\mathcal T_+) \text{ and } i\in Neg(\mathcal T)\big), \] and the super major index is \[ maj(\mathcal T)=\sum_{i\in Des(\mathcal T)} i. \] This statistic is designed so that principal specializations of super Schur functions become generating functions in \(maj\) and \(neg\), and it is characterized by the super \(q,t\)-hook formula \[ \sum_{\mathcal T\in SYT_\pm(\lambda)} q^{maj(\mathcal T)} t^{neg(\mathcal T)} = [n]_q!\prod_{(r,c)\in \lambda}\frac{q^{r-1}+tq^{c-1}}{[h(r,c)]_q}. \] The multiplicity formula for the basic super Lie piece is \[ \text{mult}_{V^\lambda}(\widetilde{L}_{n,m}) = \left|\left\{\mathcal T\in SYT_\pm(\lambda):\ maj(\mathcal T)\equiv_{n+m}1,\ neg(\mathcal T)=m\right\}\right|. \] This places the super major index in exactly the role occupied by ordinary major index in the classical one-row theory [2411.04302]. Higher Lie characters also extend beyond symmetric groups. In type \(B_n\), for signed cycle type \(\lambda=(\lambda^+,\lambda^-)\), centralizers decompose as products of wreath products built from \(G_{i,+}\cong \mathbb Z_i\times \mathbb Z_2\) and \(G_{i,-}\cong \mathbb Z_{2i}\). Primitive linear characters on these factors define higher Lie characters \(\psi_{B_n}^{\lambda}\), and the \(k\)-th root enumerator satisfies \[ \rho_k^{B_n}=\sum_{\lambda\vdash_k n}\psi_{B_n}^{\lambda}. \] In type \(D_n\), a direct full theory does not always exist, but a restriction-from-\(B_n\) construction is available in the clean cases, and it is sufficient to prove that \(\rho_k^{D_n}\) is a proper character for every integer \(k\) [2312.08904]. ## 6. Applications, asymptotics, and open directions Higher Lie characters now appear in several contexts that are not simply reformulations of the original decomposition problem. For conjugacy classes \(C_\lambda\subset S_n\), the existence of a cyclic descent extension is controlled by hook constituents of the associated higher Lie character. If \[ M_\lambda(x):=\sum_{k=0}^{n-1} m_{k,\lambda}x^k, \qquad m_{k,\lambda}=\bigl(v^\lambda,\chi^{(n-k,1^k)}\bigr), \] then \(M_\lambda(x)\) is divisible by \(1+x\) if and only if \(\lambda\) is not of the form \((r^s)\) for square-free \(r\). Consequently, the descent map on the conjugacy class \(C_\lambda\) has a cyclic extension \((\mathrm{cDes},p)\) if and only if \(\lambda\) is not of the form \((r^s)\) for some square-free integer \(r\). In this application, higher Lie characters serve as the representation-theoretic object from which the decisive hook-multiplicity polynomial is extracted [1909.04460]. They also admit topological realizations. In the peak-algebra setting, if \(E_{n-k}^n\) denotes the peak idempotent, then for \(k\) even, \[ (\Bbb kS_n)E_{n-k}^n \cong \bigoplus_{\substack{|\lambda|=n\\ \odd(\lambda)=n-k}} \lie_\lambda \cong H^{2k}Z_n, \] where \(Z_n\cong \operatorname{Conf}_n(\mathbb{RP}^2\times \mathbb{R})\). Thus peak representations are direct sums of Thrall’s higher Lie characters indexed by the number of odd parts of \(\lambda\), rather than by the number of parts \(\ell(\lambda)\). The corresponding equivariant Hilbert series is \[ \symmbihilb_n(t^2,q) = \sum_{\lambda\vdash n} L_\lambda\, t^{\,n-\odd(\lambda)}q^{\,n-\ell(\lambda)}. \] This gives a cohomological model for a nonclassical organization of the higher Lie characters [2508.09898]. From an asymptotic viewpoint, many higher Lie characters become proportional to the regular character. If \(\psi^\lambda\) is the higher Lie character for \(\lambda\vdash n\), then \[ \dim \psi^\lambda = |C_\lambda| = \frac{n!}{z_\lambda}, \] and “tending to be regular” means that for Plancherel-typical irreducibles \(\chi^\nu\), \[ \langle \psi^\lambda,\chi^\nu\rangle \sim \frac{f^\nu}{z_\lambda}. \] This has been proved for rectangles \((m^k)\) with \(m\to\infty\) and \(k=o(m)\), for distinct-row families satisfying explicit growth conditions, and consequently for hooks \((n-k,1^k)\) with \(k=o(n^{1/4})\). If \(\lambda\) is random with probability \[ \mathbb P(\lambda)=\frac{|C_\lambda|}{n!}, \] equivalently if \(\lambda\) is the cycle type of a uniformly random permutation, then the random higher Lie character tends in probability to be regular [2509.12904]. The general decomposition problem nonetheless remains open. Several papers now isolate its likely structural ingredients: cyclic induction, necklace generating functions, cyclic sieving, RSK, blockwise major-index congruences, and, in higher-rank settings, new statistics such as the proposed \(\mash_a^b\) that would simultaneously preserve content-class equidistribution and depend only on the recording tableau under RSK. This suggests that the unresolved part of Thrall’s problem is not the absence of structure, but the absence of a single combinatorial statistic with the same naturality for general \(\lambda\) that ordinary major index already has for \((n)\) and super major index has for \((n,m)\) in the super setting [1808.06043] [2411.04302]. Source: https://www.emergentmind.com/topics/thrall-s-higher-lie-characters