Alperin–McKay natural correspondences in solvable and symmetric groups for the prime p=2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$p=2$$\end{document}

Let G be a finite solvable or symmetric group, and let B be a 2-block of G. We construct a canonical correspondence between the irreducible characters of height zero in B and those in its Brauer first main correspondent. For symmetric groups our bijection is compatible with restriction of characters.

groups at the prime p = 2. As one expects for natural correspondences, the bijections of characters in [7] preserve fields of values of characters. Actually, the hypothesis in [7] is more general and applies to odd-order groups at any prime. However, natural McKay bijections do not always exist, even for solvable groups when p = 2 (e.g., G = GL (2, 3) has two nonreal irreducible characters of degree 2, while all irreducible characters of the normalizer of a Sylow 3-subgroup of G are rational-valued, so no bijections preserving fields of values exist in this case).
Next recall that Irr(G) is partitioned into p-blocks; we let Irr(B) be the characters belonging to a given p-block B. The defect of B is the maximum nonnegative integer d such that |G|/ p d χ (1) is an integer, for some χ ∈ Irr(B). So if χ ∈ Irr(B), the p-part of |G|/ p d χ (1) is p h , where h ≥ 0 is the height of χ. We use Irr 0 (B) to denote the characters of height 0 in Irr(B). A defect group of B is a certain p-subgroup D of G such that |D| = p d . The defect groups of B are determined up to G-conjugacy.
The Alperin-McKay conjecture, first stated in [1], asserts that |Irr 0 (B)| = |Irr 0 (b)|, where b ∈ Bl(N G (D)) is the Brauer first main correspondent of B. T. Okuyama and M. Wajima proved the Alperin-McKay conjecture for p-solvable groups in [16]. However, as with the McKay conjecture, it is generally not possible to define natural correspondences in the context of the Alperin-McKay conjecture, even for solvable groups.
In this article we take p = 2. Our first main theorem extends Isaacs results [7] to establish a natural Alperin-McKay bijection for solvable groups.

Theorem 1.1 Let G be a finite solvable group, let B be a 2-block of G which has defect group D, and let b be the 2-block of N G (D) which is the Brauer correspondent of B. Then there exists a natural correspondence between the height-zero irreducible characters in B and the height-zero irreducible characters in b.
As a consequence of this theorem, if b is the Brauer correspondent of a 2-block B of a solvable group G, then the fields of values of the height-zero irreducible characters in B are the same as the fields of values of the height-zero irreducible characters in b.
In general, it is particularly rare to find a natural correspondence that is compatible with restriction of characters, in the context of the Alperin-McKay conjecture. Surprisingly this happens when G = S n , the symmetric group on n letters. The second main result of the article can be stated as follows.

