This paper provides a detailed decomposition of irreducible characters of certain wreath products into irreducible components, connecting these to the structure of symmetric groups and their basic sets, with explicit formulas involving Littlewood-Richardson coefficients.
Contribution
It offers a new explicit decomposition formula for restrictions of irreducible characters to wreath products, enhancing understanding of symmetric group characters and their basic sets.
Findings
01
Decomposition of characters into irreducibles using Littlewood-Richardson coefficients
02
Connection between wreath product restrictions and symmetric group basic sets
03
Explicit formulas for p-regular element restrictions
Abstract
In this paper, we give the decomposition into irreducible characters of the restriction to the wreath product Zp−1≀Sw of any irreducible character of (Zp⋊Zp−1)≀Sw, where p is any odd prime, w≥0 is an integer, and Zp and Zp−1 denote the cyclic groups of order p and p−1 respectively. This answers the question of how to decompose the restrictions to p-regular elements of irreducible characters of the symmetric group Sn in the Z-basis corresponding to the p-basic set of Sn described by Brunat and Gramain in [1]. The result is given in terms of the Littlewood-Richardson coefficients for the symmetric group.
\widetilde{\psi_{r}^{k}}(f;\,\pi)=\left\{\begin{array}[]{cl}(p-1)^{c(\pi)}&\mbox{if $g_{\nu}(f;\,\pi)=1$ for all $1\leq\nu\leq c(\pi)$},\\
0&\mbox{otherwise}.\end{array}\right.
\widetilde{\psi_{r}^{k}}(f;\,\pi)=\left\{\begin{array}[]{cl}(p-1)^{c(\pi)}&\mbox{if $g_{\nu}(f;\,\pi)=1$ for all $1\leq\nu\leq c(\pi)$},\\
0&\mbox{otherwise}.\end{array}\right.
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Full text
Restriction of characters to subgroups of wreath products and basic sets for the symmetric group
Jean-Baptiste Gramain
Institute of Mathematics,
University of Aberdeen, King’s College
In this paper, we give the decomposition into irreducible characters of the restriction to the wreath product Zp−1≀Sw of any irreducible character of (Zp⋊Zp−1)≀Sw, where p is any odd prime, w≥0 is an integer, and Zp and Zp−1 denote the cyclic groups of order p and p−1 respectively. This answers the question of how to decompose the restrictions to p-regular elements of irreducible characters of the symmetric group Sn in the Z-basis corresponding to the p-basic set of Sn described by Brunat and Gramain in [1]. The result is given in terms of the Littlewood-Richardson coefficients for the symmetric group.
2010 Mathematics Subject Classification:
Primary 20C30, 20C15; Secondary 20C20
1. Introduction
Let G be a finite group and Irr(G) be the set of irreducible complex characters of G. Let p be a prime (dividing ∣G∣), and let C be the set of p-regular elements of G. For each χ∈CIrr(G), we define a class function χC of G by letting
[TABLE]
One of the fundamental results of Brauer’s Theory is the existence of a surjective homomorphism, called the decomposition homomorphism,
[TABLE]
where IBrp(G) is the set of irreducible (p-modular) Brauer characters of G. The matrix D of d in the bases Irr(G) and IBrp(G) is the (p-modular) decomposition matrix of G. Up to reordering the rows and columns, the matrix D is diagonal by blocks, which gives partitions of Irr(G) and IBrp(G) into p-blocks.
While finding the decomposition matrix of a group is a very difficult problem, basic sets can sometimes help computing Brauer characters and/or the decomposition matrix D, or at least reduce the problem. We call p-basic set for G any subset B⊂Irr(G) such that the family BC={χC,χ∈B} is a Z-basis for the Z-module generated by IrrC(G)={χC,χ∈Irr(G)}. In particular, ∣B∣ is the number of p-regular conjugacy classes of G. One can also define the notion of p-basic set for a p-block of G, and one shows easily that, if each p-block b of G has a p-basic set Bb, then the union of the Bb’s is a p-basic set for G.
If B is a p-basic set for G, and if we write χC=ψ∈B∑nχψ⋅ψC (χ∈Irr(G),nχψ∈Z) and NB=((nχψ))χ∈Irr(G),ψ∈B, and DB for the (square) sub-matrix of D whose rows correspond to B, then we have D=NBDB, so that computing the matrix NB reduces the problem of finding D to computing (the smaller matrix) DB.
In [1], the authors describe, for any integer n and odd prime p, a p-basic set B for the symmetric group Sn. The object of the present paper is, in this case, to describe completely the matrix NB. It should be noted that another p-basic set for Sn was previously known (see [3, Section 6.3]), but that B has further properties which allow it to restrict to a p-basic set for the alternating group An.
Throughout this paper, we let n≥1 be any integer, and p be an odd prime. The irreducible complex characters of the symmetric group Sn are canonically labelled by partitions of n, and we write Irr(Sn)={χλ∣λ⊢n}. For any λ⊢n, we write n=∣λ∣, the size of λ. The distribution of irreducible characters of Sn into p-blocks is described by the Nakayama Conjecture (see [3, 6.1.21]). Each partition λ of n is completely and uniquely determined by its p-coreγp(λ) and its p-quotient qp(λ). The p-core γp(λ) is the partition, of some integer s, obtained by removing from λ all the hooks of length divisible by p, and the p-quotient qp(λ) is a p-tuple (λ1,λ2,…,λp) of partitions whose sizes add up to the integer w (written (λ1,λ2,…,λp)⊩w), called the p-weight of λ, and such that n=s+pw. Then two characters χλ,χμ∈Irr(Sn) belong to the same p-block of Sn if and only if γp(λ)=γp(μ). In particular, if that is the case, then λ and μ have the same p-weight, and characters in the p-block of Sn corresponding to the p-core γ⊢s are labelled by the p-tuples of partitions (ν1,ν2,…,νp)⊩w, where w=(n−s)/p, and the p-block is said to have p-weight w.
In [1], the authors show that {χλ∈Irr(Sn)∣qp(λ)=(λ1,…,λp)\mboxwithλr=∅} is a p-basic set for Sn, where r=2p+1. To prove this, they construct, for each w≥0, a generalized perfect isometry between the set of irreducible characters of a p-block b of p-weight w and the set of irreducible characters of the wreath product (Zp⋊Zp−1)≀Sw, where Zp and Zp−1 denote the cyclic groups of order p and p−1 respectively. The irreducible characters of (Zp⋊Zp−1)≀Sw can be parametrized by the p-tuples ν=(ν1,…,νp)⊩w of partitions of w (see Section 3), in such a way that a character has the subgroup Zpw of (Zp⋊Zp−1)≀Sw=Zpw⋊(Zp−1≀Sw) in its kernel if and only if it is labelled by ν=(ν1,…,νp)⊩w such that νr=∅. We write Irr((Zp⋊Zp−1)≀Sw)={χν∣ν⊩w}. We also let Bb={χλ∈Irr(b)∣qp(λ)=(λ1,…,λp)\mboxwithλr=∅} be the p-basic set for b constructed in [1]. The results of [1] show that there is an explicit bijection χλ⟼χλ~ from Irr(b) to itself, which restricts to the identity on Bb, as well as explicitly determined signs {ε(λ),χλ∈Irr(b)} such that, if we write χλC=χμ∈Bb∑nλμ⋅χμC (χλ∈Irr(b),nλμ∈Z), then the coefficients nλμ (χλ∈Irr(b),χμ∈Bb) are given by
[TABLE]
Note that, by construction, for any χμ∈Bb, we have qp(μ~)=(ν1,…,νp) with νr=∅. Thus χqp(μ~) has Zpw in its kernel, and ResZp−1≀Sw(Zp⋊Zp−1)≀Sw(χqp(μ~)) is actually an irreducible character of Zp−1≀Sw. Hence, in order to decompose any restriction to p-regular elements of an irreducible character of Sn as a Z-linear combination of the restrictions of characters in the basic set B, it is sufficient to compute the decomposition into irreducible characters of Zp−1≀Sw of any irreducible character of (Zp⋊Zp−1)≀Sw. This decomposition is given by our main result, Theorem 5.1.
The paper is organised as follows. In Section 2, we recall classical results about the conjugacy classes and irreducible complex characters of wreath products. These results are then applied to the groups (Zp⋊Zp−1)≀Sw and Zp−1≀Sw in Section 3, and the irreducible characters of these groups are parametrized in ways that are compatible (see Theorem 3.3). In Section 4, we describe the characters of (Zp⋊Zp−1)≀Sw induced by some specific characters of Zp−1≀Sw. These particular cases form the basis for the computations of Section 5, where we explicitly decompose into irreducibles the induction to (Zp⋊Zp−1)≀Sw of any irreducible character of Zp−1≀Sw (see Theorem 5.1). This in turn provides a formula for any of the scalar products appearing in Equation (1).
2. Conjugacy classes and irreducible characters of wreath products
Throughout this section, we let N be a finite group and w≥1 be an integer, and consider the wreath product N≀Sw. That is, N≀Sw is the semidirect product Nw⋊Sw, where Sw acts by permutation on the w copies
of N. For a complete description of wreath products and their representations,
we refer to [3, Chapter 4].
Let s be the number of conjugacy classes of N, and let g1,…,gs be
representatives for the conjugacy classes of N. Then the conjugacy classes of N≀Sw can be parametrized by the
s-tuples of partitions of w as follows. The elements of
N≀Sw are of the form (h;σ)=((h1,…,hw);σ), with h1,…,hw∈N and σ∈Sw. For any such element, write σ=σ1∗⋯∗σc(σ), a product of disjoint cycles. Then, for any 1≤ν≤c(σ), we have σν=(jν,jνσν,…,jνσνkν−1) (where σν is a kν-cycle), and we define the ν-th cycle product of
(h;σ) by
[TABLE]
In particular, gν(h;σ)∈N. We then we form s partitions (π1,…,πs) as follows: each 1≤ν≤c(σ) gives a cycle of length kν in πi if the cycle product gν(h;σ) is conjugate to gi in N. The resulting s-tuple
of partitions of w describes the cycle structure of (h;σ), and two elements of N≀Sw are conjugate if and only if they
have the same cycle structure.
The irreducible complex characters of N≀Sw can also be
parametrized by the s-tuples of partitions of w as follows. Let Irr(N)={ω1,…,ωs}. Take any α=(α1,…,αs)⊩w and consider
the irreducible character ∏i=1sωi∣αi∣ of the
base groupNw. It can be extended in a natural way to its
inertia subgroup N≀S∣α1∣×⋯×N≀S∣αs∣, giving the irreducible character ∏i=1sωi∣αi∣. For each 1≤i≤s, the irreducible character ωi∣αi∣ of N≀S∣αi∣ is given as follows: if (f;π)∈N≀S∣αi∣ has cycle products gν(f;π) (1≤ν≤c(π)), then ωi∣αi∣(f;π)=∏ν=1c(π)ωi(gν(f;π)) (see [3, Lemma 4.3.9]). Any
extension of ∏i=1sωi∣αi∣ to N≀S∣α1∣×⋯×N≀S∣αs∣ is of the form Ωα=∏i=1s(ωi∣αi∣⊗Υαi), where, for each 1≤i≤s, Υαi∈CIrr(N≀S∣αi∣) is defined by Υαi(f;π)=χαi(f;π) for all (f;π)∈N≀S∣αi∣ (and χαi∈Irr(S∣αi∣), see [3, 4.3.15]). Then ℵα:=Ind∏i=1sN≀S∣αi∣N≀Sw(Ωα)∈Irr(N≀Sw). Different α⊩w
give different irreducible characters of N≀Sw, and any irreducible
character of N≀Sw can be obtained in this way (see [3, Theorem 4.3.34]).
3. Parametrizations of Irr((Zp⋊Zp−1)≀Sw) and Irr(Zp−1≀Sw)
From now on, and throughout the paper, we fix an odd prime p, and we let r=2p+1. We write I for the set {1,2,…,p}∖{r}. We let H=Zp−1 and G=Zp⋊Zp−1, and, for any integer k≥1, we let Hk=H≀Sk and Gk=G≀Sk.
We start by describing the irreducible characters of G and their restrictions to H. The irreducible complex characters of G are described as follows. We have Irr(G)={ψ1,…,ψp}, with ψi(1)=1 for i∈I,
and ψr(1)=p−1. More precisely, writing η1=1Zp for the
trivial character of Zp, we have
[TABLE]
and
[TABLE]
where {η2,…,ηp}=Irr(Zp)∖{1Zp}.
Now write Irr(H)={θi∣i∈I}={θ1=1H,θ2,…,θr−1,θr+1,…,θp}. For any i∈I, ψi has Zp◃G in its kernel. Thus, without loss of generality, we can choose the labelling such that ψi=θi∘ϖ, where ϖ:G=Zp⋊Zp−1⟶Zp−1=H is the canonical surjection. In particular,
[TABLE]
To describe ResHG(ψr), we start by noticing that ψr(g)=0 for all g∈G∖Zp. Indeed, by the first orthogonality relation, we have
[TABLE]
Since also g∈G∑ψr(g)ψr(g)=∣G∣=p(p−1), this yields
[TABLE]
so that ψr(g)=0 for all g∈G∖Zp. Since ψr(1)=p−1, this gives
[TABLE]
where δ1 is the indicator function of (the conjugacy class in H of) 1. Now, by the second orthogonality relation, we have, for any h∈H
[TABLE]
Hence
[TABLE]
If we now take any integer w≥1, then the irreducible complex characters of Gw and Hw are constructed as in Section 2.
The irreducible complex characters of Gw=G≀Sw are
parametrized by the p-tuples of partitions of w as follows. For
any α=(α1,…,αp)⊩w, χα∈Irr(Gw) is given by
[TABLE]
where, for any 1≤i≤p and (f;π)∈G∣αi∣ with cycle products gν(f;π) (1≤ν≤c(π)), we have ψi∣αi∣(f;π)=∏ν=1c(π)ψi(gν(f;π)) and φαi(f;π)=χαi(π).
Note for future reference that, in the above notation, if
αr=∅, then Zpw⊆ker(χα). Indeed, for all 1≤i≤p, i=r,
we have ResZpG(ψi)=1Zp; thus
ResZp∣αi∣G∣αi∣(ψi∣αi∣)=1Zp∣αi∣, so that
ψi∣αi∣(g)=ψi∣αi∣(1)
for all g∈Zp∣αi∣,
and (ψi∣αi∣⊗φαi)(g)=(ψi∣αi∣⊗φαi)(1) for all g∈Zp∣αi∣. Since
Zpw≤Gw◃G≀Sw, we easily get that, for all g∈Zpw, χα(g)=χα(1). In particular, if
αr=∅, then χα=ξ∘ϖ for some ξ∈Irr(Hw), where ϖ:Gw=(Zp)w⋊(Zp−1≀Sw)⟶Zp−1≀Sw=Hw is the canonical surjection.
The irreducible complex characters of Hw=H≀Sw are
parametrized by the (p−1)-tuples of partitions of w as follows. For
any α=(α1,…,αr−1,αr+1,…,αp)⊩w, ξα∈Irr(Hw) is given by
[TABLE]
where, for any i∈I and (f;π)∈H∣αi∣ with cycle products gν(f;π) (1≤ν≤c(π)), we have θi∣αi∣(f;π)=∏ν=1c(π)θi(gν(f;π)) and ζαi(f;π)=χαi(π).
The following result will be useful when we next consider the restriction to Hw of some irreducible characters of Gw.
Lemma 3.1**.**
For any integer k≥1, i∈I and λ⊢k, we have
[TABLE]
Proof.
Take any (f;π)∈Hk (i.e. (f;π)=(1,(f;π))∈Zpk⋊Hk=Gk, where f∈Hk and π∈Sk), and let gν(f;π) (1≤ν≤c(π)) be the cycle products of (f;π). Note that, for all 1≤ν≤c(π), gν(f;π)∈H (as a product of elements of H). Since, by (2), ResHG(ψi)=θi, this yields
[TABLE]
as claimed. The second part is immediate, as, for any (f;π)∈Hk, we have φλ(f;π)=χλ(π)=ζλ(f;π).
We can now show how our parametrizations for Irr(Gw) and Irr(Hw) are related.
Theorem 3.3**.**
Take any (α1,…,αr−1,∅,αr+1,…αp)⊩w.
If we let α=(α1,…,αr−1,αr+1,…αp) and α^=(α1,…,αr−1,∅,αr+1,…αp), then we have
[TABLE]
Proof.
Let α=(α1,…,αr−1,αr+1,…αp) and α^=(α1,…,αr−1,∅,αr+1,…αp) be as above. Then
[TABLE]
where Ψα=i∈I∏ψi∣αi∣⊗φαi.
Let σ1,…,σm be left coset representatives for the Young subgroup ∏i∈IS∣αi∣ of Sw. In particular, (1;σ1),…,(1;σm) are also left coset representatives for ∏i∈IH∣αi∣ in Hw, and for ∏i∈IG∣αi∣ in Gw (where, in the first instance, (1;σi)=(1H;σi) for 1≤i≤m and, in the second, (1;σi)=(1G;σi) for 1≤i≤m). Since it will always be clear which group we are working in, we will denote all these coset representatives as σ1,…,σm.
By the formula for character induction, for all g∈Hw, we have
[TABLE]
where
[TABLE]
Now, if g=(f;ρ)∈Gw (with f∈Hw≤Gw), then, for all 1≤k≤m, we have (see [3, 4.2.6]),
[TABLE]
where, if f=((1,f1),(1,f2),…,(1,fw))∈Gw (with (f1,…,fw)∈Hw), then fσk=((1,fσk−1(1)),(1,fσk−1(2)),…,(1,fσk−1(w))). In particular, fσk∈Hw, and σkgσk−1=(fσk;σkρσk−1)∈Hw. Hence, for all 1≤k≤m, we have σkgσk−1∈i∈I∏G∣αi∣ if and only if σkgσk−1∈i∈I∏H∣αi∣. If that is the case, then we can write σkgσk−1=∏i∈I(gi;ρi), where (gi;ρi)∈H∣αi∣ for all i∈I, and, still in that case, we obtain
[TABLE]
We therefore have, for any 1≤k≤m,
[TABLE]
Since σ1,…,σm are also left coset representatives for ∏i∈IH∣αi∣ in Hw, we get, for all g∈Hw,
[TABLE]
as claimed.
∎
Remark 3.4**.**
In view of the observation we made when parametrizing the irreducible characters of Gw, the statement of Theorem 3.3 can be rephrased as: if χ∈Irr(Gw) is labelled by (α1,…,αr−1,∅,αr+1,…αp), then χ=ξ∘ϖ, where ξ∈Irr(Hw) is labelled by (α1,…,αr−1,αr+1,…αp) and ϖ:Gw⟶Hw is the canonical surjection.
4. Induction of some special characters
In this section, we fix any integer k≥1, and we will describe the induced characters IndHkGk(θik⊗ζα) for i∈I and α⊢k (see Theorem 4.5). We start by some results on multiplicities.
Lemma 4.1**.**
For any i∈I, the multiplicity of the irreducible character θik in ResHkGk(ψrk) is 1.
Proof.
Take any i∈I, and let Ai,r be the multiplicity of θik in ResHkGk(ψrk). Then
[TABLE]
And, whenever (f;π)∈Hk is such that gν(f;π)=1 for all 1≤ν≤c(π), we have
[TABLE]
Hence
[TABLE]
where, for any π∈Sk, G(π)={f∈Hk∣gν(f;π)=1\mboxforall1≤ν≤c(π)}.
Now, if we write π=π1∗⋯∗πc(π), a product of disjoint cycles, we see that f∈G(π) if and only if, after reordering the “coordinates” of f according to the cycles of π, f is of the form (f1,…,fc(π)), where each fν is a ∣πν∣-tuple of elements of (the abelian group) H whose product is gν(f,π)=1. So, for each 1≤ν≤c(π), we can choose the first ∣πν∣−1 coordinates of fν to be anything we want in H, and the last coordinate is imposed by the condition gν(f,π)=1. This means that, for each 1≤ν≤c(π), we have (p−1)∣πν∣−1 choices for fν, so that
For any i∈I and any partitions α and β of k, the multiplicity of the irreducible character θik⊗ζα in ResHkGk(ψrk⊗φβ) is δα,β.
Proof.
Take any i∈I and any partitions α and β of k, and let Bi,r,α,β be the multiplicity of θik⊗ζα in ResHkGk(ψrk⊗φβ). Then
[TABLE]
as claimed.
∎
To prove our next result on multiplicities, we will use the following, which is an easy corollary of Mackey’s Theorem (see [2, Theorem (5.6)]) and Frobenius Reciprocity.
Theorem 4.3** (Mackey).**
Let K,H≤G be finite groups, and x1,…,xm be representatives for the (H,K)-double cosets in G (i.e. G=Hx1K∪˙⋯∪˙HxmK). Then, for any class functions S and T of H and K respectively, we have
[TABLE]
where the class function
Sxi of Hxi=xi−1Hxi is defined by Sxi(u)=S(xiuxi−1) for all u∈Hxi (1≤i≤m).
We can now prove the following
Theorem 4.4**.**
For any i∈I, any 0≤j≤k, and any α⊢k, β⊢j and γ⊢k−j, we have
[TABLE]
the Littlewood-Richardson coefficient for the symmetric group Sk (see [3, Theorem 2.8.13]).
Remark: in the above statement, and in the rest of the paper, we denote some tensor products by ⊠ instead of ⊗ to emphasize the fact that they are outer tensor products.
Proof.
We start by noticing that, if j=0 or j=k, then Gj×Gk−j=Gk. For any α,β,γ⊢k, we let, in a natural way, c∅,γα=δα,γ and cβ,∅α=δα,β. Then, if j=0, the claim becomes
[TABLE]
which is true for any α,γ⊢k by Theorem 3.3 and Frobenius Reciprocity. If, on the other hand, j=k, then the claim becomes
[TABLE]
which is true for any α,β⊢k by Lemma 4.2 and Frobenius Reciprocity.
From now on, we therefore fix any 0<j<k. Take any α⊢k, β⊢j and γ⊢k−j, and let
[TABLE]
We will apply Theorem 4.3 to the groups G=Gk, H=Hk and K=Gj×Gk−j. Since Hk contains (a copy of) Sk, which itself contains representatives for the left cosets of Gj×Gk−j in Gk (which are the same as representatives for the left cosets of Sj×Sk−j in Sk), there is a single (Hk,Gj×Gk−j)-double coset in Gk. Thus we have Gk=Hk⋅(Gj×Gk−j) and, with the notations of Theorem 4.3, m=1 and x1=1. Also, Hk1∩(Gj×Gk−j)=Hk∩(Gj×Gk−j)=Hj×Hk−j. Hence, by Theorem 4.3, we have
[TABLE]
Now, for any (f;π)∈Hj×Hk−j, we can write (f;π)=(f(j);π(j))⊗(f(k−j);π(k−j)) in such a way that
[TABLE]
(we only have to be careful, when seeing π=π(j)∗π(k−j) as an element of Sj×Sk−j, that Sj and
Sk−j do act on the indices we want).
This shows that
[TABLE]
Now, by the Littlewood-Richardson Rule (see [3, Theorem 2.8.13]), we have
[TABLE]
Since ⟨ResHj×Hj−kHk(ζα),ζμ⊠ζν⟩Hj×Hk−j=⟨ResSj×Sk−jSk(χα),χμ⊠χν⟩Sj×Sk−j and ζα(1)=χα(1), this easily gives
We can now finally state and prove the main result of this section.
Theorem 4.5**.**
For any i∈I, any integer k≥1 and α⊢k, we have
[TABLE]
Proof.
Since the characters appearing on the right-hand side are pairwise distinct irreducible characters of Gk, Theorem 4.4 shows that all we have to prove is that the left-hand side and right-hand side characters have the same degree.
For the left-hand side, we easily see that
[TABLE]
Now, for any 0≤j≤k and any β⊢j and γ⊢k−j, we have
[TABLE]
We therefore obtain, for the right-hand side,
[TABLE]
(since pk=((p−1)+1)k=j=0∑k(jk)⋅(p−1)j). This concludes the proof.
∎
5. Main result
We can now state and prove our main result (Theorem 5.1). Take any positive integer w. Recall that the coefficients we wish to find are the multiplicities of the irreducible characters of Hw in the restriction to Hw of any irreducible character of Gw. Equivalently, we want to decompose into irreducibles of Gw the induced character IndHwGw(ξ) of any ξ∈Irr(Hw). Hence we take any α=(α1,…,αr−1,αr+1,…,αp)⊩w, and consider ξα∈Irr(Hw). Recall that ξα is given by
[TABLE]
or, letting Hα=∏i∈IH∣αi∣ and Θα=∏i∈Iθi∣αi∣⊗ζαi, by ξα=IndHαHw(Θα).
Starting from Θα∈Irr(Hα), instead of going right around the above diagram to compute IndHwGw(IndHαHw(Θα)), we will go left to compute (the same character) IndGαGw(IndHαGα(Θα)). Now, since H∣αi∣≤G∣αi∣ for all i∈I, we have
where c(βi,i∈I)γr=⟨χγr,Ind∏i∈ISjiS∣J∣(∏i∈Iχβi)⟩S∣J∣ is the coefficient obtained by iterating the Littlewood-Richardson Rule.
We therefore obtain
[TABLE]
whence
[TABLE]
Finally, this yields
[TABLE]
which is the decomposition of IndHwGw(ξα) into irreducible characters of Gw. Note that each irreducible χ(γ1,…,γp) appears (with multiplicity) several times, corresponding to the choice of the βi’s (i∈I). This can now be rewritten as
Theorem 5.1**.**
For any integer w>0 and α=(α1,…,αr−1,αr+1,…,αp)⊩w, we have
[TABLE]
where, for any γ=(γ1,…,γp)⊩w,
[TABLE]
In particular, kα,γ=0 unless ∣γi∣≤∣αi∣ for all i∈I.
Remark 5.2**.**
We recover from Theorem 5.1 the fact that our basic set {χγ∈Irr(Gw)∣γr=∅} corresponds to Irr(Hw) (see Theorem 3.3 and Remark 3.4). Indeed, for ξα to appear in ResHwGw(χγ), we must have ∣αi∣≥∣γi∣ for all i∈I. But, if γr=∅, then we already have i∈I∑∣γi∣=i=1∑p∣γi∣=w=i∈I∑∣αi∣, so that we can only have ∣αi∣=∣γi∣ for all i∈I. We then get kα,γ=(i∈I∏c∅,γiαi)⋅c(∅,…,∅)∅=i∈I∏δαi,γi, so that kα,γ=δα^,γ (with the notation of Theorem 3.3).
Bibliography4
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[1] O. Brunat and J. Gramain. A basic set for the alternating group. J. Reine Angew. Math. , 641:177–202, 2010.
2[2] I. Isaacs. Character theory of finite groups . Academic Press [Harcourt Brace Jovanovich Publishers], New York, 1976. Pure and Applied Mathematics, No. 69.
3[3] G. James and A. Kerber. The representation theory of the symmetric group , volume 16 of Encyclopedia of Mathematics and its Applications . Addison-Wesley Publishing Co., Reading, Mass., 1981.
4[4] I. Stein. The Littlewood-Richardson rule for wreath products with symmetric groups and the quiver of the category F ≀ 𝐅𝐈 n ≀ 𝐹 subscript 𝐅𝐈 𝑛 F\wr{\bf FI}_{n} . Comm. Algebra , 45(5):2105–2126, 2017.