Straightening rule for an m′-truncated polynomial ring
Kay Jin Lim
Division of Mathematical Sciences, Nanyang Technological University, SPMS-PAP-03-01, 21 Nanyang Link, Singapore 637371.
[email protected]
Abstract.
We consider a certain quotient of a polynomial ring categorified by both the isomorphic Green rings of the symmetric groups and Schur algebras generated by the signed Young permutation modules and mixed powers respectively. They have bases parametrised by pairs of partitions whose second partitions are multiples of the odd prime p the characteristic of the underlying field. We provide an explicit formula rewriting a signed Young permutation module (respectively, mixed power) in terms of signed Young permutation modules (respectively, mixed powers) labelled by those pairs of partitions. As a result, for each partition λ, we discovered the number of compositions δ such that δ can be rearranged to λ and whose partial sums of δ are not divisible by p.
2010 Mathematics Subject Classification:
05E05, 20C30, 20G43
Supported by Singapore MOE Tier 2 AcRF MOE2015-T2-2-003.
1. Introduction
The ring of symmetric functions plays an important role in both combinatorics and representation theory of the symmetric groups (see [13, §I.7] and [12]). In the characteristic zero case, the characteristic map gives an isometric isomorphism between the ring of symmetric functions and the Green ring for the symmetric groups where the Schur functions correspond to the Specht modules, the complete and elementary symmetric functions correspond to the trivial and signature representations for the symmetric groups respectively such that multiplication of two symmetric functions corresponds to induction of the outer tensor product of the two respective modules. In the positive characteristic case, the ring of symmetric functions is isomorphic to the Green ring of the symmetric groups generated by Young permutation modules. Let Λ(X),Λ(Y) be two rings of symmetric functions in the sets of independent countably infinite commuting variables X,Y respectively with coefficients in Z. Fix a positive integer m. In this paper, we study a quotient Γ(m), depending on m, of the ring generated by Λ(X) and Λ(Y).
Let k be a field of odd characteristic p. In [4], Donkin showed that the isomorphism classes of indecomposable summands of the signed Young permutation modules
[TABLE]
where (α∣β) is a pair of compositions such that the sizes of α and β sum up to n and k(α),sgn(β) are the trivial and sign kSα- and kSβ-modules respectively, are parametrised by the set Pp2(n) consisting of pairs of partitions of the form (λ∣pμ) such that ∣λ∣+p∣μ∣=n. Furthermore, M(λ∣pμ) has a distinguished indecomposable summand the signed Young module Y(λ∣pμ) with multiplicity one such that any other summand of M(λ∣pμ) is isomorphic to Y(δ∣pξ) for some (δ∣pξ)⊳(λ∣pμ), here, ⊳ is certain dominance order on Pp2(n) (see Subsection 2.3 below). In other words, the Green ring of the symmetric groups generated by signed Young permutation modules, denoted by Y(S), has Z-bases C={[M(λ∣pμ)]:(λ∣pμ)∈Pp2} and {[Y(λ∣pμ)]:(λ∣pμ)∈Pp2} where Pp2=⋃n∈N0Pp2(n).
Let E be the natural module for the Schur algebra S(∞,1). For each pair of compositions (α∣β), the mixed power is defined as
[TABLE]
where SαE=Sα1E⊗⋯⊗SαkE, ⋀βE=⋀β1E⊗⋯⊗⋀βℓE if α=(α1,…,αk) and β=(β1,…,βℓ), and SrE and ⋀rE are the rth symmetric and exterior powers of E respectively. For each (λ∣pμ)∈Pp2, the mixed power Kλ∣pμE has a distinguished indecomposable summand the listing module Listλ∣pμE of multiplicity one such that any other summand of Kλ∣pμE is isomorphic to Listδ∣pξE for some (δ∣pξ)⊳(λ∣pμ). Furthermore, any indecomposable summand of Kα∣βE is isomorphic to a listing module. In other words, the Green ring of the Schur algebras generated by mixed powers, denoted by L(S), has Z-bases D={[Kλ∣pμE]:(λ∣pμ)∈Pp2} and {[Listλ∣pμE]:(λ∣pμ)∈Pp2}. In fact, L(S) is isomorphic to Y(S) induced by the Schur functor where Kα∣βE and Listλ∣pμE are mapped to M(α∣β) and Y(λ∣pμ) respectively.
In the classical case, the class of non-isomorphic direct summands of Young permutation kSn-modules are known as Young modules and are labelled by the set of partitions of n. In the positive characteristic case, determining the multiplicity of a Young module as a direct summand of a Young permutation module is an open problem (see [3, 5, 7, 9, 11]). The numbers are known as the p-Kostka numbers. The signed p-Kostka numbers are generalisation of the p-Kostka numbers which are defined as the multiplicities of signed Young modules as direct summands of signed Young permutation modules (see [6]). Considering writing a signed Young permutation module as Z-linear combination of the signed Young modules in the Green ring Y(S) is an open problem, in this article, we present an explicit formula writing a signed Young permutation module (respectively, a mixed power) in terms of the basis C (respectively, D). The proof relies on the categorification theorem of the quotient ring Γ(p) by both Y(S) and L(S), proved by Donkin in [4]. Along the way, for each partition λ, we discovered the number of compositions δ such that δ can be rearranged to λ and whose partial sums of δ are not divisible by p. These numbers appear, up to signs, as the coefficients in the sum of the sign representations (or the exterior powers) in terms of the basis C (or D).
The article is organised as follows. In the next section, we recall the definitions of symmetric functions, the quotient ring Γ(m), the Green rings Y(S) and L(S). In Section 3, we study some properties of Γ(m). In Section 4, we prove the main result Theorem 4.2 and deduce the formulae for writing a signed Young permutation module and a mixed power in terms of the bases C and D respectively. As a consequence of the formulae, for any pair of compositions (α∣β), we deduce the ‘canonical’ summand of the signed Young permutation module M(α∣β) (respectively, the mixed power Kα∣βE) in Corollary 4.8.
Acknowledgement
The author thank the anonymous referees for their comments and suggestions.
2. Preliminaries
In this section, we fix the notation we shall require throughout in this article and introduce the background material. The standard references are [4, 8, 10, 13].
Let Z be the set of integers, let N be the set of positive integers and let N0 be the set of non-negative integers. For a finite set A, let SA denote the symmetric group acting on the set A. For each n∈N0, let
[TABLE]
and Sn=S[n]. By convention, [0]=∅ and S0 is the trivial group.
Let n∈N0. A composition λ of n is a sequence of positive integers (λ1,…,λr) such that ∑i=1rλi=n. In this case, we write ℓ(λ)=r and ∣λ∣=n. By convention, the unique composition of [math] is denoted as ∅ and ℓ(∅)=0. The set of all compositions of n is denoted by C(n) and we write C=⋃n∈N0C(n). The composition λ is called a partition if λ1≥⋯≥λr. We write P(n) for the set of partitions of n and P=⋃n∈N0P(n) for the set of all partitions. If the parts of a composition δ can be rearranged to a partition λ, we say that δ has type λ. In this case, λ is uniquely determined by δ.
The concatenation of two compositions α and β is the composition
[TABLE]
By convention, \alpha\text{{\tiny#}}\varnothing=\alpha and, similarly, \varnothing\text{{\tiny#}}\beta=\beta. Let m∈N and μ=(μ1,…,μs) be a composition. We write mμ for the composition (mμ1,…,mμs) of m∣μ∣.
The set of all pairs (α∣β) of compositions of n, i.e., α,β are compositions and ∣α∣+∣β∣=n, is denoted by C2(n). We write C2=⋃n∈N0C2(n). Similarly, we write P2(n) for the set of all pairs of partitions of n and P2=⋃n∈N0P2(n). For m∈N, the subset of P2(n) consisting of pairs of the form (λ∣mμ) is denoted by Pm2(n). Furthermore, we write Pm2=⋃n∈N0Pm2(n).
Throughout, k is a field of odd characteristic p.
2.1. Symmetric functions
Let Z[[X]] be the set of formal power series in the set consisting of countably infinite commuting variables X={xi:i∈N} with coefficients in Z such that deg(xi)=1 for all i∈N. For each n∈N, the symmetric group Sn acts on Z[[X]] by permuting the variables x1,…,xn naturally, i.e., for each σ∈Sn and f(X)∈Z[[X]], the element σ⋅f(X) is obtained from f(X) by replacing each xi with xσ(i). The element f(X) is called a symmetric function if it is invariant under the actions Sn for all n∈N.
The set of symmetric functions with degrees bounded above in the set of variables X is denoted by Λ(X). Notice that Λ(X) is a commutative graded ring where Λ(X)=⨁n∈N0Λn(X) and Λn(X) consists of homogeneous symmetric functions of degree n. In the theory of symmetric function, Λ(X) has different Z-bases of special interest. In particular, we are interested in the elementary and complete symmetric functions which we shall now describe.
For any n∈N, the nth elementary symmetric function and the nth complete symmetric function are
[TABLE]
respectively. By convention, let e0(X)=1=h0(X) and hn(X)=0=en(X) if n<0. For each composition α=(α1,…,αr), let
[TABLE]
By convention, e∅(X)=1=h∅(X). Clearly, if α has type λ then eα(X)=eλ(X) and hα(X)=hλ(X). The following results are well-known.
Theorem 2.1** ([13, (2.4, 2.6′, 2.8)]).**
- (i)
The ring of symmetric functions Λ(X) is the polynomial ring in {hn(X):n∈N} and {en(X):n∈N} respectively over Z. Furthermore, the subsets {eλ(X):λ∈P} and {hλ(X):λ∈P} are Z-bases for Λ(X).
2. (ii)
For each d∈N, we have ∑i=0d(−1)ihi(X)ed−i(X)=0.
2.2. An m′-truncated polynomial ring Γ(m)
Let X={xi:i∈N} and Y={yj:j∈N} be two sets of independent countably infinite commuting variables such that deg(xi)=1=deg(yi) for all i∈N. Clearly, Λ(X) and Λ(Y) are graded subrings of Z[[X∪Y]]. Let ⟨Λ(X),Λ(Y)⟩ be the subring of Z[[X∪Y]] generated by Λ(X) and Λ(Y). By Theorem 2.1(i), it is clear that ⟨Λ(X),Λ(Y)⟩ is a polynomial ring in {hi(X),ej(Y):i,j∈N} over Z, has a Z-basis {hλ(X)eμ(Y):(λ∣μ)∈P2} and its nth component has a Z-basis {hλ(X)eμ(Y):(λ∣μ)∈P2(n)}.
Fix a positive integer m. We define the quotient
[TABLE]
where I is the ideal of ⟨Λ(X),Λ(Y)⟩ generated by ∑i=0d(−1)ihi(X)ed−i(Y) for every positive integer d such that m∤d. For each i,j∈N0 and α,β∈C, we denote
[TABLE]
We call Γ(m) the ring of m′-truncated symmetric functions in the variables X∪Y.
Since I is a homogeneous ideal of ⟨Λ(X),Λ(Y)⟩, the ring Γ(m) is graded with the nth component as
[TABLE]
consisting of the Z-linear combinations of the m′-truncated symmetric functions hαeβ such that ∣α∣+∣β∣=n, together with the zero element.
Theorem 2.2** ([4, §4.1(10,11)]).**
The ring Γ(m) is the polynomial ring in {hi,ejm:i,j∈N} and it has a Z-basis
[TABLE]
Furthermore, there is a graded involution ψ:Γ(m)→Γ(m) given by ψ(hi)=ei.
2.3. Signed Young permutation module
The general theory of the representation theory of the symmetric group can be found, for example, in [10].
Let m,n∈N0. We denote Sn+m for the symmetric group acting on the set {i+m:i∈[n]} consisting of permutations of the forms τ+m where τ∈Sn such that, for all i∈[n],
[TABLE]
Furthermore, we identify Sm×Sn with the subgroup SmSn+m of Sm+n. For a given composition α=(α1,…,αr) of n, we denote the Young subgroup of Sn with respect to α by
[TABLE]
For each n∈N0, the set Pp2(n) is partially ordered by the dominance order ⊵ where (λ∣pμ)⊵(δ∣pξ) if
- (a)
i=1∑ℓλi≥i=1∑ℓδi, and
2. (b)
∣λ∣+pi=1∑ℓμi≥∣δ∣+pi=1∑ℓξi,
for all ℓ∈N, where λi is treated as [math] if i>ℓ(λ) and similarly for μi, δi and ξi. In the case when (λ∣pμ)⊵(δ∣pξ) and (λ∣pμ)=(δ∣pξ), we write (λ∣pμ)⊳(δ∣pξ).
Recall that k is a field of odd characteristic p. In this article, we denote ⊗ and ⊠ for the tensor product and outer tensor product of modules over k.
We write k(n) and sgn(n) for the trivial and signature representations for kSn. For a composition α∈C(n), k(α) and sgn(α) are the restrictions of k(n) and sgn(n) respectively to the Young subgroup Sα. Let (α∣β)∈C2(n). We define the signed Young permutation kSn-module M(α∣β) with respect to (α∣β) as
[TABLE]
Following the work of Donkin [4, §2.3], we know that all non-isomorphic indecomposable summands of the signed Young permutation kSn-modules are parametrised by the set Pp2(n). They are called the signed Young kSn-modules and denoted as Y(λ∣pμ) such that, for each (λ∣pμ)∈Pp2(n), Y(λ∣pμ) is a summand of M(λ∣pμ) with multiplicity one and the remaining summands of M(λ∣pμ) are isomorphic to Y(δ∣pθ) for some (δ∣pθ)∈Pp2(n) and (δ∣pθ)⊳(λ∣pμ).
Let G be a group and R(kG) be the Green ring (or representation ring) of kG consisting of formal linear combinations of the isomorphism classes [V] of finite dimensional indecomposable kG-modules V over Z such that [V]=[W] if and only if V≅W, [V]+[W]=[V⊕W] and the (inner) product given by [V]⋅[W]=[V⊗W]. The contragradient dual induces an automorphism on R(kG) since (V⊕W)∗≅V∗⊕W∗ and (V⊗W)∗≅V∗⊗W∗.
For each n∈N0, we have the Green ring R(kSn) where, by convention, R(kS0)≅Z has a Z-basis consisting only the trivial kS0-module. Let V and W be kSm- and kSn-modules respectively. We obtain a kSm+n-module given by IndSm×SnSm+n(V⊠W). It is easily checked that IndSm×SnSm+n(V⊠W)≅IndSn×SmSm+n(W⊠V). Let Rk(S)=⨁n∈N0R(kSn). We define an outer product on Rk(S) by
[TABLE]
and hence [V]×[W]=[W]×[V]. Then Rk(S) forms a ring under the addition and outer product.
Since [M(α∣β)]=[M(λ∣μ)] when α,β have types λ,μ respectively and [M(\alpha|\beta)]\times[M(\gamma|\delta)]=[M(\alpha\text{{\tiny#}}\gamma|\beta\text{{\tiny#}}\delta)], the subset Y(S) of Rk(S) spanned by the isomorphism classes of indecomposable summands of signed Young permutation modules is a graded subring where
[TABLE]
and Y(Sn) is spanned by [M(α∣β)] one for each (α∣β)∈P2(n).
Theorem 2.3** ([4, 2.3(6–8)]).**
Both {[Y(λ∣pμ)]:(λ∣pμ)∈Pp2} and
[TABLE]
are Z-bases for Y(S) and there is a graded involution ϖ:Y(S)→Y(S) defined by ϖ([V])=[V⊗sgn(n)] for each [V]∈Y(Sn).
2.4. Listing module
We refer the reader to [8] for the classical theory of the Schur algebras.
Fix r∈N and let Ω be a set. The symmetric group Sr acts on Ωr by place permutation and hence it induces a diagonal action on the set Ωr×Ωr. The set of orbits of the action of Sr on Ωr×Ωr is denoted by O(Ωr). Let f,g,h∈O(Ωr), (p,q)∈f and
[TABLE]
Let k(Ωr) be the formal vector space over k with a basis {ξf:f∈O(Ωr)} endowed with a multiplication defined as
[TABLE]
Notice that S(n,r)=k([n]r) is the classical Schur algebra. We denote the algebra k(Nr) by S(∞,r). By convention, we set S(∞,0)=kξ0≅k. Furthermore, we denote
[TABLE]
The algebra S(∞) is a bialgebra as follows. Let (i,j)∈Nr×Nr and (p,q)∈Ns×Ns and f,g be the orbits containing them, respectively. We denote the orbit containing (\mathbf{i}\text{{\tiny#}}\mathbf{p},\mathbf{j}\text{{\tiny#}}\mathbf{q})\in\mathbb{N}^{r+s}\times\mathbb{N}^{r+s} as f\text{{\tiny#}}g. Define the comultiplication Δ:S(∞)→S(∞)⊗S(∞) and counit ε:S(∞)→k as
[TABLE]
If V,W are S(∞,r)- and S(∞,s)-modules respectively, then V⊗W is an S(∞,r+s)-module.
Consider the natural S(∞,1)-module E where E is the k-vector space with a basis {ei:i∈N} and the action defined by
[TABLE]
for all j∈N and f∈O(N). For each r∈N, let SrE and ⋀rE be the symmetric and exterior powers of E respectively. By convention, S0E≅k≅⋀0E. For α∈C(n), we set
[TABLE]
so that SαE and ⋀αE are S(∞,n)-modules. For (α∣β)∈C2(n), we define the mixed power the S(∞,n)-module Kα∣βE:=SαE⊗⋀βE. Notice that Kδ∣ξE≅Kα∣βE if α,β have types δ,ξ respectively. Following Donkin [4, §4], the class of non-isomorphic indecomposable summands of mixed powers for S(∞,n) are parametrised by the set Pp2(n). They are called the listing modules denoted by Listλ∣pμE such that, for each (λ∣pμ)∈Pp2(n), Listλ∣pμE is a summand of Kλ∣pμE with multiplicity one and any other summand of Kλ∣pμE are isomorphic to Listδ∣pθE for some (δ∣pθ)∈Pp2(n) and (δ∣pθ)⊳(λ∣pμ). Furthermore, under the Schur functor f, we have f(Kα∣βE)≅M(α∣β) and f(Listλ∣pμE)≅Y(λ∣pμ).
Let L(S) be the graded subring of the representation ring of S(∞) generated by [SnE] and [⋀nE] for every n∈N0 with the gradation
[TABLE]
where L(S(∞,n)) is spanned by the mixed powers [Kα∣βE] such that (α∣β)∈C2(n).
Theorem 2.4**.**
Both {[Listλ∣pμE]:(λ∣pμ)∈Pp2} and
[TABLE]
are Z-bases for L(S). Furthermore, the ring L(S) has a graded involution ω:L(S)→L(S) defined by ω(SnE)=⋀nE.
The following categorification theorem of the rings Y(S) and L(S) is essential throughout this article.
Theorem 2.5** ([4, §4.1(10,13)]).**
We have a commutative diagram
[TABLE]
where the maps f,θ,ϕ are isomorphisms of graded rings where, for each (α∣β)∈C2, f([Kα∣βE])=[M(α∣β)], θ(hαeβ)=[Kα∣βE] and ϕ(hαeβ)=[M(α∣β)].
We end this section with a remark.
Remark 2.6**.**
Let M be the Mullineux map on p-restricted partitions (see, for example, [1, §6]) and let λ(0) be the p-restricted partition such that λ=λ(0)+pξ for some partition ξ (here, λ(0)+pξ has the obvious meaning componentwise summation of partitions). Using Theorem 2.5 and [2, Theorem 3.21], for each (λ∣pμ)∈Pp2, since ϖ([Y(λ∣pμ)])=[Y(M(λ(0))+pμ∣λ−λ(0))], we have
[TABLE]
Similarly, in Γ(p), we have
[TABLE]
where, for each (α∣pβ)∈Pp2, lα∣pβ is the element such that ϕ(lα∣pβ)=[Y(α∣pβ)] and θ(lα∣pβ)=[Listα∣pβE] (see [4, §4.1]).
3. The ring Γ(m)
Throughout this section, we fix m∈N. We derive some properties about the graded ring Γ(m). Recall that Γ(m) is the quotient ring ⟨Λ(X),Λ(Y)⟩/I where X={xi:i∈N}, Y={yj:j∈N} and I is the ideal generated by ∑i=0d(−1)ihi(X)ed−i(Y) for every d∈N such that m∤d. Furthermore, Γ(m) is the polynomial ring on {hi,ejm:i,j∈N} where hn=hn(X)+I and en=en(Y)+I, and it has a Z-basis
[TABLE]
We begin with a lemma.
Lemma 3.1**.**
- (i)
For each d∈N, ed is a Z-linear combination of hλesm for some partitions λ and s∈N0 such that ∣λ∣+sm=d.
2. (ii)
Let
[TABLE]
Then, for each d≥1, we have ed=det(aij)1≤i,j≤d.
3. (iii)
If we set xi=yi for each i∈N then I=0 and Γ(m)=Λ(X) where hλ=hλ(X) and eμ=eμ(X).
Proof.
The proof of part (i) is straightforward by using induction on d and the relation ∑i=1d(−1)ihied−i=0 when m∤d. Alternatively, it follows from part (ii).
For part (ii), let Ad=(aij)1≤i,j≤d. Notice that A1=(e1) and hence e1=det(A1). Fix a d∈N. By induction, suppose that ej=det(Aj) for all 1≤j≤d−1. Let wd be the ((d−1)×1)-column matrix with the first entry (−1)d+1ed and 0 elsewhere, let zi be the (i×1)-column matrix with the entries are hd,hd−1,…,hd−i+1 reading from the top and let vj be the (1×j)-row matrix with the last entry is 1 and 0 elsewhere. If d=ℓm then, expand along the last column,
[TABLE]
Suppose that m∤d. In particular, m=1 and thus h1=e1. Let Bs=(Ad−svd−szd−shs). We claim that, for all 1≤s≤d−1, det(Bs)=∑i=sd(−1)i−shied−i. When s=d−1, we have
[TABLE]
Expand det(Bs) along the last row, by induction, we have
[TABLE]
Notice that Ad=B1. Therefore, we conclude that
[TABLE]
For part (iii), if xi=yi for each i∈N, since ∑i=0d(−1)ihi(X)ed−i(X)=0 for all d by Theorem 2.1(ii), we have I=0. So hi=hi(X), ei=ei(X) and Γ(m)=Λ(X).
∎
In view of Lemma 3.1(i), we introduce the following notation. For each n∈N, we define dn,μ∈Z, with respect to the basis B, so that
[TABLE]
where s∈N0 in the above summation. Notice that if n=ℓm for some ℓ then dℓm,μ=0 for all μ=∅ and dℓm,∅=1.
Corollary 3.2**.**
Let μ∈P(n). For all r∈N0, we have
[TABLE]
Proof.
For each (α∣mβ)∈Pm2, we denote the coefficient of hαemβ in z∈Γ(m) as (z,hαemβ). Then dn,μ=(en,hμ) and dn+rm,μ=(en+rm,hμerm). Let Ad=(aij)1≤i,j≤d be defined as in Lemma 3.1(ii) and, by which, we have both en=det(An) and en+rm=det(An+rm). By virtue of the entries of Ad, an element of the form hαejm only appears in ejm(Ad)(1,jm) where (Ad)(1,jm) is the (1,jm)-minor of the matrix Ad.
Let Cd be the matrix obtained from Ad by replacing all entries of the form (−1)ℓ+1eℓ by [math]. Expand along the (rm)th column of An, we have
[TABLE]
where J is an upper unitriangular matrix and B is some suitable matrix. By similar calculation, we have (en,hμ)=(det(Cn),hμ). So we conclude that dn+rm,μ=dn,μ.
∎
In view of Corollary 3.2, we have the following notation.
Notation 3.3**.**
Let n∈N0. We denote
[TABLE]
For each partition μ, we write dμ=da,μ for the common number for all a=∣μ∣+rm where r∈N0 so that, for all n∈N0, we have
[TABLE]
4. The straightening rule
Recall the Z-bases B, C and D of the rings Γ(m), Y(S) and L(S) denoted in Theorems 2.2, 2.3 and 2.4 respectively. Our main result in this section provides an explicit formula to write, for each (α∣β)∈C2(n), the element hαeβ in terms of B. As a consequence, we have the explicit formulae to write [M(α∣β)] and [Kα∣βE] as Z-linear combinations in terms of the bases C and D respectively.
We begin with a list of notation.
Notation 4.1**.**
Fix a positive integer m, let λ∈P(n) and let b=⌊mn⌋.
- (i)
Let C(λ) be the set of compositions of the form δ=(δ1,…,δℓ(λ)) of type λ and let cλ=∣C(λ)∣, i.e.,
[TABLE]
where ni is the number of parts of λ of size i.
2. (ii)
Let cλ(m) be the number of compositions δ=(δ1,…,δℓ(λ))∈C(λ) such that
[TABLE]
for all 1≤j≤ℓ(λ).
3. (iii)
Let ελ=(−1)∣λ∣−ℓ(λ).
4. (iv)
For a finite sequence A=(δ(1),…,δ(r)) of partitions, we write cA=∏i=1rcδ(i) and ℘(A)=r. For example, ℘((∅))=1. Similarly, we write cA(m)=∏i=1rcδ(i)(m) and εA=∏i=1rεδ(i).
5. (v)
If δ,ξ are compositions such that \delta\text{{\tiny#}}\xi has type λ, we write λ=δ∪ξ (or λ=ξ∪δ). The notation λ=ξ(1)∪⋯∪ξ(r) has the obvious meaning given some compositions ξ(1),…,ξ(r).
6. (vi)
Let W(λ) be the set consisting of sequences (δ(1),…,δ(r),ξ) of partitions for some r∈N0 such that ξ∪δ(1)∪⋯∪δ(r)=λ, δ(i)=∅ and m∣∣δ(i)∣ for all 1≤i≤r, here r may be zero.
7. (vii)
For each 1≤i≤b, let Wi(λ)={A∈W(λ):℘(A)=i+1}.
8. (viii)
For each 1≤i≤b, let Pi be the subset of C(λ) consisting of all compositions (μ1,…,μℓ(λ)) such that μ1+μ2+⋯+μr=mi for some 1≤r≤ℓ(λ).
9. (ix)
Let ξ be a partition and β be a composition. Suppose that s=ℓ(β). Recall Notation 3.3. We denote by V(β;(ξ,mμ)) the set consisting of the s-tuples
[TABLE]
such that ξ=ξ(1)∪⋯∪ξ(s) and mμ=(β1−∣ξ(1)∣)∪⋯∪(βs−∣ξ(s)∣). Furthermore, we write
[TABLE]
By convention, c∅=1, c∅(m)=1, ε∅=1, W(∅)={(∅)} and cβ;(ξ,mμ)(m)=0 if V(β;(ξ,mμ))=∅.
For example, let λ=(3,2,1,1) and m=3. Then the compositions (μ1,μ2,μ3,μ4)∈C(λ) with the property that 3∤∑i=1jμi for all 1≤j≤4 are
[TABLE]
Thus c(3,2,1,1)(3)=3. Furthermore,
[TABLE]
For another example, if λ=∅ and m∣∣λ∣, then cλ(m)=0. Also,
[TABLE]
We may now state our main theorem.
Theorem 4.2**.**
Fix a positive integer m. For each (α∣β)∈C2(n),
[TABLE]
where the sum runs over all (λ∣mμ)∈Pm2(n) such that λ=α∪ξ for some partition ξ.
We illustrate the theorem with an example.
Example 4.3**.**
Let m=3. Then
[TABLE]
since c(2)(3)=1, ε(2)=−1, c(1,1)(3)=1 and ε(1,1)=1. Similarly, we have
[TABLE]
So, for example, we get
[TABLE]
here, after the last equality, we have deliberately removed the parentheses.
To prove Theorem 4.2, we need the following two lemmas.
Lemma 4.4**.**
For each partition λ,
[TABLE]
Proof.
Let b=⌊mn⌋. Recall that the elementary symmetric functions can be written in terms of the complete symmetric functions as
[TABLE]
with respect to the set of variables X={xi:i∈N} (see [13, Chapter I.2 Example 20]). Similarly, en(Y)=∑λ∈P(n)ελcλhλ(Y). Let xi=yi for each i∈N. Using Lemma 3.1(iii) and Equation 3.1, we have
[TABLE]
Fix a partition λ∈P(n). If λ=μ∪δ with μ,δ∈P then μ uniquely determines δ and vice versa. In Equation 4.1, m∣∣δ∣ (since μ∈P(n;m)). So the equation translates to
[TABLE]
By Theorem 2.1(i), comparing the coefficients of hλ(X), we have
[TABLE]
We prove the equality in the statement by using induction on the size of λ. If λ=∅ then d∅=1 and −ε∅(−1)℘((∅))c∅=1. Using Equation 4.2 and induction, we have
[TABLE]
Notice that W(λ)\{(λ)} consists of sequences of partitions, one for each i∈[b], (δ,δ(1),…,δ(j),ξ) such that δ∪μ=λ, ∣δ∣=im and (δ(1),…,δ(j),ξ)∈W(μ). So we get
[TABLE]
The proof is now complete.
∎
Lemma 4.5**.**
Let λ∈P(n) and b=⌊mn⌋.
- (i)
For each j∈[b], we have
[TABLE]
2. (ii)
We have dλ=ελcλ(m).
Proof.
For the proof of part (i), we denote the disjoint union of sets S1,…,Sa as ⨆i=1aSi. Let
[TABLE]
be defined as follows. For each η∈Pi1∩⋯∩Pij, we have positive integers 1≤s1<⋯<sj≤ℓ(λ) such that ∑t=1srηt=mir for each 1≤r≤j. Therefore, for each 1≤t≤j+1,
[TABLE]
for some partition δ(t) of size m(it−it−1) where i0=0=s0 and sj+1=ℓ(λ). Let ξ=δ(j+1). Then
[TABLE]
since (δ(1),…,δ(j),ξ)∈Wj(λ). The map ψ is invertible with the inverse ϕ given as follows. For each (δ(1),…,δ(j),ξ)∈Wj(λ) and
[TABLE]
we define \phi(h)=\eta^{(1)}\text{{\tiny#}}\cdots\text{{\tiny#}}\eta^{(j)}\text{{\tiny#}}\eta^{(j+1)}\in P_{i_{1}}\cap\cdots\cap P_{i_{j}} where mir=∑t=1r∣η(t)∣ for 1≤r≤j. The bijection ψ shows that
[TABLE]
The proof for part (i) is now complete.
For part (ii), by the inclusion-exclusion principle and Lemmas 4.4 and part (i), we have
[TABLE]
i.e., dλ=ελcλ(m).
∎
We may now prove our main theorem.
Proof of Theorem 4.2.
Let s=ℓ(β). By Equation 3.1 and Lemma 4.5(ii), we have
[TABLE]
Notice that ∏i=1shξ(i)eβi−∣ξ(i)∣=hξemμ where ξ=ξ(1)∪⋯∪ξ(s), mμ=(β1−∣ξ(1)∣)∪⋯∪(βs−∣ξ(s)∣) and hence (ξ∣mμ)∈Pm2(∣β∣) since ξ(i)∈P(βi;m). So, for an arbitrary (ξ∣mμ)∈Pm2(∣β∣), by Theorem 2.2, the coefficient of hξemμ in eβ is precisely ∑∏i=1sεξ(i)cξ(i)(m) where the sum is taken over all s-tuples (ξ(1),…,ξ(s))∈P(β1;m)×⋯×P(βs;m) such that ξ=ξ(1)∪⋯∪ξ(s) and mμ=(β1−∣ξ(1)∣)∪⋯∪(βs−∣ξ(s)∣), i.e., over the set V(β;(ξ,μ)). So the coefficient of hξemμ in eβ is cβ;(ξ,mμ)(m). Therefore,
[TABLE]
∎
Using Theorems 2.5 and 4.2, we obtain the following immediate corollaries.
Corollary 4.6**.**
Let (α∣β)∈C2(n). Then
- (i)
[M(α∣β)]=∑cβ;(ξ,pμ)(p)[M(λ∣pμ)], and
2. (ii)
[Kα∣βE]=∑cβ;(ξ,pμ)(p)[Kλ∣pμE]**
where both of the sums above run over all (λ∣pμ)∈Pp2(n) such that λ=α∪ξ for some partition ξ.
We demonstrate Corollary 4.6 with an example. When p=3, following Example 4.3, using the maps θ and ϕ as in Theorem 2.5, we have
[TABLE]
Let (M(α∣β):Y(δ∣pξ)) denote the multiplicity of Y(δ∣pξ) as a direct summand of M(α∣β). Similarly, we have the multiplicity (Kα∣βE:Listδ∣pξE). The following corollary is clear.
Corollary 4.7**.**
Let (α∣β)∈C2(n) and (δ∣pξ)∈Pp2(n). Then
- (i)
(M(α∣β):Y(δ∣pξ))=∑cβ;(ξ,pμ)(p)(M(λ∣pμ):Y(δ∣pξ)), and
2. (ii)
(Kα∣βE:Listδ∣pξE)=∑cβ;(ξ,pμ)(p)(Kλ∣pμE:Listδ∣pξE)**
where both of the sums above run over all (λ∣pμ)∈Pp2(n) such that λ=α∪ξ for some partition ξ.
Recall that Y(λ∣pμ) (respectively, Listλ∣pμE) is a summand of M(λ∣pμ) (respectively, Kλ∣pμE) with multiplicity one and any other summand Y(α∣pβ) (respectively, Listα∣pβE) necessarily satisfies (α∣pβ)⊳(λ∣pμ). Applying our result, we have a similar description when (λ∣pμ) is replaced by a general pair of compositions (α∣β).
Corollary 4.8**.**
Let (α∣β)∈C2(n) and s=ℓ(β). For each 1≤i≤s, let βi=pηi+ri such that 0≤ri≤p−1 and let r=∑i=1sri. Suppose that \alpha\text{{\tiny#}}(1^{r}) and (η1,…,ηs) have types λ and μ respectively.
- (i)
The signed Young permutation module M(α∣β) has the summand Y(λ∣pμ) such that (M(α∣β):Y(λ∣pμ))=1 and, if Y(δ∣pθ) is a summand of M(α∣β), then (δ∣pθ)⊵(λ∣pμ).
2. (ii)
The mixed power Kα∣βE has the summand Listλ∣pμE such that (Kα∣βE:Listλ∣pμE)=1 and, if Listδ∣pθE is a summand of Kα∣βE, then (δ∣pθ)⊵(λ∣pμ).
Proof.
We shall only prove part (i). Part (ii) can be proved in the similar fashion or follows from part (i) using Theorem 2.5. Since M(α∣β)≅M(ζ∣ν) if ζ,ν have types α,β respectively, we may assume that α,β are partitions so that \lambda=\alpha\text{{\tiny#}}(1^{r}) and μ=(η1,…,ηs) in the statement. Notice that r=∣β∣−p∣μ∣ and (λ∣pμ)∈Pp2(n). It suffices to prove that
- (a)
the coefficient of [M(λ∣pμ)] in [M(α∣β)] is 1, i.e., cβ;((1r),pμ)(p)=1, and
2. (b)
if (δ∣pθ)∈Pp2(n) such that M(δ∣pθ) has the summand Y(λ∣pμ) and [M(δ∣pθ)] appears in the sum of [M(α∣β)] in Corollary 4.6(i) then (δ∣pθ)=(λ∣pμ).
For each 0≤d≤p−1, we have ε(1d)c(1d)(p)=1. It is easy to check that
[TABLE]
and hence cβ;((1r),pμ)(p)=1. This proves statement (a).
Suppose that (δ∣pθ)∈Pp2(n) and [M(δ∣pθ)] appears in the sum of [M(α∣β)] in Corollary 4.6(i), i.e., cβ;(ξ,pθ)(p)=0 for some partition ξ such that δ=α∪ξ, ξ=ξ(1)∪⋯∪ξ(s), ξ(i)∈P(βi;p) for each 1≤i≤s and pθ=(β1−∣ξ(1)∣)∪⋯∪(βs−∣ξ(s)∣). Since ∣ξ(i)∣≥ri for each 1≤i≤s, we have ∣ξ∣≥r. So θ=(η1−ϵ1)∪⋯∪(ηs−ϵs) for some nonnegative integers ϵ1,…,ϵs. Next, we shall show that θi≤ηi for all 1≤i≤s. Suppose, on the contrary, that θi>ηi for some i. For any 1≤k≤i−1, we have ηi<θi≤θk=ηℓ−ϵℓ for some ℓ. In this case, 1≤ℓ≤i−1. Therefore the multisets (maybe empty) {θk:1≤k≤i−1} and {ηk−ϵk:1≤k≤i−1} are identical. So θi=ηj−ϵj for some j≥i and hence ηi<θi≤ηj for some j≥i. This contradicts to the fact that (η1,…,ηs) is a partition. So θi≤ηi for all 1≤i≤s. Suppose further that Y(λ∣pμ) is a summand of M(δ∣pθ). We have (λ∣pμ)⊵(δ∣pθ). In particular,
[TABLE]
Hence ∣ξ∣=r, ∣λ∣=∣δ∣ and \alpha\text{{\tiny#}}(1^{r})=\lambda\unrhd\delta=\alpha\cup\xi where, here, ⊵ is the usual dominance order on P(n). Therefore, ξ=(1r). Furthermore, p∣θ∣=p∣μ∣ and hence we conclude that θ=μ.∎
In [6, Proposition 7.1], Giannelli, O’Donovan, Wildon and the author found the label of the signed Young module when M(α∣β) is indecomposable (see [6, Theorem 1.4])in the odd characteristic case, i.e., the pair of partitions (δ∣pθ) such that M(α∣β)≅Y(δ∣pθ). Direct application of Corollary 4.8 gives an alternative proof.
Corollary 4.9** ([6, Proposition 7.1]).**
Let a,b∈N0, a=0 and b=sp+r where 0≤r≤p−1. Then M(∅∣(b))≅Y((1r)∣p(s)) and, if p∣a+b, M((a)∣(b))≅Y((a,1r)∣p(s)). Similarly, we have K∅∣(b)E≅List(1r)∣p(s)E and, if p∣a+b, K(a)∣(b)E≅List(a,1r)∣p(s)E.