Theorem 1.2 Let B be a 2-block of S n with defect group D, and let b be the 2-block of N S n (D) which is the Brauer correspondent of B. Then there exists a natural correspondence between the height-zero irreducible characters in B and the height-zero irreducible characters in b.
If α ∈ Irr 0 (B) corresponds to β ∈ Irr 0 (b), then [α↓ N Sn (D) , β] = 0. Theorem 1.2 is a generalization of [6,Theorem 4.3] where, building on [5], it was possible to explicitly construct a canonical correspondence of characters, compatible with restriction, in the context of the McKay conjecture for S n .
The last main result of the paper is Theorem 3.8. There we study in more details the restriction to N S n (D) of any χ ∈ Irr(B). In particular we show that for every γ ∈ Irr(B) there exists β ∈ Irr 0 (b) such that β is a constituent of γ ↓ N Sn (D) . G P. Glauberman's Lemma 13.8 of [8] asserts that if X is a (G P)-set, such that G acts transitively on X , then P fixes an element of X . One useful consequence of this is that if N is a P-invariant normal subgroup of G, then C G/N (P) = C G (P)N /N . Now suppose that P is solvable. Let Irr P (G) denote the set of P-invariant irreducible characters of G. The Glauberman correspondence is a uniquely defined bijection * : Irr P (G) −→ Irr(C G (P)).
Our notation * suppresses the dependence of this map on the action of P on G, as it should be clear from the context. In the key case when P is a p-group, we need the following property of Glauberman's map: Lemma 2.1 Let P be a finite p-group which acts coprimely on a finite group G, and let V be a P-invariant subgroup of G which contains C G (P).
The reader is referred to Chapter 13 of [8] for a more thorough discussion of coprime actions and the Glauberman correspondence. Now we discuss our plan of attack for the proof of Theorem 1.1, which consists first in reducing the general situation to the maximal-defect case. Let G be a finite solvable group and let B be a 2-block of G. We use induction on the order of G, so assume Theorem 1.1 holds for any solvable group of order strictly smaller than |G|. Write M = O 2 (G), and note that (by the covering theory of blocks) there exists θ ∈ Irr(M), unique up to G-conjugacy, such that Irr(B) ⊆ Irr(G | θ). Let T = I G (θ ) be the stabilizer of θ in G. By Fong-Reynolds Theorem 9.14 of [15], there exists a unique block B 0 of T whose irreducible characters are the Clifford correspondents (with respect to θ ) of the irreducible characters in B. Furthermore, this correspondence is height-preserving. So induction from T to G establishes a bijection from Irr 0 (B 0 ) to Irr 0 (B), and a defect group of B 0 is a defect group of B. In particular we can assume that D ⊆ T .
Let θ * ∈ Irr(C M (D)) be the Glauberman correspondent of θ with respect to the action of D on M. Note that C M (D) = N ∩ M, where N = N G (D). By uniqueness in Glauberman's correspondence, N ∩ T is the stabilizer of θ * in N . Let b 0 ∈ Bl(N ∩ T ) be the Brauer first main correspondent of B 0 . Then b lies over θ * , and the irreducible characters lying in b 0 are precisely the Clifford correspondents (over θ * ) of the irreducible characters lying in b (see [20] for details). As before, induction defines a height-preserving bijection from Irr(b 0 ) into Irr(b).
Suppose that T < G. Our inductive hypothesis yields a natural correspondence from the set of height-zero characters in B 0 into the set of height-zero characters in b 0 . In this case, induction of characters, respectively, from T into G, and from N ∩ T into N , establishes the desired bijection between the height-zero characters in B and the height-zero characters in b. So we may assume that T = G.
By the previous paragraphs, we may suppose that θ is G-invariant. So D ∈ Syl 2 (G) and Irr(B) = Irr(G | θ), by Fong's Theorem 10.20 of [15]. Since Irr(b) = Irr(N | θ * ) in this case, to complete the proof we need to prove a certain compatibility condition between the correspondence defined by Isaacs in [7] for the McKay conjecture in solvable groups and the prime p = 2, and Glauberman correspondence (see Theorem 2.4 below). Working toward this, we begin with a bijection of characters defined by Isaacs in Theorem 10.6(ii) of [7]. What we really need to show is that this bijection has the property stated. We note that this property may also be established using the work of Wolf [21], and that a related question was treated in [12]. Lemma 2.2 Let G be a finite group, let P ∈ Syl 2 (G), let K, L G with L ⊆ K and let ξ ∈ Irr P (L). Assume in addition that: Then there is a choice-free one-to-one correspondence: This character correspondence satisfies the following property: let V be a P-invariant oddorder subgroup of G which contains K and let ϕ ∈ Irr P (V | ξ). Suppose that ν ∈ Irr(V ∩ H | ξ) is the unique P-fixed character with ϕ * = ν * . Then f ξ restricts to a one-to-one correspondence: Proof Our assumptions give G = H K , L = H ∩ K and thus G/K ∼ = H/L. We use induction on |G|. We shall denote the map f ξ in the statement of Lemma 2.2 bŷ Step 1. We can assume that ξ is invariant in G.
Proof of Step 1 Let T = I G (ξ ) be the inertia subgroup of ξ in G, and assume that T < G. Now P ⊆ T , by our hypothesis. Thus, the result holds for the group T , its subgroups K ∩ T , L and H ∩ T , and the character ξ ∈ Irr(L) by induction. So there exists a choice-free correspondence satisfying the desired property. Let α ∈ Irr 2 (T | ξ), and note that χ = α↑ G ∈ Irr 2 (G | ξ) by Clifford's correspondence. Suppose that β ∈ Irr 2 (H ∩ T | ξ) corresponds to α under map (1). Then β↑ H ∈ Irr 2 (H | ξ) by Clifford's correspondence, and we setχ := β↑ H . By the properties of Clifford's correspondence, this defines a one-to-one map : Next we prove that the mapˆsatisfies the property in the statement.
Since both ϕ and ν are P-invariant, it follows from the uniqueness in Clifford's correspondence that γ and δ are P-fixed as well.
We claim that γ * = δ * . First, note that , and notice that μ is P-invariant. By Lemma 2.1, we have that μ * = γ * . Now, let η be the unique P-invariant irreducible constituent of γ ↓ V ∩H ∩T having odd multiplicity, again by Lemma 2.1, so η * = γ * = μ * . We shall prove that η = δ. Note that since γ lies over ξ , which is invariant in V ∩ T , it is clear that η lies over ξ as well. Thus ω = η↑ V ∩H is irreducible and P-invariant, by Clifford's correspondence. Also, observe that η is the unique P-invariant irreducible constituent of μ↓ V ∩H ∩T having odd multiplicity, by Lemma 2.1. Let ζ = ζ 1 , . . . , ζ r be a nontrivial P-orbit of irreducible constituents of μ↓ V ∩H ∩T , and write = ζ 1 + · · · + ζ r . Suppose that ζ i = ζ x i , where x i ∈ P. Then, since ω is P-invariant, we have that which of course is even. It follows that Since ϕ↓ V ∩H = (μ↓ V ∩H ∩T ) ↑ V ∩H , we deduce by Lemma 2.1 that ω = ν. Thus η = δ by uniqueness in Clifford's correspondence, and our claim follows. Now, by induction map (1) restricts to a one-to-one correspondence Let α ∈ Irr 2 (T | ξ) and write χ = α↑ G ∈ Irr 2 (G | ξ). Then where the last equality follows from Clifford correspondence because α, γ ↑ T ∈ Char(T | ξ). Thus, χ lies over ϕ if and only if α lies over γ . Similarly, for β ∈ Irr 2 (H ∩ T | ξ), we have that β↑ H ∈ Irr 2 (H | ξ) lies over ν if and only if β lies over δ. We deduce thatˆrestricts to a bijection as wanted. So we can and do assume from now on that ξ is invariant in G.
Step 2. We can assume that ξ is fully ramified in K /L.

Proof of
Step 2 Let L ⊆ J ⊆ K be the largest subgroup of K such that ξ extends to J and every extension of ξ to J is fully ramified in K (see Theorem 2.7 of [7]). Since ξ is G-invariant, it is clear that J G. By Problem 13.5 of [8], there exists a unique extension φ ∈ Irr(J ) of ξ which is P-invariant. Since P J H J, it easily follows from the uniqueness of φ that this character is invariant in H J. Then, by Lemma 10.5 of [7], for any P-invariant subgroup J ⊆ X ⊆ H J, restriction of characters defines a bijection and it is immediate that this bijection maps P-invariant characters onto P-invariant characters. By uniqueness of φ, an easy counting argument on character degrees yields Irr 2 (X | ξ) ⊆ Irr(X | φ), for any X as above. It follows from this and Lemma 2.1 that restriction of characters defines a bijection satisfying the condition required for the correspondence f ξ in the statement. Thus, we may assume that L = J , which is the same to say that ξ is fully ramified in K /L. By the previous step, ξ ↑ K has a unique irreducible constituent, which we denote by θ . We observe that θ is P-invariant, by uniqueness.

Final Step
We are in a situation in which Theorem 9.1 of [7] applies. This theorem gives U ⊆ G such that G = K U and K ∩ U = L. By Glauberman's lemma we may assume that U is P-invariant. Applying the Frattini argument (see the last paragraph of p. 632 in [7]), we can assume that U = H . Let be the character of G/L given by Theorem 9.1. In particular the equation χ↓ U = ( ↓ U )χ , for χ ∈ Irr(G | θ) andχ ∈ Irr(H | ξ) defines a choice-free one-to-one correspondence between these sets of characters. The uniqueness of θ gives Irr(G | ξ) = Irr(G | θ), and since (1) = √ |K /L| is odd, we obtain a bijective correspondenceˆ: In order to see thatˆsatisfies the desired property, let K ⊆ V ⊆ G be a P-invariant oddorder subgroup of G. Suppose that W ⊆ G is such that W/L complements K /L in V /L and satisfies the conditions of Theorem 9.1 of [7] for the character five (V, K , L , θ, ξ). Since K /L acts transitively on the G-conjugacy class of W , Glauberman's lemma allows us to assume that W is P-invariant. Since Arguing as before and using the inductive definition of the character (see p. 619 of [7]), we deduce that the equation defines a bijection between these sets of characters. Furthermore, it is clear that a P-invariant ϕ ∈ Irr 2 (V | ξ) corresponds to a P-invariant ν ∈ Irr 2 (H ∩ V ), and since |V | is odd, this occurs if and only if [ϕ↓ V ∩H , ν] is odd, by Theorem 9.1 of [7], which in turn is equivalent to ϕ * = ν * , by Lemma 2.1. Suppose that χ ∈ Irr 2 (G | ϕ), and write where is either zero, or ∈ Char(V | ξ) does not contain ϕ as a constituent. Then and Theorem 9.1 of [7] implies thatχ lies over ν, sinceχ↓ W ∈ Char(W | ξ). Similarly, if we assume thatχ lies over ν, then χ lies over ϕ, and it follows that the mapˆrestricts to a bijection The proof is complete.
We want our correspondences of characters to be invariant under the action of suitable Galois automorphisms and group automorphisms. More precisely, assuming the notation in Lemma 2.2, if a ∈ Aut(G) stabilizes the subgroups K and L of G, then ξ a ∈ Irr(L) is P a -invariant, and we obtain a bijection In this situation, we would like to have that where ω ∈ C is a primitive |G|-th root of unity, then ξ σ ∈ Irr(L) is P-invariant and Lemma 2.2 provides a choice-free bijection As before, we would like the map f ξ σ to satisfy for any χ ∈ Irr 2 (G | ξ).
A careful analysis of the proof of Lemma 2.2 shows that the bijection f ξ in that result is built upon the following three correspondences of characters: Clifford's correspondence (as in Step 1 of the proof); the correspondence in Lemma 10. 5 of [7], given by character restriction (as in Step 1 of the proof); and finally, the correspondence of Theorem 9.1 in [7]. The two former correspondences are easily seen to be preserved by Galois action and action by automorphisms of G as described above. Thus, in order to see that the correspondence in Lemma 2.2 also satisfies this, we need to prove that the correspondence in Theorem 9.1 of [7] is invariant under the actions described in the previous paragraph. This is the content of the following result.
be a character five, and assume that |K /L| is odd. Let U ⊆ G be as in the conclusion of Theorem 9.1 of [7].
corresponds to ξ ∈ Irr(U | φ) under the bijection of Theorem 9.1 of [7], then χ σ corresponds to ξ σ under this same bijection when defined with respect to the character five under the bijection of Theorem 9.1 of [7], then χ a corresponds to ξ a ∈ Irr(U a ) under this same bijection when defined with respect to the character five Proof Let ∈ Char(G) be defined as in Theorem 9.1 of [7], with respect to the form , φ . We first prove (2). It is clear that [7, Theorem 9.1] applies to the character five (G, K , L , θ a , φ a ), and we may choose U a ⊆ G as a representative of the G-conjugacy class of subgroups of G in the conclusion of that theorem. Suppose that a ∈ Char(G) is the character computed with respect to the form , φ a as in [7, Theorem 9.1]. Since it suffices to prove that a = a . By the algorithm given in [7, p. 619 and p. 626] to compute , this follows immediately from the fact that for any s ∈ U and any Sylow p-subgroup where the last identity is a consequence of the definition of the form , φ on [7, p. 596]. In order to prove (1), we argue similarly and notice that for any s ∈ U , we have ⎛ We remark that the proof of Lemma 2.2 has the same structure that the proof of Theorem 10.6(ii) of [7]. It is thus clear that the correspondence of characters of that theorem is invariant under Galois action and action by group automorphisms as above. Of course, this was already evident from the arguments in [7].
Our next result implies the maximal-defect case of Theorem 1.1. The general case follows from the reduction to this case given by Fong-Reynolds theory, as discussed prior to Lemma 2.2.

Theorem 2.4 Let G be a finite solvable group, P ∈ Syl 2 (G) and M G with |M| odd. Assume that θ ∈ Irr(M) is G-invariant, and let θ * ∈ Irr(C M (P)) be its Glauberman correspondent for the action of P on M. Then there exists a choice-free bijection
Proof We divide the proof of the theorem in several steps. Write N = N G (P).
Step 1. We can assume that G = N M.
Proof of Step 1 We shall see that there exists a choice-free bijective correspondence By the Frattini argument, we have that G = N S. Thus, by assumption M < S. Let M ⊆ J G be such that J/M = (S/M) , and note that J < S, because G is solvable. Note also that |S/J | is odd, and thus C S/J (P) = 1. Let H = N J, and observe that G = H S and H ∩ S = J . We shall define a choice-free correspondence from Irr 2 (G | θ) into Irr 2 (H | θ), and then repeated applications of the same argument will yield the result. Let Of course, all the irreducible constituents of χ↓ J have odd degree. Since θ is G-invariant, it is also clear that every irreducible constituent of χ↓ J lies over θ . Observe that P acts on the irreducible constituents of χ↓ J by conjugation, and thus since χ(1) is odd, an easy counting argument implies that there exists a P-invariant irreducible constituent of χ↓ J . Now, by Theorem 10.6(ii) of [7], for each P-invariant ϕ ∈ Irr 2 (J | θ), there exists a natural correspondence x for some x in G and we let I be the inertia subgroup of ϕ 1 in G, then since ϕ 1 is P-fixed, we have that P is contained in I , and since ϕ 2 is P-fixed also P x is contained in I . Now there exists y in I such that n = yx −1 normalizes P, and (ϕ 1 ) n = ϕ 2 . Since the maps F ϕ i are invariant under automorphisms of G induced by N -conjugation, we have as claimed. Thus, the union F of the maps F ϕ , where ϕ ∈ Irr 2 (J | θ) and ϕ is P-invariant, is a well-defined map. By the above observations, it is clear that and it is easy to check that F is bijective. Finally, note that the map F is choice-free, because the maps F ϕ are choice-free. This completes the proof of Step 1.
Let K = [M, P], and note that M = C M (P)K by coprime action. In particular G = N K . Let L = K < K and note that C K /L (P) = 1, again by coprime action. Write H = N L, and notice that H ∩ K = L. Denote by ν ∈ Irr(M ∩ H ) the unique P-invariant character such that ν * = θ * . Let y ∈ N . Since the Glauberman map is invariant under automorphisms of G stabilizing both P and M, and in this case also stabilizing M ∩ H , we have that It follows that ν y = ν by uniqueness in Glauberman correspondence, and thus ν is Hinvariant. Then by induction on |G| we obtain a choice-free bijection It is now clear that in order to finish the proof it suffices to prove the following: Final Step There exists a choice-free correspondence

Proof of Final
Step Recall that by Lemma 2.1 we have [θ ↓ M∩H , ν] = 0. Since ν is Pinvariant of odd degree, let ξ ∈ Irr(L) be a P-invariant constituent of ν↓ L . By Lemma 2.2, there exists a choice-free bijection f ξ , depending only on ξ : such that it restricts to a bijection: If ξ y is any other P-invariant contituent of ν↓ L , where y ∈ M ∩ H , then Lemma 2.2 provides a natural correspondence which again restricts to a bijection f ξ y : By Proposition 2.3 and the comments before it, for any χ ∈ Irr 2 (G | θ) we have that Thus, the restriction of f ξ to Irr 2 (G | θ) is independent of ξ , and we obtain a choice-free correspondence of characters f as desired.
By Proposition 2.3 and the construction of the bijections leading to Theorem 1.1, it is clear that the correspondence in that theorem is preserved by both Galois action and action by group automorphisms of G stabilizing the block B. More precisely, assuming the notation in Theorem 1.1, if σ ∈ Gal(Q(ω)/Q), where ω ∈ C is a primitive |G|-th root of unity, is such that B σ = B, then b σ = b. Now, ifˆis the bijection in Theorem 1.1, thenˆcommutes with the actions of σ on Irr(B) and Irr(b): for any χ ∈ Irr(B) of height zero. In particular, this implies that the height-zero irreducible characters in B have the same fields of values as the height-zero irreducible characters in b. Similarly, if a ∈ Aut(G) is such that B a = B, then a induces a height-preserving permutation κ a on Irr(B), and a height-preserving bijection τ a : (N G (D a )). So we see that the bijectionˆin Theorem 1.1 makes the following diagram commutative: Irr 0 (B)

Symmetric groups
Let n be a natural number and let S n be the symmetric group on n letters. The Alperin-McKay conjecture has been verified for symmetric groups with a beautiful argument by Olsson in [17]. The main goal of the first part of the present section is to prove Theorem 1.2.
In particular we determine a natural bijection χ → χ * between Irr 0 (B) and Irr 0 (b), where b is the Brauer correspondent of a given 2-block B of S n with defect group D. This bijection is based on the leg-lengths of hooks of partitions, and it is shown to be compatible with the restriction functor in the sense that χ * is a constituent of the restriction χ↓ N Sn (D) .
In the second part of the section (see Sect. 3.3) we investigate in more detail the restriction to N S n (D) of any irreducible character in Irr(B). In Theorem 3.8 we show that given any irreducible character of S n lying in B, there exists ψ ∈ Irr 0 (b) such that ψ is a constituent of χ↓ N Sn (D) . Moreover, we characterize those irreducible characters lying in B whose restriction to N S n (D) has a unique height-zero constituent.

Notation and background
We start by recalling some basic facts in the representation theory of symmetric groups. We refer the reader to [10], [11] or [18] for a more detailed account. A partition λ = (λ 1 ≥ λ 2 ≥ · · · ≥ λ > 0) is a finite nonincreasing sequence of positive integers. We refer to λ i as a part of λ. We call = (λ) the length of λ and say that λ is a partition of |λ| = λ i , written λ |λ|. It is useful to regard the empty sequence ( ) as the unique partition of 0. The Young diagram of λ is the set We orient N × N with the x-axis pointing right and the y-axis pointing down, in the Anglo-American tradition.
The conjugate of λ is the partition λ such that [λ ] is the reflection of [λ] in the line y = x. So λ has parts λ i = |{ j | λ j ≥ i}| and in particular λ 1 = (λ). We say that a partition μ is contained in λ, written μ ⊆ λ, if μ i ≤ λ i , for all i ≥ 1. When this occurs, we call the nonnegative sequence λ\μ = (λ i − μ i ) ∞ i=1 a skew-partition, and we call the diagram Recall that the cycle type of a permutation σ ∈ S n is the partition whose parts are the sizes of the orbits of σ on {1, 2, . . . , n}. Now the complex irreducible characters of S n are naturally labeled by the partitions of n. Given any partition λ of n we denote by χ λ the corresponding irreducible character of S n . The following classical result can be iterated to find the values of these characters: Lemma 3.1 (Murnaghan-Nakayama rule) Let λ n and let (σ, τ ) ∈ S e × S n−e such that σ is an e-cycle. Then where h runs over all e-hooks in λ.
Let p be a prime integer, and let B be a p-block of S n with associated defect group D (uniquely defined up to conjugacy in S n ). According to the famous result of Brauer and Robinson (as conjectured by Nakayama, see [4,19]), B = B(κ, w) for some p-core κ and weight w ≥ 0. Moreover, we can choose a defect group of B to be a Sylow p-subgroup P pw of S pw . Note that κ is the unique partition in B(κ, 0). Hence an irreducible character χ λ of S n is in Irr(B(κ, w)) if and only if the p-core of λ is κ. In this case we set h(λ) to be the ( p-)height of χ λ .
Character theory implies that [S n : C S n (c)]χ λ (c)/χ λ (1) is an integer, and the parity of this central character is independent of λ ∈ B(κ, w), according to block theory. Now the defect group P 2w of B(κ, w) is a Sylow 2-subgroup of C S n (c) = S 2w × c . It follows that χ λ (c)/2 h(λ) is an integer whose parity is independent of λ.
Conversely, let γ 1 , γ 2 , . . . , γ t be hook partitions of 2 w 1 , 2 w 2 , . . . , 2 w t , respectively. By [2, Theorem 1.1] there is a unique partition μ (t) ⊃ κ such that μ (t) \κ is a 2 w t rim-hook associated with γ t . Given i > 1, suppose that we have constructed a sequence μ (i+1) ⊃ · · · ⊃ μ (t) ⊃ μ (t+1) = κ of partitions such that μ ( j) \μ ( j+1) is a 2 w j rim-hook associated with γ j , for j = i + 1, . . . , t, and shown that this sequence is unique. Then μ (i+1) has 2-weight t j=i+1 2 w j < 2 w i . So μ (i+1) is a 2 w i -core. Again using [2, Theorem 1.1], there is a unique partition μ (i) ⊃ μ (i+1) such that μ (i) \μ (i+1) is a 2 w i rim-hook associated to γ i . This shows that there is a unique partition μ = μ (1) which has 2-weight w, 2-core κ and hook sequence (γ 1 , . . . , γ t ). In particular μ has height zero. Counting the number of hook sequences for w gives: Example 3.4 The 8 height-zero partitions of 9 in B((2, 1), 3), their hook sequences and the sequence of leg-lengths of these hooks: Recall that P 2 is cyclic of order 2 and P 2 k ∼ = P 2 k−1 C 2 for all k > 1. It is not hard to show that N S 2 k (P 2 k ) = P 2 k . Now the odd-degree characters of S 2 k are precisely those labeled by the hook partitions H(2 k ) of 2 k . Moreover, by [5,Theorem 1.1] there is a bijection between these characters and the linear characters of P 2 k ; if h is a hook partition of 2 k , the corresponding character of P 2 k is the unique linear constituent φ h of χ h ↓ P 2 k .
As mentioned above, P 2w is a defect group of the 2-block B(κ, w) of S n . Now P 2w has normalizer N := P 2w × S |κ| in S n . The Brauer correspondent of B is the unique 2-block b = b 0 × B(κ, 0) of N such that b S n = B in the sense of Brauer. Here b 0 is the unique 2-block of the 2-group P 2w and B(κ, 0) is a defect zero 2-block of S |κ| . It is easy to check that an irreducible character ψ × χ κ in b has height-zero if and only if ψ(1) = 1. Equivalently we must have where h j is a hook partition of 2 w j , for all j ∈ {1, . . . , t}.
Let χ = χ λ be a height-zero character in B(κ, w), and suppose that λ has hook sequence H(λ) = (h 1 , . . . , h t ). We denote by χ * the height-zero character in b defined by We are now able to prove Theorem 1.2. This follows from the following result.

Theorem 3.5
The map χ → χ * is a bijection between the height-zero characters in B(κ, w) and the height-zero characters in its Brauer correspondent b. Moreover χ * is a constituent of the restriction of χ to N .
Proof Set H(w) = H(2 w 1 ) × · · · × H(2 w t ). The first assertion about the bijectivity of the map follows from the discussion above. There we explicitly described two bijections: the first one between the sets Irr 0 (B(κ, w)) and H(w), and the second one between the sets H(w) and Irr 0 (b). The composition of this two bijections gives the map defined by χ → χ * .
Let χ = χ λ where λ is a partition of n. To prove the second statement we proceed by induction on t, the length of the 2-adic expansion of 2w. Suppose then that t = 1 and 2w = 2 w 1 . Let h be the hook partition of 2w corresponding to the unique 2w rim-hook of λ. A direct application of the Littlewood-Richardson rule shows that χ h × χ κ is a constituent of χ λ ↓ S 2w ×S n−2w (see [6,Lemma 4.1] for an explicit proof). It follows that χ * = φ h × χ κ is a constituent of χ λ ↓ P 2w ×S n−2w .

and by induction we have that
We conclude that χ * is a constituent of χ λ ↓ P 2w ×S n−2w .
We end this section by observing that the map described in Theorem 3.5 can be equivalently defined in algebraic terms only, without using combinatorics. This is done via repeated applications of [9, Theorem B]. Keeping the notation introduced above let n = 2w+|γ | where 2w = 2 w 1 + · · · +2 w t , and let χ ∈ Irr 0 (B(κ, w)). For i ∈ {1, . . . , t} we let n i := n i−1 − 2 w i , where we set n 0 = n. We set χ 0 := χ, and we define a sequence of irreducible characters (χ 1 , . . . , χ t ) as follows. For i ∈ {1, . . . , t} let χ i ∈ Irr(S n i ) be the unique irreducible constituent of χ i−1 ↓ S n i appearing with odd multiplicity. Notice that χ 1 is well defined since χ 0 has height zero and therefore the partition λ of n labeling χ 0 has a unique removable rim 2 w 1 -hook γ 1 , by Lemma 3.2. Hence by [9, Theorem B] χ 0 ↓ S n 1 has a unique irreducible constituent χ 1 appearing with odd multiplicity. Again [9, Theorem B] guarantees that the partition of n 1 labeling χ 1 is obtained by removing γ 1 from λ; hence, χ 1 is an irreducible character of height zero in B(κ, w − 2 w 1 −1 ), by Lemma 3.2. Iterating this same argument i times, we deduce that χ i is well defined and uniquely determined.
A second application of [9,Theorem B] implies that there exists a unique θ i ∈ Irr(S n i × S 2 w i ) such that θ i lies above χ i and such that θ i (1) χ i (1) is odd. Therefore θ i = χ i × ρ i for some uniquely defined ρ i ∈ Irr 2 (S 2 w i ).
We now denote by φ i the unique irreducible odd-degree constituent of ρ i ↓ P 2 w i (well defined by [5, Theorem 1.1]), and we set Theorem 3. 6 The map χ → χ * * coincides with the map constructed in Theorem 3.5.
Proof Repeated applications of [9, Theorem B] and of Lemma 3.2 show that for all i ∈ {1, . . . , t} we have that χ i = χ λ i where λ i is the partition of n i obtained by removing from λ i−1 the unique 2 w i rim-hook γ i . Moreover ρ i = χ h i where h i is the hook partition of 2 w i associated with γ i . We conclude that φ i = φ h i and therefore that χ * * = χ * .

Restriction to the normalizer
We continue with the notation that κ is a 2-core of n − 2w. However we now assume that B = B(κ, w) is a nonprincipal 2-block of S n . So κ = (s, s − 1, . . . , 1) with s > 1. Also P 2w is a defect group of B, N = P 2w × S n−2w is the normalizer of P 2w in S n , and b is the 2-block of N that is the Brauer correspondent of B(κ, w). In Sect. 3.2 we have seen that there exists a bijection χ → χ * between the sets Irr 0 (B) and Irr 0 (b). We have also shown that χ * is a constituent of the restriction of χ to N .
Question. Is χ * the only constituent of χ↓ N lying in Irr 0 (b)?
In [5, Theorem 1.2] the first author addressed the above question in the case where B is the principal block of S n . In particular the following statement holds: Proposition 3.7 Let χ ∈ Irr(S n ), and let P n be a Sylow 2-subgroup of S n .
(i) The restriction of χ to P n has a linear constituent. In particular, if χ(1) is even, then its restriction to P n has at least two linear constituents.
In this section we will prove the following statement. In particular, if χ has positive height, then its restriction to N has at least two height-zero constituents lying in b.
The proof will be given in a series of results, culminating in Proposition 3.13. First recall the following important definition and rule. Definition 3.9 Let A = a 1 , . . . , a k be a sequence of positive integers. The type of A is the sequence of nonnegative integers m 1 , m 2 , . . . where m i is the number of occurrences of i in a 1 , . . . , a k . We say that A is a reverse lattice sequence if the type of its prefix a 1 , . . . , a j is a partition, for all j ≥ 1. Equivalently, for each j = 1, . . . , k and i ≥ 2 Let α n and β m be partitions. The outer tensor product χ α × χ β is an irreducible character of S n × S m . Inducing this character to S n+m we may write The Littlewood-Richardson rule asserts that c γ α,β is zero if α γ and otherwise equals the number of ways to replace the nodes of the diagram [γ \α] by natural numbers such that 1. The numbers are weakly increasing along rows. 2. The numbers are strictly increasing down the columns. 3. The sequence obtained by reading the numbers from right to left and top to bottom is a reverse lattice sequence of type β.
We call any such configuration a Littlewood-Richardson filling of [γ \α].
Recall that a partition α dominates a partition β, written β α, if i j=1 β j ≤ i j=1 α j , for all i ≥ 1. We will use λ 0 and λ 1 to denote the most dominant and least dominant partitions in B(κ, w), respectively. So λ 0 and λ 1 are obtained by wrapping a horizontal, respectively, a vertical 2w rim-hook onto κ. In particular λ 0 and λ 1 have height zero. Lemma 3.10 The following hold: Proof To prove (i), let λ ∈ B(κ, w) such that c λ (2w),κ = 0. Then λ has 2-core κ, and no two nodes in [λ\κ] belong to the same column, using the Littlewood-Richardson rule. However [λ\κ] is a union of 2-hooks. As κ is triangular, this forces [λ\κ] to be a single row. So λ = λ 0 and c λ (2w),κ = 1. The proof for (χ κ × χ (1 2w ) )↑ S n is similar, and we omit it. To prove (ii) let us first assume that λ = λ 0 . Then [λ\κ] is a row. Using the Littlewood-Richardson rule, χ α ×χ κ is an irreducible constituent of the restriction of χ λ to S 2w ×S n−2w if and only if α = (2w). Moreover, χ (2w) × χ κ occurs with multiplicity 1 in the restricted character. It follows that the only constituent of χ λ ↓ N lying in b is Moreover, this character appears with multiplicity 1. A completely similar argument (replacing (2w) with (1 2w )) covers the case λ = λ 1 . Now let rows(γ \α) be the partition obtained by sorting the row lengths of γ \α into weakly decreasing order, and cols(γ \α) the partition obtained from the column lengths.
Suppose for the sake of contradiction that the restriction of χ λ to S 2w × S n−2w has only one irreducible constituent of the form χ α × χ κ , where α is a partition of 2w. [ [1]. So if we remove all 2-hooks from [λ\μ], we are left with a skew diagram with at most 1 node. In particular we will have removed at least two nodes from [κ]. This contradicts our hypothesis that λ has 2-core κ. So this case is also impossible.

Proposition 3.13
For λ ∈ B(κ, w), with λ = λ 0 , λ 1 , the number of height-zero constituents in the restriction of χ λ to N which belong to b is: (i) two, if w is a power of 2 and [λ\κ] is the disjoint union of a row and a column.
(ii) at least three, if w is a power of 2 and [λ\κ] is a 2w rim-hook of leg-length 1 or 2w −2.
(iii) at least four, in all other cases.
Proof By Lemma 3.12, the restriction of χ λ to S 2w × S n−2w has at least two irreducible constituents of the form χ α × χ κ , with α = (2w), (1 2w ). Assume the hypothesis of (i). Then the Littlewood-Richardson rule gives where m is the length of the row of [λ\κ] and no irreducible constituent of the character ψ has the form χ α × χ κ . Proposition 3.7(ii) implies that the restriction of χ λ to N has exactly two height-zero irreducible constituents in b. Suppose next that w is a power of 2 and cols(λ\κ) t is a hook partition. As λ = λ 0 , λ 1 , this means that [λ\κ] has a unique column of length ≥ 2. We may assume that [λ\κ] is not the disjoint union of a row and a column. As κ is a nontrivial triangular partition, the only possibility remaining is that [λ\κ] is a 2w rim-hook of leg-length 1. Then rows(λ\κ) = (2w − 2, 2) is not a hook partition. Proposition 3.7 implies that the restriction of χ (2w −2,2) to P 2w has at least two linear constituents. It follows that the restriction of χ λ to N has at least three height-zero irreducible constituents in b.
A similar argument works when w is a power of 2 and rows(λ\κ) is a hook partition. In that case, we may assume that [λ\κ] is a 2w rim-hook of leg-length 2w − 2. Then cols(λ\κ) t = (2 2 , 1 2w−4 ) is not a hook partition, and once again Proposition 3.7 implies that the restriction of χ (2 2 ,1 2w−4 ) to P 2w has at least two height-zero irreducible constituents in b. This completes the analysis of the hypothesis of (ii).
To prove (iii), we may suppose that w is not a power of 2, or that neither cols(λ\κ) t nor rows(λ\κ) are hook partitions. Proposition 3.7 implies that the restriction of each χ α to P 2w has at least two linear constituents. It follows that the restriction of χ α × χ κ to N has at least two height-zero irreducible constituents in b. Taking into account that there are at least two such α, we see that the restriction of χ λ to N has at least four height-zero irreducible constituents in b.
We are actually able to characterize when the number of height-zero constituents is 3. As shown in Corollary 3.16 below, this situation occurs extremely rarely.
We first need the following lemma. Lemma 3.14 Let k ≥ 2 be a positive integer. Then the linear character φ (2 k ) is an irreducible constituent of the restriction of χ (2 k −2,2) to the Sylow 2-subgroup P 2 k of S 2 k .
But c k−1 is positive. So −(2c k−1 + 1) ± 1 < 0, leading to a contradiction. Lemma 3.15 Let k ≥ 3 be a positive integer. Then the restriction of χ (2 k −2,2) to P 2 k has at least four linear constituents. Proof We adopt the notation used in Lemma 3.14. Then (3) implies that where is a character of P q × P q . The conclusion now follows from [5, Lemma 2.2].