Salim Rostam

Stuttering blocks of Ariki-Koike algebras

published or not. The documents may come

Introduction

It is known since Frobenius that the irreducible representations {D λ } λ of the symmetric group on n letters S n over a field of characteristic 0 are parametrised by the partitions of n, that is, sequences λ

= (λ 0 ≥ • • • ≥ λ h-1 > 0) of positive integers with |λ| := λ 0 + • • • + λ h-1 = n.
When the ground field is of prime characteristic p, the irreducible representations {D λ } λ are now indexed by the p-regular partitions of n. However, in this case some representations may not be written as a direct sum of irreducible ones. Hence, we are also interested in the blocks of the group algebra, that is, indecomposable two-sided ideals. Blocks also partition both sets of irreducible and indecomposable representations. Brauer and Robinson proved that these blocks are parametrised by the partitions of n that are p-cores (see §2.1), proving the so-called "Nakayama's Conjecture". We refer to [JaKe] for more details about the representation theory of the symmetric group.

More generally, we can consider a Hecke algebra of the complex reflection group G(r, 1, n) ≃ (Z/rZ) ≀ S n . Let F be a field and let q ∈ F \ {0, 1} be of finite order e ∈ N ≥2 , the "quantum characteristic". Let r ∈ N * and κ = (κ 0 , . . . , κ r-1 ) ∈ (Z/eZ) r . The Ariki-Koike algebra H κ n , or cyclotomic Hecke algebra of G(r, 1, n), is the unitary associative F -algebra defined by the generators S, T 1 , . . . , T n-1 and the relations r-1 k=0 (Sq κ k ) = 0,

ST 1 ST 1 = T 1 ST 1 S, ST a = T a S,
for all a ∈ {2, . . . , n -1}, (T a + 1)(T aq) = 0, for all a ∈ {1, . . . , n -1},

T a T b = T b T a ,
for all a, b ∈ {1, . . . , n -1} with |a -b| > 1, T a T a+1 T a = T a+1 T a T a+1 , for all a ∈ {1, . . . , n -2}

(see [ArKo, BMR]). Note that we may consider a more general version of the first relation (the cyclotomic relation for the generator S), but a Morita equivalence of Dipper and Mathas [DM] ensures that it suffices to understand this particular case where only powers of q are involved.

The algebra H κ n is a natural deformation of the group algebra of G(r, 1, n) and their representation theories are deeply linked. If r = 1, we recover the Hecke algebra H n of G(1, 1, n) ≃ S n , also known as the Hecke algebra of type A n-1 . In this case, the situation is similar to the one of the symmetric group: if H n is semisimple then its irreducible representations {D λ } λ are parametrised by the partitions of n, otherwise they are parametrised by the e-regular partitions of n while the blocks of H n are parametrised by the e-cores of n. In general, if H κ n is semisimple then its irreducible representations are parametrised by the r-partitions of n, that is, by the r-tuples λ = (λ (0) , . . . , λ (r-1) ) of partitions with |λ| := |λ (0) | + • • • + |λ (r-1) | = n. If H κ n is not semisimple, its irreducible representations {D λ } λ can be indexed by a non-trivial generalisation of e-regular partitions, known as Kleshchev r-partitions (see [START_REF] Ariki | The number of simple modules of the Hecke algebras of type G(r, 1, n)[END_REF][START_REF] Ariki | On the classification of simple modules for cyclotomic Hecke algebras of type G(m, 1, n) and Kleshchev multipartitions[END_REF]). Similarly, the naive generalisation of e-cores to r-partition, the e-multicores, do not parametrise in general the blocks of H κ n . In fact, Lyle and Mathas [LyMa] proved that the blocks of H κ n are parametrised by the multisets of κ-residues modulo e of the r-partitions of n (see §2.4). We can identify this parametrising set with a subset Q κ n of Q + := N Z/eZ and we denote by H κ α the block corresponding to α ∈ Q κ n . Moreover, to each r-partition λ of n we can associate an element α κ (λ) ∈ Q κ n . The blocks of H κ n partition the set of r-partitions of n via the map λ → α κ (λ). We say that the block indexed by α ∈ Q κ n contains the r-partition λ if α κ (λ) = α. Now let p ∈ N * dividing both r and e, let d := r p and η := e p and assume that κ is compatible with (d, η, p) (cf. (2.18)). The algebra H κ n has a natural subalgebra H κ p,n that is a Hecke algebra of the complex reflection group G(r, p, n) (see [START_REF] Ariki | Representation theory of a Hecke algebra of G(r, p, n)[END_REF][START_REF] Broué | Complex reflection groups, braid groups, Hecke algebras[END_REF] and also [Ro], where we emphasise the connection between these two papers). The subalgebra H κ p,n ⊆ H κ n is the subalgebra of fixed points of the automorphism σ of order p defined on the generators of H κ n by σ(S) = ζS, σ(T a ) = T a , for all a ∈ {1, . . . , n -1}, (

where ζ ∈ F × has order p. The representation theory of H κ p,n can be studied using Clifford theory, see for instance [START_REF] Ariki | Representation theory of a Hecke algebra of G(r, p, n)[END_REF][START_REF] Chlouveraki | Schur elements for the Ariki-Koike algebra and applications[END_REF][START_REF] Genet | Modular representations of cyclotomic Hecke algebras of type G(r, p[END_REF][START_REF] Hu | Decomposition numbers for Hecke algebras of type G(r, p, n): the (ǫ, q)-separated case[END_REF]. Let λ be a Kleshchev r-partition and let D λ be the irreducible H κ n -module indexed by λ. The restriction

D λ   H κ n H κ p,n
is isomorphic to a sum of irreducible H κ p,n modules. The number of irreducible H κ p,n -modules that appear depends on the cardinality of the orbit [λ] of λ = λ (0) , . . . , λ (r-1) under the shift action defined by σ λ := (λ (r-d) , . . . , λ (r-1) , λ (0) , . . . , λ (r-d-1) ).

A natural question is to determine the extreme cardinalities of the orbits under this action, and thus the extremal number of irreducible H κ p,n -module that appear during the restriction process. The answer is an easy exercise when considering all r-partitions of n. Already with this Proposition 1.2, we can give some results about the representation theory of H κ p,n , such as the number of "Specht modules" that appear in the restriction of Specht modules of H κ n to H κ p,n (as defined in [START_REF] Hu | Graded cellular bases for the cyclotomic Khovanov-Lauda-Rouquier algebras of type A[END_REF]). We can also prove that a natural basis of H κ p,n is not "adapted" cellular (cf. §5.2.5). In order to give block-analogue answers, we introduce a shift action on Q + . More precisely, for any α ∈ Q + we define σ • α by shifting coordinates by η and we write [α] for the orbit of α. The subalgebra H κ

[α] := ⊕ β∈[α] H κ β of H κ n is stable under σ : H κ n → H κ n , and we denote by H κ p, [α] the subalgebra of fixed points. The two shift actions that we have defined are compatible in the following way: if λ is an r-partition then α κ ( σ λ) = σ • α κ (λ) (see Lemma 2.28). Hence, if α := α κ (λ) we always have #[λ] ≥ # [α]. It is easy to see in small examples that we may have a strict inequality. However, the main results of this paper, Theorem 2.30 and Corollary 2.33, prove that equality holds if we allow us to choose among all r-partitions µ with α κ (µ) = α κ (λ). It leads to a more precise version of the "min part" of Proposition 1.2.

Theorem 1.3. Let λ be an r-partition and let α := α κ (λ). There exists an r-partition µ with α κ (µ) = α and #[µ] = # [α].

Wada [Wa] proved a more precise version of the "max part" of Proposition 1.2. In order to classify the blocks of H κ p,n , Wada proved that there (almost) always exists an r-partition µ with α κ (µ) = α and #[µ] = p. His proof uses the classification result of [LyMa] and is very short. In contrast, the proof of Theorem 1.3 that we present here is quite long and we did not find a way to use [LyMa]. At least, as in [LyMa], we use the abacus representation of partitions.

Theorem 1.3 allows us to give the block-analogues of the results for H κ p,n that we deduced from Proposition 1.2, that is, the same results but for H κ p, [α] instead of H κ p,n . We can also deduce from Theorem 1.3 some consequences about the blocks of H κ n . We say that an r-partition λ (respectively an element α ∈ Q + ) is stuttering if #[λ] = 1 (resp. #[α] = 1). By Theorem 1.3, we know that the block indexed by a stuttering α ∈ Q κ n always contains a stuttering r-partition. The paper is organised as follows. Section 2 is devoted to combinatorics. More specifically, in §2.1 we define partitions of integers and to each partition λ we associate an element α(λ) ∈ Q + = N Z/eZ . In §2.2 we recall the abacus representation of partitions. In §2.3, to an e-core λ we associate the e-abacus variable x = (x 0 , . . . , x e-1 ) ∈ Z e . The main fact of this subsection is the equality

α(λ) 0 = 1 2 e-1 i=0
x 2 i (cf. Proposition 2.14), which we recall from [Fa]. In §2.4 we extend the previous definitions to multipartitions, so we can in §2.5 define the two shift maps λ → σ λ and α → σ • α involved in the statement of our main results, Theorem 2.30 and Corollary 2.33. Theorem 2.30 is the case #[α] = 1 of Theorem 1.3 and Corollary 2.33 is the general case. Section 3 is devoted to technical tools that we need to prove Theorem 2.30. The reader who wants to focus on the proof of Theorem 2.30 may, in the first instance, skip this section. In §3.1, we study the existence of a chain of interchanges 1 0 0 1 ↔ 0 1 1 0 in a family of binary matrices (Corollary 3.8). In §3.2, we recall a special case of a general theorem of Gale [Ga] and Ryser [Ry] about the existence of a binary matrix with prescribed row and column sums. We apply the results of §3.1 to impose extra conditions on block sums (Proposition 3.14). Finally, we gathered in §3.3 some inequalities; in particular, Lemma 3.25 is a special case of a Jensen's inequality for strongly convex functions and Lemma 3.27 is an application to an inequality involving the fractional part map.

In Section 4, we prove the main result, Theorem 2.30. After a preliminary step in §4.1, we give in §4.2 a key lemma (Lemma 4.5), which reduces the proof of Theorem 2.30 to a (strongly) convex optimisation problem over the integers with linear constraints. We find in §4.3 a partial solution, in §4.4 we use Proposition 3.14 to find a solution and eventually in §4.5 we prove Theorem 2.30.

Finally, we give in Section 5 two applications of Corollary 2.33. The general idea is that we will have more precise results with Corollary 2.33 than with Proposition 1.2. We quickly recall in §5.1 the theory of cellular algebras of Graham and Lehrer [GrLe], the Ariki-Koike algebra H κ n and its blocks being particular cases. In §5.2 we use the map µ := p-1 j=0 σ j to construct a family of bases for

H κ p,[α] = µ(H κ [α]
) (Proposition 5.18). We deduce in §5.2.4 that H κ p, [α] is a cellular algebra if #[α] = p, and H κ p,n is cellular if p and n are coprime. Then, using Corollary 2.33, we show that if #[α] < p and p is odd then the bases that we constructed for H κ p, [α] are not adapted cellular (see §5.2.5). Finally, in §5.3, we study the maximal number of "Specht modules of H κ p,[α] " (see [START_REF] Hu | Graded cellular bases for the cyclotomic Khovanov-Lauda-Rouquier algebras of type A[END_REF]) that appear when restricting the Specht modules of H κ [α] to H κ p, [α] .

Combinatorics

In this section, we recall standard definitions of combinatorics such as (multi)partitions and their associated abaci. We also introduce two shift actions and then state our main result, Theorem 2.30. Let e ≥ 2 be an integer. We identify Z/eZ with the set {0, . . . , e -1}. We will use N = Z ≥0 to denote the set of non-negative integers and N * = Z >0 .

Partitions

A partition of n is a non-increasing sequence of positive integers λ = (λ 0 , . . . , λ h-1 ) of sum n. We will write |λ| := n and h(λ) := h. If λ is a partition, we denote by Y(λ) its Young diagram, defined by:

Y(λ) := (a, b) ∈ N 2 : 0 ≤ a ≤ h(λ) -1 and 0 ≤ b ≤ λ a -1 .
Example 2.1. We represent the Young diagram associated with the partition (4, 3, 3, 1) by .

We refer to the elements of N × N as nodes. For instance, the elements of Y(λ) are nodes.

A node γ ∈ Y(λ) is removable if Y(λ) \ {γ} is the Young diagram of a partition. Similarly, a node γ / ∈ Y(λ) is addable if Y(λ) ∪ {γ} is the Young diagram of a partition. A rim hook of λ is a subset of Y(λ) of the following form: r λ (a,b) := (a ′ , b ′ ) ∈ Y(λ) : a ′ ≥ a, b ′ ≥ b and (a ′ + 1, b ′ + 1) / ∈ Y(λ) ,
where (a, b) ∈ Y(λ). We say that r λ (a,b) is an l-rim hook if it has cardinality l. Note that 1-rim hooks are exactly removable nodes. The hand of a rim hook r

λ (a,b) is the node (a, b ′ ) ∈ r λ (a,b)
with maximal b ′ . The set Y(λ) \ r λ (a,b) is the Young diagram of a certain partition µ, obtained by unwrapping or removing the rim hook r λ (a,b) from λ. Conversely, we say that λ is obtained from µ by wrapping on or adding the rim hook r λ (a,b) . We say that a partition λ is an e-core if λ has no e-rim hook.

Example 2.2. We consider the partition λ := (3, 2, 2, 1). An example of a 3-rim hook is

r λ (2,0) = × × ×
, and a 4-rim hook is for instance

r λ (1,0) = × × × × .
We can check that λ has no 5-rim hook so it is a 5-core. We will see in §2.3 how to use abaci to easily know whether a partition is an e-core.

The residue of a node γ = (a, b) is res(γ) := ba (mod e). For any i ∈ Z/eZ, an i-node is a node with residue i. If λ is a partition, we denote by n i (λ) the multiplicity of i in the multiset of residues of all elements of Y(λ). Note that e-1 i=0 n i (λ) = |λ|. Let Q be a free Z-module of rank e and let {α i } i∈Z/eZ be a basis. We have Q = ⊕ e-1 i=0 Zα i and we define Q + := ⊕ e-1 i=0 Nα i . For any α ∈ Q, we denote by |α| ∈ Z the sum of its coordinates in the basis {α i } i∈Z/eZ . If λ is a partition we define

α(λ) := γ∈Y(λ) α res(γ) = e-1 i=0 n i (λ)α i ∈ Q + . Note that |α(λ)| = |λ|. More generally, if Γ is any finite subset of N 2 we will write α(Γ) := γ∈Γ α res(γ) . Remark 2.3. If r λ is an l-rim hook then α(r λ ) = l-1
i=0 α i 0 +i for some i 0 ∈ Z/eZ. In particular, if r λ is an e-rim hook then α(r λ ) = e-1 i=0 α i . Finally, if for α ∈ Q + there exists a partition λ such that α = α(λ), we say that α ∈ Q + is associated with λ. For an arbitrary α ∈ Q + , there can exist two different partitions λ = µ such that α = α(λ) = α(µ). However, if we restrict to e-cores then the map λ → α(λ) is one-to-one (see [START_REF] James | The Representation Theory of the Symmetric Group[END_REF]2.7.41 Theorem] or [LyMa]). Hence, the following subset of Q + :

Q * := α ∈ Q + : α is associated with some e-core ,
is in bijection with the set of e-cores. The aim of §2.3 is to explicitly construct a bijection between Q * and Z e-1 .

Abaci

The abacus representation of a partition has been first introduced by James [Jam]. Here, we follow the construction of [LyMa]. To a partition λ = (λ 0 , . . . , λ h-1 ) we associate the βnumber β(λ) defined as the sequence (λ a-1a) a≥1 , where λ a-1 := 0 for any a > h.

Lemma 2.4. The β-number of a partition λ is strictly decreasing and satisfies β(λ) a = -a for all a > h(λ). Conversely, if β = (β a ) a≥1 is a strictly decreasing sequence of integers with β a = -a for all a ≫ 1 then β is the β-number of some partition.

The following result is well-known (see for instance [START_REF] James | The Representation Theory of the Symmetric Group[END_REF]2.7.13 Lemma]).

Lemma 2.5. Let l ∈ N * . A partition λ has an l-rim hook if and only if there is an element

b ∈ β(λ) such that b-l / ∈ β(λ).
In that case, if µ is the partition that we obtain by removing this l-rim hook, then β(µ) is obtained by replacing b by bl in β(λ) and then sorting in decreasing order.

In particular, if µ is a partition and if b ∈ β(µ) and l ∈ N * are such that b + l / ∈ β(µ), then replacing b by b + l in β(µ) and sorting in decreasing order is equivalent to adding an l-rim hook to µ. Indeed, by Lemma 2.4 the sequence that we obtain from β(µ) is the β-number of a certain partition λ, and by Lemma 2.5 the partition µ is obtained from λ by unwrapping an l-rim hook. That is, the partition λ is obtained from µ by wrapping on an l-rim hook (see also [START_REF] Mathas | Hecke Algebras and Schur Algebras of the Symmetric Group[END_REF]Lemma 5.26]).

Lemma 2.5 ensures that for any partition λ, there is a unique e-core λ that can be obtained by successively removing e-rim hooks. We say that λ is the e-core of λ, and the number of e-rim hooks that we remove to obtain λ from λ is the e-weight of λ. We now consider an abacus with e-runners, each runner being a horizontal copy of Z and displayed in the following way: the 0th runner is on top and the origins of each copy of Z are aligned with respect to a vertical line. We record the elements of β(λ) on this abacus according to the following rule: there is a bead at position j ∈ Z on the runner i ∈ {0, . . . , e -1} if and only if there exists a ≥ 1 such that β(λ) a = i + je. We say that this abacus is the e-abacus associated with λ. Note that, for any i ∈ {0, . . . , e -1} and j ≫ 0, on runner i there is a bead at position -j (by Lemma 2.4) and a gap (that is, no bead) at position j.

Example 2.6. We consider the partition λ = (3, 2, 2, 1) from Example 2.2. Its β-number is β(λ) = (2, 0, -1, -3, -5, . . . ). The associated 3-abacus is Recall that counting the number of gaps up each bead (continuing counting on the left starting from the (e -1)th runner when reaching the 0th one) recovers the underlying partition.

Let λ be a partition and let us consider its associated e-abacus. We give the abacus interpretation of Lemma 2.5 in the two particular cases l = 1 and l = e. Note that for any a ∈ {1, . . . , h(λ)}, we have

β(λ) a = i (mod e) if and only if (a -1, λ a-1 -1) ∈ Y(λ) is an i-node.
Corollary 2.7.

• We can move a bead on position j ∈ Z on runner i ∈ {0, . . . , e -1} to the previously free position j on runner i -1 (to the previously free position j -1 on runner e -1 if i = 0) if and only if λ has a removable i-node.

• We can move a bead on position j on runner i to the previously free position j on runner i + 1 (to the previously free position j + 1 on runner 0 if i = e -1) if and only if λ has an addable (i + 1)-node.

Corollary 2.8.

• We can slide a bead on position j on runner i to the previously free position j -1 on the same runner if and only if λ has an e-rim hook of hand residue i. Hence, the partition λ is an e-core if and only if its associated e-abacus has no gap, that is, no bead has a gap on its left.

• We can slide a bead on position j on runner i to the previously free position j + 1 on the same runner if and only if λ has an addable e-rim hook of hand residue i. Hence, we can always add an e-rim hook of hand residue i to λ.

Example 2.9. We consider the partition λ = (3, 2, 2, 1) of Example 2.2. Recall that we gave in Example 2.6 the e-abaci for e ∈ {3, 4, 5}. The 3-abacus of λ has only one gap thus r λ (2,0) is the only 3-rim hook that we can remove. The 4-abacus of λ has two gaps, corresponding to the two lonely beads on runners 0 and 2. Sliding left the bead on runner 2 (respectively 0) corresponds to removing the 4-rim hook r λ (0,1)

= × × × × (resp. r λ (1,0) = × × × ×
). The hand residue, in blue (resp. red), matches since the multiset of residues is given by 0 1 2 2 0 1 2 0 . The 5-abacus of λ has no gap thus λ is a 5-core, as we saw in Example 2.2.

Parametrisation of Q *

In this subsection, we will parametrise by Z e-1 the set Q * of all α ∈ Q + that are associated with e-cores. Given an e-abacus associated with an e-core λ and i ∈ {0, . . . , e -1}, let us write x i (λ) ∈ Z for the position of the first gap on the runner i. We say that x 0 (λ), . . . , x e-1 (λ) are the parameters of the e-abacus, or the e-abacus variables of λ. We will also use the notation

x(λ) = x 0 (λ), . . . , x e-1 (λ) ∈ Z e .
Example 2.10. We use to denote the position of each x i (λ). The 3-abacus associated with the empty partition (which is a 3-core indeed), of associated β-number (-1, -2, . . . ), is

x 0 (λ) = x 2 (λ) = 1, x 1 (λ) = x 3 (λ) = -1, x 4 (λ) = 0.
We have the following consequences of Corollary 2.7.

Lemma 2.11. Let λ be an e-core. For all i ∈ {0, . . . , e -1} we have x i (λ) = n i (λ)n i+1 (λ).

Proof. We construct the partition λ adding nodes one by one. By Corollary 2.7, the runner i is involved exactly when adding an i-node or an (i + 1)-node, which corresponds to a bead going from runner i -1 to i and runner i to i + 1 respectively. Thus, once the e-core λ is constructed exactly n i (λ) (respectively n i+1 (λ)) beads were added to (resp. removed from) runner i. We conclude since x i (∅) = 0.

Corollary 2.12. Let λ be an e-core. For all i ∈ {1, . . . , e -1} we have

n i (λ) = n 0 (λ) -x 0 (λ) - • • • -x i-1 (λ).
Proposition 2.13. Let x 0 , . . . , x e-1 ∈ Z. Then x 0 + • • • + x e-1 = 0 if and only if there is an e-core λ such that x i = x i (λ) for all i ∈ {0, . . . , e -1}.

Proof. If λ is an e-core then Lemma 2.11 ensures that x 0 (λ) + • • • + x e-1 (λ) = 0. Now let x 0 , . . . , x e-1 ∈ Z such that x 0 + • • • + x e-1 = 0 and consider the e-abacus A of parameters x 0 , . . . , x e-1 . That is, the runner i is full of beads before position x i -1 and has only gaps after position x i . For any i, j ∈ {0, . . . , e -1}, we consider the operation t i,j that moves the rightmost bead on runner i to the leftmost gap on runner j. We have t -1 i,j = t j,i , and by Corollaries 2.7 and 2.8 the operation t i,j preserves the set of e-abaci associated with ecores. After the operation t i,j , the parameter x i (respectively x j ) decreases (resp. increases) by 1 and thus the new parameters that we obtain still sum to 0. By induction on max i x i , we can find a sequence t i 1 ,j 1 , . . . , t i k ,j k of operations so that the parameters of the e-abacus A := t i k ,j k • • • t i 1 ,j 1 (A) are all zero. Hence, the e-abacus A corresponds to the empty e-core, and we conclude since

A = t j 1 ,i 1 • • • t j k ,i k ( A).
We thus have a bijection {e-cores}

1:1 ←→ {(x 0 , . . . , x e-1 ) ∈ Z e : x 0 + • • • + x e-1 = 0} =: Z e 0 .
The function n 0 defined on the set of e-cores is a symmetric polynomial in x 0 , . . . , x e-1 . Indeed, exchanging the runners i and i + 1 for any i ∈ {0, . . . , e -2} only modifies the number of (i + 1)-nodes (by Corollary 2.7) and we conclude since the symmetric group S({0, . . . , e -1}) is generated by the transpositions (i, i + 1) for all i ∈ {0, . . . , e -2}. We explicitly give this symmetric polynomial in the following proposition, where • denotes the Euclidean norm on tuples of integers.

Proposition 2.14. Let λ be an e-core. We have:

n 0 (λ) = 1 2 x(λ) 2 = 1 2 e-1 i=0 x i (λ) 2 .
Proof. Since λ is an e-core, it has e-weight 0 and thus the result immediately follows from Lemma 2.11 and [Fa, Proposition 2.1] (see also [START_REF] Garvan | Cranks and t-cores[END_REF]Bijection 2] and [Ol, top of page 24]).

Remark 2.15. Let λ be an e-core. Using Corollary 2.12 and Proposition 2.14 we obtain

n i (λ) = 1 2 x(λ) 2 -x 0 (λ) -• • • -x i-1 (λ),
for all i ∈ {1, . . . , e -1}.

Example 2.16. We take p = 2 and e = 4. We consider the parameter x := (2, -1, -1, 0) ∈ Z 4 0 . The corresponding 4-abacus is is then (4,0,. . . ) and this corresponds to the 4-core λ = (5, 2, 2). The multiset of residues is 0 1 2 3 0 3 0 2 3 andthe number of 0-nodes is 3 = 1 2 (2 2 + 1 2 + 1 2 + 0 2 ).

Example 2.17. We take p = e = 3. We consider the parameter x := (1, 2, -3) ∈ Z 3 0 . The corresponding 3-abacus is:

. . . . . . . . . . . . . . . . . . ,
the β-number is then (4, 1, 0, -2, -3, -5, -6, -8, -9, . . . ) and this corresponds to the 4-core λ = (5, 3, 3, 2, 2, 1, 1). The multiset of residues is 0 1 2 0 1 2 0 1 1 2 0 0 1 2 0 1 0 and the number of 0-nodes is

7 = 1 2 (1 2 + 2 2 + 3 2 ).

Multipartitions

Let d, η, p ∈ N * and assume that e = ηp. We define r := dp and we identify Z/rZ with the set {0, . . . , r -1}. Let κ = (κ 0 , . . . , κ r-1 ) ∈ (Z/eZ) r be a multicharge. An r-partition (or multipartition) of n is an r-tuple λ = (λ (0) , . . . , λ (r-1) ) of partitions such that |λ|

:= |λ (0) | + • • • + |λ (r-1) | = n. We write λ ∈ P κ n if λ is an r-partition of n. We say that κ is compatible with (d, η, p) when κ k+d = κ k + η, for all k ∈ Z/rZ. (2.18)
Thus, the multicharge κ is compatible with (d, η, p) if and only if

κ = κ 0 , . . . , κ d-1 , κ 0 + η, . . . , κ d-1 + η, . . . . . . , κ 0 + (p -1)η, . . . , κ d-1 + (p -1)η . (2.19) Example 2.20. If d = 1 and η = p = 2 (thus e = 4 and r = 2), the multicharge κ := (0, 2) ∈ (Z/4Z) 2 is compatible with (d, η, p).
The Young diagram of an r-partition λ = (λ (0) , . . . , λ (r-1) ) is the subset of N 3 defined by

Y(λ) := r-1 c=0 Y(λ (c) ) × {c} . A node is any element of N × N × {0, . . . , r -1}, for instance, any element of Y(λ) is a node. The κ-residue of a node γ = (a, b, c) is res κ (γ) := b -a + κ c (mod e).
For any i ∈ Z/eZ, we denote by n i κ (λ) its multiplicity in the multiset of κ-residues of all elements of Y(λ). We also define

α κ (λ) := γ∈Y(λ) α resκ(γ) = e-1 i=0 n i κ (λ)α i ∈ Q + .
We have |α κ (λ)| = |λ|. These quantities α κ (λ) were used by Lyle and Mathas [LyMa] to parametrise the blocks of H κ n . More precisely, the cellularity of the algebra H κ n allows to associate to each r-partition λ of n a block of H κ n (see Lemma 5.3 and §5.2.2): the main result of [LyMa] is that an r-partition µ of n has the same associated block as λ if and only if α κ (µ) = α κ (λ). In this case, we say that λ and µ belong to the same block of H κ n . Finally, if λ = (λ (0) , . . . , λ (r-1) ) is an r-partition, its e-multicore is the r-partition λ := λ (0) , . . . , λ (r-1) . We say that λ is an e-multicore if λ = λ, that is, if each λ (k) for k ∈ {0, . . . , r -1} is an e-core, in which case we write

x (k) (λ) := x λ (k) ∈ Z e 0 ,
for the parameter of the e-abacus associated with the e-core λ (k) . We write

x (k) (λ) = x (k) 0 (λ), . . . , x (k) e-1 (λ) , so that x (k) i (λ) := x i λ (k) for any i ∈ {0, . . . , e -1}.
Remark 2.21. For ordinary partitions, which are 1-partitions, we recover the definitions of §2.1 if κ = 0. In particular, if λ is a partition then n i (λ) = n i 0 (λ) for all i ∈ {0, . . . , e -1} and α(λ) = α 0 (λ). Moreover, if λ is an e-core then x (0) (λ) = x(λ). Remark 2.22. Contrary to [LyMa], we do not shift by κ k the definition of the β-number (and thus the e-abacus) for λ (k) . While the convention used by [LyMa] behaves well towards adding and removing i-nodes (more generally, concerning Lemma 2.5), the one we use is more adapted to detect when two components of λ are equal (see §2.5).

The next lemma is straightforward.

Lemma 2.23. Let λ be a partition and i, δ, κ * ∈ Z/eZ. We have

n i κ * +δ (λ) = n i-δ κ * (λ)
. We now give a generalisation of Lemma 2.11 and Proposition 2.14 in the setting of multipartitions. Recall that we identify {0, . . . , e -1} (respectively {0, . . . , r -1}) with Z/eZ (resp. Z/rZ).

Lemma 2.24. Let λ be an e-multicore. For all i ∈ {0, . . . , e -1} we have

n i κ (λ) -n i+1 κ (λ) = r-1 k=0 x (k) i-κ k (λ).
Proof. Write λ = λ (0) , . . . , λ (r-1) and let i ∈ {0, . . . , e -1}. By Lemmas 2.11 and 2.23 we have

n i κ (λ) -n i+1 κ (λ) = r-1 k=0 n i κ k (λ (k) ) -n i+1 κ k (λ (k) ) = r-1 k=0 n i-κ k (λ (k) ) -n i+1-κ k (λ (k) ) = r-1 k=0 x i-κ k (λ (k) ). = r-1 k=0 x (k) i-κ k (λ).
Finally, for any i ∈ {0, . . . , e -1} define L i (x) := i-1 i ′ =0 x i ′ for all x ∈ Z e . By Corollary 2.12, if λ = λ (0) , . . . , λ (r-1) is an e-multicore we have

n 0 κ (λ) = r-1 k=0 n 0 κ k (λ (k) ) = r-1 k=0 n -κ k (λ (k) ) = r-1 k=0 n 0 (λ (k) ) -L -κ k x (k) (λ) .
Hence, by Proposition 2.14,

n 0 κ (λ) = r-1 k=0 1 2 x (k) (λ) 2 -L -κ k x (k) (λ) .
(2.25)

Shifts

We are now ready to define our two shift maps.

Definition 2.26. Recall that e is determined by η and p. For any i ∈ Z/eZ we define σ η,p •α i := α i+η ∈ Q + , and we extend σ η,p to a Z-linear map Q → Q.

Definition 2.27. Recall that r is determined by d and p. If λ = (λ (0) , . . . , λ (r-1) ) is an r-partition, we define

σ d,p λ := (λ (r-d) , . . . , λ (r-1) , λ (0) , . . . , λ (r-d-1) ).
Note that σ η,p and σ d,p are the identity maps when p = 1 (thus η = e and d = r). For any α ∈ Q + , we denote by P κ α the subset of P κ n given by r-partitions λ such that α κ (λ) = α. The two shifts of Definitions 2.26 and 2.27 are compatible in the following way.

Lemma 2.28. Assume that the multicharge κ is compatible with (d, η, p). If λ is an r-partition then α κ ( σ d,p λ) = σ η,p • α κ (λ). In other words, the map σ d,p induces a bijection between P κ α and P κ ση,p•α .

Proof. Recall that we are identifying Z/eZ (respectively Z/rZ) with {0, . . . , e-1} (resp. {0, . . . , r-1}). We write λ = λ (0) , . . . , λ (r-1) . Using the compatibility equation (2.18) for the multicharge κ and Lemma 2.23 we have

α κ ( σ d,p λ) = α κ λ (r-d) , . . . , λ (r-1) , λ (0) , . . . , λ (r-d-1) = e-1 i=0 n i κ λ (r-d) , . . . , λ (r-1) , λ (0) , . . . , λ (r-d-1) α i = e-1 i=0 r-1 k=0 n i κ k λ (r-d+k) α i = e-1 i=0 r-1 k=0 n i κ k λ (k-d) α i = e-1 i=0 r-1 k=0 n i κ k+d λ (k) α i = e-1 i=0 r-1 k=0 n i κ k +η λ (k) α i = e-1 i=0 r-1 k=0 n i-η κ k λ (k) α i = e-1 i=0 r-1 k=0 n i κ k λ (k) α i+η = σ η,p • e-1 i=0 r-1 k=0 n i κ k λ (k) α i = σ η,p • e-1 i=0 n i κ λ (0) , . . . , λ (r-1) α i = σ η,p • α(λ),
as desired. The second statement follows.

Lemma 2.29. Let p ′ be an integer that divides p and assume that the multicharge κ is compatible with (d, η, p). Then κ is compatible with p ′ d, p ′ η, p p ′ and

σ p ′ η,p = σ p ′ η, p p ′ , in Q + , σ p ′ d,p = σ p ′ d, p p ′ , on r-partitions. Proof. We have r = dp = (p ′ d) p p ′ and e = pη = p p ′ (p ′ η). Since κ is compatible with (d, η, p) we have κ i+d = κ i + η for all i ∈ Z/rZ thus κ i+p ′ d = κ i + p ′ η, which means that κ is compatible with p ′ d, p ′ η, p p ′ .
We conclude applying Definitions 2.26 and 2.27.

We can now state the main theorem of the paper, which will be proved in Section 4.

Theorem 2.30. Let λ be an r-partition and let α := α κ (λ) ∈ Q + . Assume that κ is compatible with (d, η, p). If σ η,p • α = α then there is an r-partition µ ∈ P κ α with σ d,p µ = µ.

We say that an r-partition µ as in Theorem 2.30 is stuttering. Note that when p = 1, all r-partitions are stuttering. We will often drop the subscripts and only write σ for σ d,p and σ η,p when the meaning is clear from the context.

Example 2.31. We consider the setting of Example 2.20 and the bipartition λ := (5, 2, 1), (1, 1) . The multiset of κ-residues is

0 1 2 3 0 3 0 2 2 1 , thus α κ (λ) = 3(α 0 +α 2 )+2(α 1 +α 3 ) =: α. Hence, we have σ •α = α but σ λ = (1, 1), (5, 2, 1) = λ.
We now consider the partition µ := (3, 1, 1). The residue multiset of the bipartition (µ, µ) is

0 1 2 3 2 2 3 0 1 0 , thus α κ (µ, µ) = 3(α 0 + α 2 ) + 2(α 1 + α 3 ) = α.
Hence, the stuttering bipartition (µ, µ) is as in Theorem 2.30.

Remark 2.32. Two particular cases of Theorem 2.30 easily follow from Lemma 2.28. Let λ be an r-partition and let α := α κ (λ).

(i) If σ λ = λ then σ • α = α and there is nothing to prove.

(ii) If σ • α = α and if λ is the only r-partition in P κ α (e.g. when the associated Ariki-Koike algebra is semisimple, see [START_REF] Ariki | On the Semi-simplicity of the Hecke algebra of (Z/rZ) ≀ S n[END_REF]) then σ λ ∈ P κ σ•α = P κ α thus σ λ = λ.

Let us denote by [λ] (respectively by [α]

) the orbit of an r-partition λ (resp. of α ∈ Q + ) under the action of σ. We now state Theorem 1.3 from the introduction.

Corollary 2.33. Assume that κ is compatible with (d, η, p)

and let α ∈ Q + such that P κ α is not empty. Then #[α] is the smallest element of the set {#[λ] : λ ∈ P κ α }.
In other words, if λ is an r-partition and α := α κ (λ), if σ j • α = α for some j ∈ {0, . . . , p -1} then there exists an r-partition µ such that α κ (µ) = α and σ j µ = µ.

Proof. The second part of the statement is clear. Let C be the set {#[λ] : λ ∈ P κ α } and let us prove that #[α] is the smallest element of C. For each λ ∈ P κ α , by Lemma 2.28 we have

α κ ( σ λ) = σ • α κ (λ) thus #[λ] ≥ #[α], hence #[α] is a lower bound of C.
To prove that it is the smallest element, it suffices to prove that there is an r-partition

µ ∈ P κ α such that #[µ] ≤ #[α]. Write p ′ := #[α].
σ p ′ η, p p ′ • α = α.
Hence, by Theorem 2.30 applied with (p ′ d, p ′ η, p p ′ ) we know that there is an r-partition µ ∈ P κ α such that

σ dp ′ , p p ′ µ = µ,
that is, by another application of Lemma 2.29,

σ p ′ d,p µ = µ.
Hence, we have #[µ] ≤ p ′ and we conclude since

p ′ = #[α].
Remark 2.34. We saw that Lyle and Mathas [LyMa] proved that two r-partitions are in a same P κ α if and only if they belong to the same block of H κ n . Thus, Corollary 2.33 gives a little information about the r-partitions that belong to each block. As we mentioned in the introduction, Wada [Wa] proved that the maximum of the set {#[λ] : λ ∈ P κ α } of Corollary 2.33 is always p, provided that this set has at least two elements. His proof is very short but relies on the (non trivial) fact that if λ and µ are in P κ α then they are Jantzen equivalent (cf. [LyMa]). On the contrary, we did not find a way to use [LyMa] to prove Theorem 2.30.

We conclude this section by a reduction step for our main theorem. We assume that the multicharge κ is compatible with (d, η, p). For any ℓ ∈ {0, . . . , d -1}, we define the multicharge

κ (ℓ) ∈ (Z/eZ) p by κ (ℓ) := (κ ℓ , κ ℓ+d , . . . , κ ℓ+(p-1)d ) = (κ ℓ , κ ℓ + η, . . . , κ ℓ + (p -1)η).
(2.35)

We first need the following lemma.

Lemma 2.36. Let ℓ ∈ {0, . . . , d -1}, let λ be a partition and let µ be a partition obtained from λ by wrapping on an η-rim hook. We define the two p-partitions λ p and µ p by λ p := (λ, . . . , λ) and µ p := (µ, . . . , µ).

If α := α κ (ℓ) (λ p ) and β := α κ (ℓ) (µ p ) then β = α + α 0 + • • • + α e-1 .
Proof. By Remark 2.3, we have

α κ ℓ (µ) = α κ ℓ (λ) + α i 0 + • • • + α i 0 +η-1
for some i 0 ∈ Z/eZ. Thus, for any j ∈ {0, . . . , p -1} we have

α κ ℓ +jη (µ) = σ j • α κ ℓ (µ) = σ j • α κ ℓ (λ) + η-1 i=0 σ j • α i 0 +i = α κ ℓ +jη (λ) + η-1 i=0 α i 0 +i+jη .
We obtain

β = α κ (ℓ) (µ p ) = p-1 j=0 α κ ℓ +jη (µ) = p-1 j=0 α κ ℓ +jη (λ) + p-1 j=0 η-1 i=0 α i 0 +i+jη = α κ (ℓ) (λ p ) + α 0 + • • • + α e-1 = α + α 0 + • • • + α e-1 .
Proposition 2.37. It suffices to prove Theorem 2.30 for the e-multicores.

Proof. Let λ be an r-partition such that σ • α κ (λ) = α κ (λ) and let λ be its e-multicore. By definition of the e-multicore and by Remark 2.3, we have α κ (λ) = α κ (λ) + w e-1 i=0 α i where w ∈ N is the number of e-rim hooks that we need to wrap on to obtain λ from λ. Since α κ (λ) and e-1 i=0 α i are both stable by σ, we have σ • α κ (λ) = α κ (λ). If Theorem 2.30 is true for the e-multicore λ, we can find a stuttering r-partition µ = σ µ with α κ ( µ) = α κ (λ). Write µ = ( µ (0) , . . . , µ (r-1) ) and let µ (0) be a partition obtained by wrapping on w times an η-rim hook to µ (0) . We define µ (jd) := µ (0) , for all j ∈ {1, . . . , p -1},

µ (k) := µ (k) , for all k ∈ {0, . . . , r -1} \ {0, d, . . . , (p -1)d}.
The r-partition µ := (µ (0) , . . . , µ (r-1) ) satisfies µ = σ µ. Moreover, since µ (0) = µ (jd) for all j ∈ {1, . . . , p -1}, we can apply w times Lemma 2.36 with ℓ := 0 starting from the p-partition µ (0) , . . . , µ (0) . We obtain

α κ (µ) = α κ (0) µ (0) , . . . , µ (0) + d-1 ℓ=1 α κ (ℓ) µ (ℓ) , . . . , µ (ℓ) = α κ (0) µ (0) , . . . , µ (0) + w e-1 i=0 α i + d-1 ℓ=1 α κ (ℓ) µ (ℓ) , . . . , µ (ℓ) = α κ ( µ) + w e-1 i=0 α i = α κ (λ) + w e-1 i=0 α i = α κ (λ).
Hence, Theorem 2.30 is proved for λ.

Remark 2.38. Since the η-rim hooks that we wrap on are arbitrary, the stuttering r-partition in Theorem 2.30 is not unique in general. Moreover, using the same idea of wrapping on η-rim hooks we can easily prove Theorem 2.30 in the particular case η = 1 (that is, p = e). Finally, if λ and µ are as in Theorem 2.30 and if λ is an e-multicore, then µ is not necessarily an e-multicore.

Binary tools and inequalities

In this section, we introduce two technical tools that we will need to prove Theorem 2.30. In §3.1, given a family of binary matrices satisfying some conditions, our aim is to prove that we can find a series of compatible submatrices 1 0 0 1 . We will need to study some particular cases (Lemma 3.6 and Proposition 3.7) before stating the main result, Corollary 3.8. We use this result to prove in §3.2 the existence of a binary matrix with prescribed row, (partial) column and block sums. Finally, we will give §3.3 some inequalities. The first one will be reminiscent of the binary setting, and the others will use convexity.

We use |•| : R n → R to denote the sum of the coordinates (we warn the reader that we do not take the sum of the absolute values) and we write • for the Euclidean norm.

Binary matrices

Given two matrices with entries in {0, 1} whose row sums (respectively column sums) are pairwise equal, we can get from the one to the other by replacing submatrices 1 0 0 1 by 0 1 1 0 (cf. [Ry]). These interchanges do not change the row or column sums, however they may change block sums. The results of this section, particularly Corollary 3.5, will be used to prove Proposition 3.14 in §3.2, where we show the existence of a binary matrix with prescribed row, column and block sums. Note that Chernyak and Chernyak [ChCh] considered matrices with prescribed row, column and block sums, but they did not study the existence problem.

We call binary matrix a matrix with entries in {0, 1}. If M is an m × n binary matrix, we write M ℓk for its entry at (ℓ, k) ∈ {1, . . . , m} × {1, . . . , n}. We denote by γ ℓ,k (M ) the binary matrix that we obtain from M by changing the entry (ℓ, k) to 1 -M ℓk . We write R ℓ (M ) for the ℓth row of M . Note that if |M | denotes the sum of the entries of

M then |M | = ℓ |R ℓ (M )|.
Finally, if the number of rows of M is even, we will systematically write M = M + M -where M + and M -have the same size, and we define

γ ± ℓ,k (M ) := γ ℓ,k (M + ) γ ℓ,k (M -) . Definition 3.1. Let A = A + A -and B = B +
B -be two binary matrices with the same even number of rows. We say that the matrix 1 0 0 1 is a compatible submatrix of A B if there exist ℓ, k, k ′ such that

A + ℓk = 1, B + ℓk ′ = 0, A - ℓk = 0, B - ℓk ′ = 1.
In that case, we will write

A |= ℓ,k,k ′ B. We denote by γ ℓ,k,k ′ (A, B) := γ ± ℓ,k (A), γ ± ℓ,k ′ (B)
the pair of binary matrices that we obtain if we replace the submatrix 1 0 0 1 by 0 1 1 0 .

Example 3.2. We consider the binary matrices A = A + A -and B = B + B -defined by

A + := 1 1 0 0 , B + := 1 0 0 0 1 0 , A -:= 1 0 0 1 , B -:= 1 0 1 1 0 1 .
The red entries prove that A |= 1,2,3 B. With ( A, B) := γ 1,2,3 (A, B), we have

A + := 1 0 0 0 , B + := 1 0 1 0 1 0 , A -:= 1 1 0 1 , B -:= 1 0 0 1 0 1 .
If A and B are two binary matrices with the same even number of rows, the set of all pairs

γ ℓ,k,k ′ (A, B) where ℓ, k, k ′ are such that A |= ℓ,k,k ′ B is denoted by Γ(A, B). Moreover, we will write A |= B if the set Γ(A, B) is non-empty, that is, if there exist ℓ, k, k ′ such that A |= ℓ,k,k ′ B.
We can generalise these notations to a family (A i ) 1≤i≤n of binary matrices with the same even number of rows. Let ((ℓ i , k i , k ′ i )) 1≤i≤n-1 be a family of triples such that

A i |= ℓ i ,k i ,k ′ i A i+1 , for all i ∈ {1, . . . , n -1}. For any i ∈ {2, . . . , n -1} we have A i-1 |= ℓ i-1 ,k i-1 ,k ′ i-1 A i |= ℓ i ,k i ,k ′ i A i+1 , thus, according to Definition 3.1, (ℓ i-1 , k ′ i-1 ) = (ℓ i , k i ).
Hence, for all i ∈ {2, . . . , n -1} we have

A i-1 |= ℓ i-1 ,k i-1 ,k ′ i-1 γ ± ℓ i ,k i (A i ), γ ± ℓ i-1 ,k ′ i-1 (A i ) |= ℓ i ,k i ,k ′ i A i+1 , and γ ± ℓ i ,k i γ ± ℓ i-1 ,k ′ i-1 (A i ) = γ ± ℓ i-1 ,k ′ i-1 γ ± ℓ i ,k i (A i ) . (3.3) We denote by γ ((ℓ i ,k i ,k ′ i )) 1≤i≤n-1 ((A i ) 1≤i≤n ) the family ( A i ) 1≤i≤n defined by A 1 := γ ± ℓ 1 ,k 1 (A 1 ), A i := γ ± ℓ i ,k i γ ± ℓ i-1 ,k ′ i-1 (A i ) , for all i ∈ {2, . . . , n -1}, A n := γ ± ℓ n-1 ,k ′ n-1 (A n ).
By (3.3), no choice has been made to define A i for i ∈ {2, . . . , n -1}. Finally, we denote by

Γ(A 1 , . . . , A n ) the set of all families γ ((ℓ i ,k i ,k ′ i )) 1≤i≤n-1 (A i ) 1≤i≤n where (ℓ i , k i , k ′ i ) 1≤i≤n-1 is such that A 1 |= ℓ 1 ,k 1 ,k ′ 1 • • • |= ℓ n-1 ,k n-1 ,k ′ n-1
A n , and we will write

A 1 |= • • • |= A n if Γ(A 1 , . . . , A n ) is non-empty.
The following properties are straightforward from the definition.

Proposition 3.4. Let A and B be two binary matrices with the same even number of rows such that

A |= ℓ,k,k ′ B. If ( A, B) := γ ℓ,k,k ′ (A, B) then A + ℓk = A + ℓk -1, B + ℓk ′ = B + ℓk ′ + 1, A - ℓk = A - ℓk + 1, B - ℓk ′ = B - ℓk ′ -1,
the other entries being unchanged. Hence, the following equalities are satisfied:

A + ℓk + A - ℓk = A + ℓk + A - ℓk , B + ℓk ′ + B - ℓk ′ = B + ℓk ′ + B - ℓk ′ , R ℓ ( A + ) + R ℓ ( B + ) = R ℓ (A + ) + R ℓ (B + ), R ℓ ( A -) + R ℓ ( B -) = R ℓ (A -) + R ℓ (B -), and
| A + | = |A + | -1, | B + | = |B + | + 1, | A -| = |A -| + 1, | B -| = |B -| -1. As a consequence, if A |= B |= C and ( A, B, C) ∈ Γ(A, B, C) then | B + | = |B + | and | B -| = |B -|.
Corollary 3.5. Let (A i ) 1≤i≤n be a family of binary matrices with the same even number of rows. Assume that i 0 , . . . , i s are distinct integers such that A i 0 |= . . . |= A is and let

( A i 0 , . . . , A is ) ∈ Γ(A i 0 , . . . , A is ). Then | A + i 0 | = |A + i 0 | -1, | A + is | = |A + is | + 1, | A - i 0 | = |A - i 0 | + 1, | A - is | = |A - is | -1,
and for all t ∈ {1, . . . , s -1} we have

| A + it | = |A + it |, | A - it | = |A - it |.
The following, easy to prove, lemma is very important in the proof of Proposition 3.14.

Lemma 3.6. Let A and B be two binary matrices with the same even number of rows. We assume that

|R ℓ (A + )| + |R ℓ (B + )| = |R ℓ (A -)| + |R ℓ (B -)|, for all ℓ, |A + | > |A -|. Then A |= B. Proof. Since |A + | > |A -|, there is some ℓ such that |R ℓ (A + )| > |R ℓ (A -)|.
Since the matrices have their entries in {0, 1}, for all k we have

A + ℓk A - ℓk ∈ 0 0 , 1 0 , 1 1 , 0 1 .
Thus, there is some k such that

A + ℓk A - ℓk = 1 0
. Moreover, we have

|R ℓ (B + )| = |R ℓ (B -)| + |R ℓ (A -)| -|R ℓ (A + )| < |R ℓ (B -)|.
Again, we deduce that there is some k ′ such that

B + ℓk ′ B - ℓk ′ = 0 1
. Finally, we have

A + ℓk = 1, B + ℓk ′ = 0, A - ℓk = 0, B - ℓk ′ = 1, thus A |= B.
Let us now give a generalisation of Lemma 3.6 to an arbitrary number of matrices.

Proposition 3.7. Let (A i ) 1≤i≤n be a family of binary matrices with the same even number of rows. We assume that

n i=1 |R ℓ (A + i )| = n i=1 |R ℓ (A - i )|, for all ℓ, |A + 1 | > |A - 1 |, |A + i | ≥ |A - i |, for all i ∈ {2, . . . , n -1}.
Then there exists a sequence 1 < i 1 , . . . , i s-1 < n of distinct integers such that

A 1 |= A i 1 |= A i 2 |= . . . |= A i s-1 |= A n .
Proof. We consider the following binary matrices with an even number of rows:

B 1 := A 2 A 3 • • • A n-1 A n .
For each ℓ we have

|R ℓ (B + 1 )| = n i=2 |R ℓ (A + i )| and |R ℓ (B - 1 )| = n i=2 |R ℓ (A - i )|. Thus, |R ℓ (A + 1 )| + |R ℓ (B + 1 )| = n i=1 |R ℓ (A + i )| = n i=1 |R ℓ (A - i )| = |R ℓ (A - 1 )| + n i=2 |R ℓ (A - i )| |R ℓ (A + 1 )| + |R ℓ (B + 1 )| = |R ℓ (A - 1 )| + |R ℓ (B - 1 )|. Since |A + 1 | > |A - 1 |
, we can apply Lemma 3.6 to the matrices A and B 1 . Hence, if we define I 1 as the set of integers i ∈ {2, . . . , n} such that A 1 |= A i , then I 1 is not empty. If n ∈ I 1 then the proof is over, and otherwise we start an induction. Assume that for some integer s we have some pairwise disjoint non-empty subsets I 0 := {1}, I 1 , . . . , I s-1 of {1, . . . , n -1} such that for all t ∈ {1, . . . , s -1} we have for all i t ∈ I t , there exists i t-1 ∈ I t-1 such that

A i t-1 |= A it .
In the following, we write i /

∈ I 0 ∪ • • • ∪ I s-1 to mean i ∈ {1, . . . , n} \ I 0 ∪ • • • ∪ I s-1 .
We define the two following binary matrices with the same even number of rows:

A s := A i i∈I 0 ∪•••∪I s-1 , B s := A i i / ∈I 0 ∪•••∪I s-1
.

Note that the matrix B s is not empty since n ∈ {1, . . . , n} \ I 0 ∪ • • • ∪ I s-1 . For all ℓ we have

|R ℓ ( A + s )| = i∈I 0 ∪•••∪I s-1 |R ℓ (A + i )|, |R ℓ ( A - s )| = i∈I 0 ∪•••∪I s-1 |R ℓ (A - i )|,
and

|R ℓ (B + s )| = i / ∈I 0 ∪•••∪I s-1 |R ℓ (A + i )|, |R ℓ (B - s )| = i / ∈I 0 ∪•••∪I s-1 |R ℓ (A - i )|.
Thus,

|R ℓ ( A + s )| + |R ℓ (B + s )| = n i=1 |R ℓ (A + i )| = n i=1 |R ℓ (A - i )| = |R ℓ ( A - s )| + |R ℓ (B - s )|. Furthermore, since |A + i | ≥ |A - i | for all i ∈ I 1 ∪ • • • ∪ I s-1 ⊆ {2, . . . , n -1} and |A + 1 | > |A - 1 | we obtain | A + s | = i∈I 1 ∪•••∪I s-1 |A + i | + |A + 1 | ≥ i∈I 1 ∪•••∪I s-1 |A - i | + |A + 1 | ≥ | A - s | -|A - 1 | + |A + 1 | | A + s | > | A - s |.
As a consequence, we can apply Lemma 3.6 to the matrices A s and B s . Hence, the set I s of integers i ∈ {1, . . . , n}

\ (I 0 ∪ • • • ∪ I s-1 ) such that A ı |= A i for some ı ∈ I 0 ∪ • • • ∪ I s-1 is non-empty.
Moreover, by construction such an integer ı is necessary in I s-1 . We stop here if n ∈ I s , and otherwise we continue the induction with I 0 , I 1 , . . . , I s .

Since the sets that we construct are non-empty, pairwise disjoint and included in {1, . . . , n}, there is some integer s such that n ∈ I s . By construction, for any t ∈ {1, . . . , s} if i t ∈ I t then there exists i t-1 ∈ I t-1 such that A i t-1 |= A it . Hence, starting with n ∈ I s , since the sets (I t ) 0≤t≤s are pairwise disjoint and I 0 = {1}, we can find a sequence 1

< i 1 , . . . , i s-1 < n of distinct integers such that A 1 |= A i 1 |= . . . |= A i s-1 |= A n .
Corollary 3.8. Let (A i ) 1≤i≤n be a family of matrices with the same even number of rows. We assume that

n i=1 |R ℓ (A + i )| = n i=1 |R ℓ (A - i )|, for all ℓ, |A + i 0 | > |A - i 0 |, for some i 0 ∈ {1, . . . , n}.
Then there exists a sequence of distinct integers i 1 , . . . , i s distinct from i 0 such that

A i 0 |= A i 1 |= A i 2 |= . . . |= A i s-1 |= A is , with |A + is | < |A - is |.
Proof. Let m ∈ {1, . . . , n -1} be the number of i ∈ {1, . . . , n} such that |A + i | ≥ |A - i |. Let (j k ) 1≤k≤n be a reordering of {1, . . . , n} with j 1 = i 0 such that

|A + j k | ≥ |A - j k |, for all k ∈ {1, . . . , m}, |A + j k | < |A - j k |,
for all k ∈ {m + 1, . . . , n}.

We define the following binary matrix with an even number of rows:

A := A j m+1 • • • A jn .
For all ℓ we have

m k=1 |R ℓ (A + j k )| + |R ℓ (A + )| = m k=1 |R ℓ (A - j k )| + |R ℓ (A -)|.
Hence, we can apply Proposition 3.7 to the family (A j 1 , . . . , A jm , A). We find a sequence i 1 , . . . , i s-1 of distinct elements of {j 2 , . . . , j m } such that

A j 1 = A i 0 |= A i 1 |= . . . |= A i s-1 |= A.
We conclude since A i s-1 |= A implies that there exists i s ∈ {j m+1 , . . . , j n } such that

A i s-1 |= A is .

Application to binary averaging

The following result is well-known.

Lemma 3.9. Let w 0 , . . . , w n-1 ∈ {0, . . . , p}. For all i ∈ {0, . . . , n -1} we define v i := w i p and we set v := (v 0 , . . . , v n-1 ) ∈ [0, 1] n . There exist some vectors ǫ 0 , . . . , ǫ p-1 ∈ {0, 1} n such that

v = 1 p p-1 j=0 ǫ j .
In particular,

1 p p-1 j=0 |ǫ j | = 1 p p-1 j=0 ǫ j 2 = |v|.
If in addition |v| ∈ N then for all j ∈ {0, . . . , p -1} we can choose ǫ j such that |ǫ j | = ǫ j 2 = |v|.

The last result is equivalent to the existence of a binary p × n matrix with row sums (|v|, . . . , |v|) and column sums (w 0 , . . . , w n-1 ). By a general result of [Ga, Ry], we know that such a matrix exists, since the conjugate (p, . . . , p) (with |v| terms) of the partition (|v|, . . . , |v|) dominates the partition w for the usual dominance order on partitions, where w is the partition obtained by rearranging the entries of w in decreasing order. However, for the convenience of the reader we give a simplified proof for the particular setting of Lemma 3.9.

Proof. For any i ∈ {0, . . . , n -1}, we define the set

W i := {w 0 + • • • + w i-1 + 1, . . . , w 0 + • • • + w i }.
For any j ∈ {0, . . . , p -1}, we consider the element ǫ j := (ǫ j 0 , . . . , ǫ j n-1 ) ∈ {0, 1} n defined by ǫ j i := 1 if W i contains an element of residue j modulo p, 0 otherwise, for any i ∈ {0, . . . , n -1}. Since W i has cardinality w i and is given by at most p successive integers, the set of residues modulo p of the elements of W i has also cardinality w i . Hence, there are exactly w i integers ǫ j i for all j ∈ {0, . . . , p -1} that are equal to 1. The other are 0, thus p-1 j=0

ǫ j i = w i .
The ith component of 1 We will use Corollary 3.8 of §3.1 to generalise Lemma 3.9: see Proposition 3.14. Let us first give an easy lemma.

Lemma 3.10. Let a 0 , . . . , a p-1 be integers of sum a multiple of p. The following integer: m := max a ja j ′ : j, j ′ ∈ {0, . . . , p -1} ∈ N, satisfies m = 0 or m ≥ 2.

Proof. Assume m ≤ 1. Then, for all j, j ′ ∈ {0, . . . , p -1} we have |a ja j ′ | ≤ 1. If j 0 ∈ {0, . . . , p -1} is such that a j 0 is the minimum of {a j } j∈{0,...,p-1} then for all j ∈ {0, . . . , p -1}, there exists ǫ j ∈ {0, 1} such that a j = a j 0 +ǫ j . From the hypothesis, we know that pa j 0 + p-1 j=0 ǫ j is a multiple of p, thus p-1 j=0 ǫ j is a multiple of p. Since ǫ j 0 = 0, we deduce that ǫ j = 0 for all j. We conclude that a j 0 = a j for all j ∈ {0, . . . , p -1} thus m = 0.

We need to introduce some notation in order to state Proposition 3.14. For any ℓ ∈ {0, . . . , d -1} and i ∈ {0, . . . , e -1}, let w

(ℓ) i ∈ {0, . . . , p} and set v (ℓ) i := w (ℓ) i p . For each ℓ ∈ {0, . . . , d -1} we define v (ℓ) := (v (ℓ) 0 , . . . , v (ℓ)
e-1 ). We obtain a d × e matrix

V :=     v (0)
. . .

v (d-1)     .
We assume that for all ℓ ∈ {0, . . . , d -1} we have |v (ℓ) | ∈ N. Hence, for all ℓ ∈ {0, . . . , d -1} we can apply Lemma 3.9 (with n := e). We obtain some vectors ǫ j(ℓ) ∈ {0, 1} e for all j ∈ {0, . . . , p -1}, such that (3.12) For all j ∈ {0, . . . , p -1}, define the following d × e matrix:

v (ℓ) = 1 p p-1 j=0 ǫ j(ℓ) , ( 3
E j :=     ǫ j(0) . . . ǫ j(d-1)     .
Recall that e is a multiple of η (and e = ηp). We write the matrix V with η blocks of the same size

V = V [0] • • • V [η-1]
, and we use the same block structure for the matrices -1] . As a consequence of (3.11), we have (3.13) for all i ∈ {0, . . . , η -1}.

E j = E j[0] • • • E j[η
|V [i] | = 1 p p-1 j=0 |E j[i] |,
Proposition 3.14. We keep the previous notation. In addition to the hypotheses |v (ℓ) | ∈ N for all ℓ ∈ {0, . . . , d -1}, assume that for all i ∈ {0, . . . , η -1} we have |V [i] | ∈ N. Then we can choose the vectors ǫ j(ℓ) for all j ∈ {0, . . . , p -1} and ℓ ∈ {0, . . . , d -1} such that the previous properties (3.11) and (3.12) still hold, together with

|E j[i] | = |V [i] |, (3.15)
for all j ∈ {0, . . . , p -1} and i ∈ {0, . . . , η -1}.

Example 3.16. Take p = 4 and d = 2. With the following matrix:

V := 1 4 1 2 2 1 2 3 0 1 0 2 1 3 1 3 2 0 = v (0) v (1) = V [0] V [1] ,
we have ℓ) constructed as in the proof of Lemma 3.9 are the following: ǫ 0(0) = (1, 0, 1, 0, 0, 1, 0, 0), ǫ 0(1) = (0, 1, 0, 1, 0, 1, 0, 0), ǫ 1(0) = (0, 1, 0, 1, 0, 1, 0, 0), ǫ 1(1) = (0, 1, 0, 1, 0, 1, 0, 0), ǫ 2(0) = (0, 1, 0, 0, 1, 1, 0, 0), ǫ 2(1) = (0, 0, 1, 0, 1, 0, 1, 0), ǫ 3(0) = (0, 0, 1, 0, 1, 0, 0, 1), ǫ 3(1) = (0, 0, 0, 1, 0, 1, 1, 0).

|v (0) | = |v (1) | = |V [0] | = |V [1] | = 3. The vectors ǫ j(
Thus, we have

E 0 = 1 0 1 0 0 1 0 0 0 1 0 1 0 1 0 0 = ǫ 0(0) ǫ 0(1) = E 0[0] E 0[1] , E 1 = 0 1 0 1 0 1 0 0 0 1 0 1 0 1 0 0 = ǫ 1(0) ǫ 1(1) = E 1[0] E 1[1] , E 2 = 0 1 0 0 1 1 0 0 0 0 1 0 1 0 1 0 = ǫ 2(0) ǫ 2(1) = E 2[0] E 2[1] , E 3 = 0 0 1 0 1 0 0 1 0 0 0 1 0 1 1 0 = ǫ 3(0) ǫ 3(1) = E 3[0] E 3[1] .
However, we have |E 0[0] | = 4 = |V [0] |, thus these vectors ǫ j(ℓ) do not satisfy the condition (3.15) of Proposition 3.14. Let us consider the two compatible submatrices indicated by the coloured entries. Define A := 0] and B := 0] and D :=

E 0[0] E 2[
E 0[1] E 2[1] (respectively C := E 1[0] E 3[
E 1[1] E 3[1] ) and set ( A, B) := γ 1,1,1 (A, B) (resp. ( C, D) := γ 1,2,1 (C, D)).
We have

E 0 = A + B + , E 1 = C + D + , E 2 = A -B -, E 3 = C -D -,
and

E 0 := A + B + = 0 0 1 0 1 1 0 0 0 1 0 1 0 1 0 0 , E 1 := C + D + = 0 0 0 1 1 1 0 0 0 1 0 1 0 1 0 0 , E 2 := A -B -= 1 1 0 0 0 1 0 0 0 0 1 0 1 0 1 0 , E 3 := C -D -= 0 1 1 0 0 0 0 1 0 0 0 1 0 1 1 0 .
The vectors ǫ j(ℓ) defined for all j ∈ {0, . . . , 3} and ℓ ∈ {0, 1} by E j = ǫ j(0) ǫ j( 1) satisfy (3.11) and (3.12), together with the condition (3.15) of Proposition 3.14. In general, the existence of such interchanges will be given by Corollary 3.8.

The remaining part of this subsection is now devoted to the proof of Proposition 3.14. First, note that the interchanges 1 0 0 1 ↔ 0 1 1 0 that are compatible with the block decomposition (3.17) do not affect properties (3.11) and (3.12). However, these interchanges change the value of some |E j [i] |, as described in Proposition 3.4. Thus, it suffices to prove that there exists a sequence of compatible interchanges that modifies each |E j [i] | to |V [i] |. We endow N × N * with the usual lexicographic order. We will use an induction on (∆, N ) ∈ N × N * , where

   E 0 . . . E p-1    =     E 0[0] • • • E 0[η-1] . . . . . . . . . E (p-1)[0] • • • E (p-1)[η-1]     ,
∆ := max |E j[i] | -|E j ′ [i] | : i ∈ {0, . . . , η -1}, j, j ′ ∈ {0, . . . , p -1} ∈ N, and
N := # (i, j, j ′ ) ∈ {0, . . . , η -1} × {0, . . . , p -1} 2 : |E j[i] | -|E j ′ [i] | = ∆ ∈ N * . Define M := max |E j[i] | : i ∈ {0, . . . , η -1}, j ∈ {0, . . . , p -1} , m := min |E j[i] | : i ∈ {0, . . . , η -1}, j ∈ {0, . . . , p -1} ,
and

N max := # (i, j) ∈ {0, . . . , η -1} × {0, . . . , p -1} : |E j[i] | = M , N min := # (i, j) ∈ {0, . . . , η -1} × {0, . . . , p -1} : |E j[i] | = m .
We have ∆ = Mm and N = N max N min . If ∆ = 0 then by (3.13) we have |E j [i] | = |V [i] | for all i, j so the proof is over. Assume ∆ ≥ 1 and let i 0 ∈ {0, . . . , e -1} and j 0 , j ′ 0 ∈ {0, . . . , p -1} such that

|E j 0 [i 0 ] | -|E j ′ 0 [i 0 ] | = ∆.
We now consider the matrix

E j 0 E j ′ 0 = E j 0 [0] • • • E j 0 [i 0 ] • • • E j 0 [η-1] E j ′ 0 [0] • • • E j ′ 0 [i 0 ] • • • E j ′ 0 [η-1] ,
given by the j 0 th and j ′ 0 th block-rows of the matrix of (3.17). We consider the family (A i ) 0≤i≤η-1 of matrices with the same even number of rows defined by

A i = A + i A - i := E j 0 [i] E j ′ 0 [i] ,
for all i ∈ {0, . . . , η -1}. The hypotheses of Corollary 3.8 are satisfied, thanks to the definition of i 0 and (3.12) (note that R ℓ (E j 0 ) = ǫ j 0 (ℓ) and R ℓ (E j ′ 0 ) = ǫ j ′ 0 (ℓ) ). Hence, we can find a sequence of distinct integers i 1 , . . . , i s distinct from i 0 with

|A + is | < |A - is | and A i 0 |= • • • |= A is . Let ( A i 0 , . . . , A is ) ∈ Γ(A i 0 , . . . , A is )
. By Corollary 3.5, we know that

| A + it | = |A + it |, | A - it | = |A - it |, (3.18)
for all t ∈ {1, . . . , s -1}. Moreover, we have (3.19b) We now want to evaluate the new values ∆ and N of ∆ and N that we obtain and prove that ( ∆, N ) is strictly less than (∆, N ). We have

| A + i 0 | = |A + i 0 | -1, | A - i 0 | = |A - i 0 | + 1, (3.19a) | A + is | = |A + is | + 1, | A - is | = |A - is | -1.
∆ = max | E j[i] | -| E j ′ [i] | : i ∈ {0, . . . , η -1}, j, j ′ ∈ {0, . . . , p -1} ∈ N, and
N = # (i, j, j ′ ) ∈ {0, . . . , η -1} × {0, . . . , p -1} 2 : | E j[i] | -| E j ′ [i] | = ∆ ∈ N * ,
where E j[i] otherwise.

E j[i] :=        A + it if i = i t for some t ∈ {0, . . . , s} and j = j 0 , A - it if i = i t for some t ∈ {0, . . . , s} and j = j ′ 0 ,

Moreover, with

M := max | E j[i] | : i ∈ {0, . . . , η -1}, j ∈ {0, . . . , p -1} , m := min | E j[i] | : i ∈ {0, . . . , η -1}, j ∈ {0, . . . , p -1} , Lemma 3.24. Let n ∈ N * and h : R n → R be a function such that h -1 2 • 2 is affine. Let v ∈ R n and suppose that ǫ 0 , . . . , ǫ p-1 ∈ {0, 1} n satisfy v = 1 p p-1 j=0 ǫ j and |ǫ j | = ǫ j 2 = |v| for all j ∈ {0, . . . , p -1}. For any a ∈ R n we have h(a + v) - 1 p p-1 j=0 h(a + ǫ j ) = v 2 -|v| 2 .
More specifically, there exists j ∈ {0, . . . , p -1} (depending on a) such that

h(a + ǫ j ) ≤ h(a + v) + |v| -v 2 2 .
Proof. Denote by ∆ := h(a + v) -1 p p-1 j=0 h(a + ǫ j ) the left-hand side of the equality. Note that the Hessian matrix of the second partial derivatives of h is the identity matrix. More precisely, since h is a degree 2 polynomial, the Taylor formula reads

h(a + w) = h(a) + ∇h(a), w + 1 2 w 2 , for all w ∈ R n ,
where ∇h(a) denotes the gradient of h at a. Since v = 1 p p-1 j=0 ǫ j , the quantity that defines ∆ vanishes at the affine level, hence

∆ = 1 2   v 2 - 1 p p-1 j=0 ǫ j 2   .
We conclude since ǫ j 2 = |v|. The second assertion is straightforward.

The next inequalities involve convexity. The first one is a particular case of a Jensen's inequality for convex functions. The reader may refer to [START_REF] Merentes | Remarks on strongly convex functions[END_REF]Theorem 4]; we include a proof for convenience.

Lemma 3.25. Let n ∈ N * and m ∈ R. Let h : R n → R such that h -m 2 • 2 is convex. For any x 0 , . . . , x p-1 ∈ R n we have h(x) ≤ 1 p p-1 j=0 h(x j ) - m 2p p-1 j=0 x j -x 2 , where x := 1 p p-1 j=0 x j . Proof. Since h -m 2 • 2 is convex, we have h(x) - m 2 x 2 ≤ 1 p p-1 j=0 h(x j ) - m 2p p-1 j=0 x j 2 .
Thus,

h(x) ≤ 1 p p-1 j=0 h(x j ) - m 2p   p-1 j=0 x j 2 -p x 2   ≤ 1 p p-1 j=0 h(x j ) - m 2p   p-1 j=0 x j -x 2 + 2 p-1 j=0 x j , x -2p x 2   ≤ 1 p p-1 j=0 h(x j ) - m 2p   p-1 j=0 x j -x 2 + 2p x, x -2p x 2   ≤ 1 p p-1 j=0 h(x j ) - m 2p p-1 j=0 x j -x 2 .
Remark 3.26. The real number m of Lemma 3.25 is usually taken to be positive. In this case, the map h is convex and we say that it is m-strongly convex. We have stated Lemma 3.25 for a general m since we will need it to be negative in the proof of Lemma 3.27.

For any x ∈ R, we denote by {x} ∈ [0, 1[ its fractional part. We have {x} := x -⌊x⌋, where ⌊x⌋ ∈ Z is the greatest integer less than or equal to x. Lemma 3.27. Let x 0 , . . . , x p-1 ∈ Z be integers and let

x := 1 p p-1 j=0 x j . With v := {x} we have v -v 2 ≤ 1 p p-1 j=0 (x j -x) 2 .
Proof. Let us consider the function φ : R → R defined by x → {x} -{x} 2 + x 2 . It is continuous on R \ Z, and in fact continuous on R since lim x→n -φ(x) = lim x→n + φ(x) = n 2 for any n ∈ Z. Moreover,

φ(x) = x -⌊x⌋ -(x 2 -2⌊x⌋x + ⌊x⌋ 2 ) + x 2 = (1 + 2⌊x⌋)x -⌊x⌋(1 + ⌊x⌋).
Thus, the function φ is affine on each interval [n, n + 1[ for n ∈ Z, with slope 2n + 1. Hence, the function φ is continuous with non-decreasing left derivative thus φ is convex. Applying Lemma 3.25 with n := 1, m := -2 and h :

= {•} -{•} 2 we obtain v -v 2 ≤ 1 p p-1 j=0 {x j } -{x j } 2 + 1 p p-1 j=0 (x j -x) 2 .
For any j ∈ {0, . . . , p -1} we have x j ∈ Z thus {x j } = 0 and we conclude.

Proof of the main theorem

We are now ready to prove Theorem 2.30, which we repeat here for the convenience of the reader.

Theorem 2.30. Let λ be an r-partition and let α := α κ (λ) ∈ Q + . Assume that κ is compatible with (d, η, p). If σ • α = α then there is an r-partition µ ∈ P κ α with σ µ = µ.

Let λ be an r-partition and assume that the multicharge κ ∈ (Z/eZ) r is compatible with (d, η, p). Recalling the reduction step Proposition 2.37, we assume that λ is an e-multicore. We define

α := α κ (λ), x (k) := x (k) (λ),
for all k ∈ {0, . . . , r -1},

n i := n i κ (λ),
for all i ∈ {0, . . . , e -1}.

In the whole section, we assume that σ • α = α. There will be four steps in the proof, each step corresponding to one subsection. First, we will give an expression of n 0 in terms of the abacus variables x (0) , . . . , x (r-1) , which takes into account the σ-stability of α. We will then give a key lemma, followed by a naive (but useful) attempt to prove the theorem. Finally, we will use the results of Section 3 to conclude the proof.

Using shift invariance

In this subsection, we will write n 0 in terms of x (k) i

for k ∈ {0, . . . , r -1} and i ∈ {0, . . . , e -1} (Lemma 2.24). The difference with the equality of Lemma 2.24 is that α is now assumed to be σ-stable, which will allow us to make the expression symmetric. The map (R e ) r → R that we obtain will be later used to apply the convexity results of §3.3.

Recall from §2.4 that we have some linear forms L 0 , . . . , L e-1 that satisfy (2.25):

n 0 = r-1 k=0 1 2 x (k) 2 -L -κ k x (k) .
Since σ • α = α, for all j 0 ∈ {0, . . . , p -1} we have n 0 κ (λ) = n 0 κ ( σ -j 0 λ) by Lemma 2.28. We deduce that

n 0 = r-1 k=0 1 2 x (k+j 0 d) 2 -L -κ k x (k+j 0 d) = r-1 k=0 1 2 x (k) 2 -L -κ k-j 0 d x (k) .
Averaging on j 0 ∈ {0, . . . , p -1}, we obtain

n 0 = r-1 k=0 1 2 x (k) 2 -L k x (k) ,
where L k is a linear form that depends only on the residue k ∈ {0, . . . , d -1} of k modulo d. Now, if for ℓ ∈ {0, . . . , d -1} we consider the map defined on R e by

g ℓ : x → 1 2 x 2 -L ℓ (x), (4.1)
we have

n 0 = d-1 ℓ=0 p-1 j=0 g ℓ x (ℓ+jd) =: f x (0) , . . . , x (r-1) . (4.2)
The map f : (R e ) r → R is of the form f = 1 2 • 2 -L where L is a linear form. Moreover, define 0) , . . . , x (d-1) , . . . , x (0) , . . . , x (d-1) ,

f p x (0) , . . . , x (d-1) := d-1 ℓ=0 g ℓ x (ℓ) = 1 p f x (
(4.3)
where, in the expression f x (0) , . . . , x (d-1) , . . . , x (0) , . . . , x (d-1) the sequence x (0) , . . . , x (d-1) is repeated p times. Like f , the map

f p : (R e ) d → R is of the form 1 2 • 2 -L p
, where L p is a linear form. Note that for all j ∈ {0, . . . , p -1} we have

f p x (jd) , . . . , x (d-1+jd) = d-1 ℓ=0 g ℓ x (ℓ+jd) ,
hence, by (4.2) we deduce that f x (0) , . . . , x (r-1) = p-1 j=0 f p x (jd) , . . . , x (d-1+jd) .

Key lemma

Lemma 4.5 that we will give in this subsection is the key to our proof of Theorem 2.30. Recall that α = α κ (λ) satisfies σ • α = α. For any i ∈ {0, . . . , η -1}, define

δ i := n i -n i+1 .
The σ-stability of α implies that δ i = n i+j 0 ηn i+j 0 η+1 for all j 0 ∈ {0, . . . , p -1}. We deduce from Lemma 2.24 and the compatibility of κ with (d, η, p) (cf. (2.18)) that

δ i = r-1 k=0 x (k) i+j 0 η-κ k = d-1 ℓ=0 p-1 j=0 x (ℓ+jd) i+(j 0 -j)η-κ ℓ , ( 4.4)
for all j 0 ∈ {0, . . . , p -1}. As noted in Remark 2.38, the stuttering r-partition µ of Theorem 2.30, which satisfies α κ (µ) = α, is not necessarily an e-multicore. The following lemma shows that, to prove Theorem 2.30, it suffices to find a stuttering e-multicore ν such that α κ

(ν) = α -h(α 0 + • • • + α e-1 )
for some h ∈ N. Lemma 4.5. Suppose that z (0) , . . . , z (d-1) ∈ Z e 0 are such that

pf p z (0) , . . . , z (d-1) ≤ f x (0) , . . . , x (r-1) , (4.6) and d-1 ℓ=0 p-1 j=0 z (ℓ) i-jη-κ ℓ = δ i , (4.7)
for all i ∈ {0, . . . , η -1}. Then Theorem 2.30 is true for the e-multicore λ: we can find an r-partition µ such that α κ (µ) = α and σ µ = µ.

Proof. For any ℓ ∈ {0, . . . , d -1} and j ∈ {1, . . . , p -1}, define z (ℓ+jd) := z (ℓ) ∈ Z e 0 . For each k ∈ {0, . . . , r -1}, let µ (k) be the e-core of parameter z (k) . We obtain an e-multicore µ = (µ (0) , . . . , µ (r-1) ) that satisfies σ µ = µ. For any i ∈ {0, . . . , e -1}, we define

m i := n i κ (µ). Since κ is compatible with (d, η, p), we have d-1 ℓ=0 p-1 j=0 z (ℓ) i-jη-κ ℓ = r-1 k=0 z (k)
i-κ k . By Lemma 2.24 and the assumption (4.7), we deduce that

m i -m i+1 = δ i , for all i ∈ {0, . . . , η -1}. Hence, for all i ∈ {0, . . . , η -1} we have m i -m i+1 = n i -n i+1 thus m 0 -m i = n 0 -n i . (4.8)
The above equality is also true for any i ∈ {0, . . . , e -1} since n i = n i+η and m i = m i+η (by Lemma 2.28). Recalling the definition of f (respectively f p ) given at (4.2) (resp. (4.3)), the assumption (4.6) implies m 0 ≤ n 0 .

Hence, as in the proof of Proposition 2.37 we can construct an r-partition µ = µ (0) , . . . , µ (r-1) such that σ µ = µ and:

• the partition µ (0) is obtained by adding n 0m 0 times an η-rim hook to µ (0) ;

• we have µ (j) = µ (j) for all j ∈ {1, . . . , d -1}.

Finally, by Lemma 2.36 and (4.8) we obtain

α κ (µ) = α κ (µ) + n 0 -m 0 (α 0 + • • • + α e-1 ) = e-1 i=0 m i α i + e-1 i=0 n 0 -m 0 α i = e-1 i=0 n 0 + m i -m 0 α i = e-1 i=0 n i α i = α,
thus we conclude.

Naive attempt

We will use the convexity of the map f : (R e ) r → R to obtain some parameters z (0) , . . . , z (d-1) that almost satisfy the conditions of Lemma 4.5. These parameters will not necessarily be integers: we will fix this in the next section.

Proposition 4.9. For any ℓ ∈ {0, . . . , d -1}, we define

z (ℓ) := 1 p p-1 j=0 x (ℓ+jd) ∈ 1 p Z e .
We have pf p z (0) , . . . , z (d-1) ≤ f x (0) , . . . , x (r-1) -1 2

d-1 ℓ=0 p-1 j=0 x (ℓ+jd) -z (ℓ) 2 .
Proof. Let ℓ ∈ {0, . . . , d -1} and let k ∈ {0, . . . , r -1} be of residue ℓ modulo d. Recall the definition of the map g ℓ : R e → R given in (4.1). The map g ℓ -1 2 • 2 is convex, thus by Lemma 3.25 we deduce that

g ℓ z (ℓ) ≤ 1 p p-1 j=0 g ℓ x (ℓ+jd) - 1 2p p-1 j=0 x (ℓ+jd) -z (ℓ) 2 .
Summing over all ℓ ∈ {0, . . . , d -1}, we obtain

f p z (0) , . . . , z (d-1) ≤ 1 p f x (0) , . . . , x (r-1) - 1 2p d-1 ℓ=0 p-1 j=0 x (ℓ+jd) -z (ℓ) 2 .
Multiplying by p gives the desired result.

Remark 4.10. The inequality of Proposition 4.9 is in fact an equality since g ℓ -1 2 • 2 is linear. Let us now try to verify the hypotheses of Lemma 4.5 with the parameters z (0) , . . . , z (d-1) ∈ 1 p Z e of Proposition 4.9. First, for each ℓ ∈ {0, . . . , d -1} we have

z (ℓ) = 1 p p-1 j=0 x (ℓ+jd) = 1 p p-1 j=0 0 = 0. (4.11)
Moreover, since x (ℓ+jd)x (ℓ+j ′ d) ≥ 0 we deduce from the inequality of Proposition 4.9 that pf p z (0) , . . . , z (d-1) ≤ f x (0) , . . . , x (r-1) . (4.12)

Finally, for each i ∈ {0, . . . , η -1} we have, using (4.4),

d-1 ℓ=0 p-1 j=0 z (ℓ) i-jη-κ ℓ = 1 p d-1 ℓ=0 p-1 j=0 p-1 j ′ =0 x (ℓ+j ′ d) i-jη-κ ℓ = 1 p p-1 j=0 d-1 ℓ=0 p-1 j ′ =0 x (ℓ+j ′ d) i+(-j+j ′ =:j 0 -j ′ )η-κ ℓ = 1 p p-1 j 0 =0   d-1 ℓ=0 p-1 j ′ =0 x (ℓ+j ′ d) i+(j 0 -j ′ )η-κ ℓ   = 1 p p-1 j 0 =0 δ i = δ i . (4.13)
Hence, all hypotheses are satisfied but one: the parameters z (0) , . . . , z (d-1) ∈ 1 p Z e 0 are not necessarily in Z e 0 .

Rectification of the parameters

We will construct from z (0) , . . . , z (d-1) ∈ 1 p Z e 0 (defined in Proposition 4.9) some elements z (0) , . . . , z (d-1) ∈ Z e 0 that satisfy all the assumptions of Lemma 4.5. To that end, we will approximate z (0) , . . . , z (d-1) using Proposition 3.14, and we will control the value of f z (0) , . . . , z (d-1) using Lemma 3.24. The remaining of this subsection in now devoted to the proof of the following proposition. Proposition 4.14. There exist elements z (0) , . . . , z (d-1) ∈ Z e 0 such that

d-1 ℓ=0 p-1 j=0 z (ℓ) i-jη-κ ℓ = δ i ,
for all i ∈ {0, . . . , η -1} and f p z (0) , . . . , z (d-1) ≤ f p z (0) , . . . , z (d-1) + 1 2p

d-1 ℓ=0 p-1 j=0 x (ℓ+jd) -z (ℓ) 2 .
Let ℓ ∈ {0, . . . , d -1}. Since z (ℓ) ∈ 1 p Z e , we know that for any i ∈ {0, . . . , η -1} and j ∈ {0, . . . , p -1} there exist unique elements m The fractional part of z e-1 . Let π ℓ be the permutation of {0, . . . , e -1} defined by

(ℓ) i-jη-κ ℓ is z (ℓ) i-jη-κ ℓ = w (ℓ) j+ip p =: v (ℓ) j+ip . ( 4
π ℓ (j + ip) := i -jη -κ ℓ ,
for all i ∈ {0, . . . , η -1} and j ∈ {0, . . . , p -1}. Permuting the components of e-tuples according to π 0 , . . . , π d-1 , we obtain a map f p : (R e ) d → R that satisfies f p m (0) + v (0) , . . . , m (d-1) + v (d-1) = f p z (0) , . . . , z (d-1) .

To match with the setting of §3.2, we define the two following d × e matrices:

M =     m (0)
. . . 0) , . . . , z (d-1) . (4.17)

m (d-1)     , V =     v (0) . . . v (d-1)     , so that f p M + V = f p z (
Like f p , the map f p defined on the d × e matrices is of the form 1 2 • 2 -L where • 2 is the sum of the squares of the entries and L is a linear form. We now write the matrix V blockwise in the same fashion as for Proposition 3.14. That is,

V =     v (0)
. . .

v (d-1)     = V [0] • • • V [η-1] ,
where

V [i] =     v (0) ip • • • v (0) p-1+ip . . . . . . . . . v (d-1) ip • • • v (d-1) p-1+ip     ,
for any i ∈ {0, . . . , η -1}. We now check that V satisfies the assumptions of Proposition 3.14. First, for any ℓ ∈ {0, . . . , d -1} the element v (ℓ) satisfies v (ℓ) ≥ 0 since its entries are nonnegative. Furthermore,

v (ℓ) = η-1 i=0 p-1 j=0 v (ℓ) j+ip = η-1 i=0 p-1 j=0 z (ℓ) i-jη-κ ℓ -m (ℓ) j+ip
(by (4.15), (4.16)

) = e-1 i=0 z (ℓ) i - η-1 i=0 p-1 j=0 m (ℓ) j+ip = z (ℓ) - η-1 i=0 p-1 j=0 m (ℓ)
j+ip .

Hence, we have v (ℓ) ∈ Z since z (ℓ) = 0 and m (ℓ) j+ip ∈ Z, thus v (ℓ) ∈ N. The same argument shows that V [i] ∈ N for any i ∈ {0, . . . , η -1} since

V [i] = d-1 ℓ=0 p-1 j=0 v (ℓ) j+ip = d-1 ℓ=0 p-1 j=0 z (ℓ) i-jη-κ ℓ - d-1 ℓ=0 p-1 j=0 m (ℓ) j+ip = δ i - d-1 ℓ=0 p-1 j=0 m (ℓ) j+ip .
Thus, we can apply Proposition 3.14. There exist vectors ǫ j(ℓ) ∈ {0, 1} e for all j ∈ {0, . . . , p-1} and ℓ ∈ {0, . . . , d -1} such that

1 p p-1 j=0 ǫ j(ℓ) = v (ℓ) , ǫ j(ℓ) = v (ℓ) , (4.18) E j[i] = V [i] ,
for all i ∈ {0, . . . , η -1}. (4.19)

In the above equality, the matrices E j [i] for any i ∈ {0, . . . , η -1} are defined by the same block decomposition as V : 0) . . .

E j :=     ǫ j(
ǫ j(d-1)     = E j[0] • • • E j[η-1] ,
in particular each E j [i] has size d × p. The map f p and the matrices V and E j for all j ∈ {0, . . . , p -1} satisfy the assumptions of Lemma 3.24. Hence, there exists j 0 ∈ {0, . . . , p -1} such that

f p (M + E j 0 ) ≤ f p (M + V ) + |V | -V 2 2 .
For each ℓ ∈ {0, . . . , d -1}, define the vector z (ℓ) by permuting the coordinates of m (ℓ) + ǫ j 0 (ℓ) via π ℓ . We have f p z (0) , . . . , z (d-1) = f p (M + E j 0 ), thus, recalling (4.17),

f p z (0) , . . . , z (d-1) ≤ f p z (0) , . . . , z (d-1) + |V | -V 2 2 . (4.20)
We now check that z (0) , . . . , z (d-1) have the properties described in Proposition 4.14. First, for any ℓ ∈ {0, . . . , d -1} the vector z (ℓ) is a permutation of m (ℓ) + ǫ j 0 (ℓ) . Since m (ℓ) ∈ Z e and ǫ j 0 (ℓ) ∈ {0, 1} e , we have z (ℓ) ∈ Z e . Moreover,

z (ℓ) = m (ℓ) + ǫ j 0 (ℓ) = m (ℓ) + v (ℓ) (by (4.18)) = z (ℓ)
= 0 (by (4.11)), thus z (ℓ) ∈ Z e 0 . The equality condition of Proposition 4.14 is satisfied, since for any i ∈ {0, . . . , η-1} we have

d-1 ℓ=0 p-1 j=0 z (ℓ) i-jη-κ ℓ = d-1 ℓ=0 p-1 j=0 m (ℓ) j+ip + ǫ j 0 (ℓ) j+ip = d-1 ℓ=0 p-1 j=0 m (ℓ) j+ip + E j 0 [i] = d-1 ℓ=0 p-1 j=0 m (ℓ) j+ip + V [i] (by (4.19)) = d-1 ℓ=0 p-1 j=0 m (ℓ) j+ip + v (ℓ) j+ip = d-1 ℓ=0 p-1 j=0 z (ℓ) i-jη-κ ℓ = δ i .
It remains to prove that the value of f p z (0) , . . . , z (d-1) does not grow too much. We have

|V | -V 2 2 = 1 2 d-1 ℓ=0 v (ℓ) -v (ℓ) 2 = 1 2 d-1 ℓ=0 η-1 i=0 p-1 j=0 v (ℓ) j+ip -v (ℓ) j+ip 2 .
Recall the definition of the vectors z (ℓ) for any ℓ ∈ {0, . . . , d -1} given in Proposition 4.9. Since for all i ∈ {0, . . . , η -1} and j ∈ {0, . . . , p -1}, each v

(ℓ) j+ip is the fractional part of z (ℓ) i-jη-κ ℓ = 1 p p-1 j ′ =0 x (ℓ+j ′ d) i-jη-κ ℓ ,
and since each x

(ℓ+j ′ d)
i-jη-κ ℓ is an integer, we can apply Lemma 3.27. We obtain

v (ℓ) j+ip -v (ℓ) j+ip 2 ≤ 1 p p-1 j ′ =0 x (ℓ+j ′ d) i-jη-κ ℓ -z (ℓ) i-jη-κ ℓ 2 ,
for all i ∈ {0, . . . , η -1} and j ∈ {0, . . . , p -1}, thus

v (ℓ) -v (ℓ) 2 ≤ 1 p p-1 j ′ =0 x (ℓ+j ′ d) -z (ℓ) 2
It follows from (4.20) that

f p z (0) , . . . , z (d-1) ≤ f p z (0) , . . . , z (d-1) + 1 2 d-1 ℓ=0 v (ℓ) -v (ℓ) 2 ≤ f p z (0) , . . . , z (d-1) + 1 2p d-1 ℓ=0 p-1 j=0 x (ℓ+jd) -z (ℓ) 2 ,
as desired.

Proof of the main theorem

We now conclude the proof of Theorem 2.30. Let z (0) , . . . , z (d-1) ∈ Z e 0 be as in Proposition 4.14. They satisfy

d-1 ℓ=0 p-1 j=0 z (ℓ) i-jη-κ ℓ = δ i , (4.21)
for all i ∈ {0, . . . , η -1} and

f p z (0) , . . . , z (d-1) ≤ f p z (0) , . . . , z (d-1) + 1 2p d-1 ℓ=0 p-1 j=0 x (ℓ+jd) -z (ℓ) 2 .
Since, by Proposition 4.9, we have pf p z (0) , . . . , z (d-1) ≤ f x (0) , . . . , x (r-1) -1 2

d-1 ℓ=0 p-1 j=0 x (ℓ+jd) -z (ℓ) 2 , we obtain pf p z (0) , . . . , z (d-1) ≤ f x (0) , . . . , x (r-1) - 1 2 d-1 ℓ=0 p-1 j=0 x (ℓ+jd) -z (ℓ) 2 + 1 2 d-1 ℓ=0 p-1 j=0 x (ℓ+jd) -z (ℓ) 2 , thus pf p z (0) , . . . , z (d-1) ≤ f x (0) , . . . , x (r-1) .
Remark 4.22. The error term 1 2 d-1 ℓ=0 p-1 j=0 x (ℓ+jd)z (ℓ) 2 vanished thanks the strong convexity inequality of Proposition 4.9, the "basic" convexity inequality (4.12) being not accurate enough.

The above inequality, together with (4.21), prove that the elements z (0) , . . . , z (d-1) ∈ Z e 0 satisfy the hypotheses of Lemma 4.5. Hence, Theorem 2.30 is proved for the e-multicore λ. Recalling the reduction step from r-partitions to e-multicores, Proposition 2.37, we conclude that Theorem 2.30 is true for any r-partition.

Applications

We assume that the multicharge κ is compatible with (d, η, p) (cf. (2.18) and (2.19)). We present two applications of Theorem 2.30 and Corollary 2.33. First, we will recall the definition of cellular algebras, as introduced by Graham and Lehrer [GrLe]

Cellular algebras

Let A be an associative unitary finite-dimensional F -algebra. A cellular datum for the algebra A is a triple (Λ, T , c) such that:

• the element Λ = (Λ, ≥) is a finite partially ordered set;

• for any λ ∈ Λ we have an indexing set T (λ) and distinct elements c λ st for all s, t ∈ T (λ) such that c λ st : λ ∈ Λ, s, t ∈ T (λ) , is a basis of A as an F -module;

• for any λ ∈ Λ, t ∈ T (λ) and a ∈ A, there exist scalars r tv (a) ∈ F such that for all s ∈ T (λ),

c λ st a = v∈T (λ) r tv (a)c λ sv (mod A >λ ),
where A >λ is the F -module spanned by {c µ ab : µ > λ and a, b ∈ T (µ)}; • the F -linear map * : A → A determined by (c λ st ) * := c λ ts for all λ ∈ Λ and s, t ∈ T (λ) is an anti-automorphism of the algebra A.

We say that A is a cellular algebra if it has a cellular datum. We say that a basis B of A is cellular if it coincides with {c λ st : λ ∈ Λ, s, t ∈ T (λ)} where (Λ, T , c) is a cellular datum for A.

Remark 5.1. If (Λ, T , c) is a cellular datum for A then dim A = λ∈Λ #T (λ) 2 .
Lemma 5.2. Let (Λ, T , c) be a cellular datum of A and let * be the corresponding antiautomorphism. The cardinality of

c λ st : λ ∈ Λ, s, t ∈ T (λ), (c λ st ) * = c λ st , is λ∈Λ #T (λ). Proof. Since (c λ st ) * = c λ ts , we have (c λ st ) * = c λ st if and only if s = t.
Assume that (Λ, T , c) is a cellular datum for A. By [GrLe], for each λ ∈ Λ we have an A-module S λ , called cell module, endowed with a certain bilinear form b λ whose radical is an A-module. Moreover, if D λ denotes the quotient of S λ by the radical of b λ , the set {D λ : λ ∈ Λ, D λ = {0}} is a complete family of non-isomorphic irreducible A-modules. We conclude with the following lemma (see [START_REF] Graham | Cellular algebras[END_REF](3.9.8)] or [START_REF] Mathas | Hecke Algebras and Schur Algebras of the Symmetric Group[END_REF]Corollary 2.22]).

We have

#T φ 0 [λ] = 1 p #T [λ], (5.6) where T φ 0 [λ] := ∪ µ∈[λ] T φ 0 (µ) = t ∈ T [λ] : φ([t]) = t .
In particular, the cardinality of T φ 0 [λ] does not depend on φ and we may abuse notation by writing #T

0 [λ] instead of T φ 0 [λ]. Since #T (λ) = 1 #[λ] #T [λ], we also deduce that #T (λ) = p #[λ] T φ 0 [λ]. ( 5
[λ]∈P T[λ] → ∪ [λ]∈P T [λ].

Cellular datum for the Ariki-Koike algebra

It is known that we can find a family c λ st : λ ∈ P κ n and s, t ∈ T (λ) , (5.10) that form a cellular basis of H κ n (cf. [DJM]). Now recall that we defined in (1.1) a particular algebra automorphism σ : H κ n → H κ n of order p. Let η be the n-tuple (η, . . . , η) considered as an element of (Z/eZ) n . By [BrKl, Ro]

λ]∈P κ [α] T[λ] -→ [λ]∈P κ [α] T [λ],
be a lift of the canonical projection. The family

µ(c λ st ) : λ ∈ P κ [α] , s ∈ T (λ), t ∈ T φ 0 (λ) , (5.19)
is an F -basis of H κ p, [α] . Proof. It suffices to prove that the family

σ j (c λ st ) : j ∈ {0, . . . , p -1}, λ ∈ P κ [α] , s ∈ T (λ), t ∈ T φ 0 (λ) , is an F -basis of H κ [α]
. For any j ∈ {0, . . . , p -1}, define the idempotent

e φ j := λ∈P κ [α] t∈T φ j (λ)
e res κ (t) .

The family c λ st : λ ∈ P κ [α] , s ∈ T (λ), t ∈ T φ 0 (λ) is an F -basis of H κ [α] e φ 0 . Since κ is compatible with (d, η, p), for any λ ∈ P κ

[α] and any λ-tableau t we have res κ σ t = res κ (t) + η.

Using (5.5), we deduce that σ(e φ j ) = e φ j+1 for all j ∈ {0, . . . , p -1}. Hence the family σ j (c λ st ) : λ ∈ P κ

[α] , s ∈ T (λ), t ∈ T φ 0 (λ) is an F -basis of H κ [α] e j . By (5.12c) and Lemma 5.13 we have

j=0 e φ j = 1 thus H κ [α] = ⊕ p-1 j=0 H κ [α]
e φ j and we conclude.

Remark 5.20. Recall from Remark 5.15 that the algebra H κ [α] is Z-graded. By [Ro], the algebra H κ p, [α] is also Z-graded and the basis (5.19) is homogeneous. We will prove the following partial alternative:

• if #[α] = p, the family (5.19) is a (graded) cellular basis of H κ p, [α] , for a particular choice of lift φ ( §5.2.4);

• if #[α] < p and p is odd, for any lift φ the family (5.19) is not an adapted cellular basis of H κ p, [α] , in the sense of Definition 5.28 ( §5.2.5).

Cellular basis in the full orbit case

Let α ∈ Q κ n and assume that #[α] = p. By Lemma 2.28, given λ ∈ P κ [α] we know that for any t ∈ T (λ) there is a unique standard tableau t α ∈ [t] whose underlying r-partition is in P κ α . We have in fact t α ∈ T (λ α ), where λ α is the unique element of [λ] that is in P κ α . We obtain a map φ :

[λ]∈P κ . The first point is clear: indeed, since * fixes each Khovanov-Lauda generator and by the action of σ on these generators (cf. (5.11)) we know that * and σ commute. Now, the restriction of µ to H κ α is an algebra homomorphism. Indeed, for any j ∈ {1, . . . , p -1} we have α = σ j • α since #[α] = p, hence for any h, h ′ ∈ H κ α we have hσ j (h ′ ) = 0 (recall (5.12b) and (5.17

Adapted cellularity

Let α ∈ Q κ n and let φ be as in Proposition 5.18. By (5.7), we have

dim H κ p,[α] = λ∈P κ [α] #T (λ) #T φ 0 (λ) = λ∈P κ [α] p #[λ] #T φ 0 [λ] #T φ 0 (λ) = [λ]∈P κ [α] p #[λ] #T φ 0 [λ] µ∈[λ] #T φ 0 (µ) = [λ]∈P κ [α] p #[λ] #T φ 0 [λ] 2 .
thus, σ j (c λ st ) = σ 2j (c λ ts ). Combining with (5.30), we obtain c λ ts = σ 2j (c λ ts ). By (5.11a), (5.12a) and (5.12b) and since η ∈ (Z/eZ) n has order p, this equality implies that 2j ∈ {0, p}. If p is odd then j = 0 and (5.30) yield c λ ts = c λ st thus s = t. If p is even then j ∈ {0, p 2 } and similarly we conclude using (5.30). The converse is straightforward. Given the result of §5.2.4, it seems natural to look for a cellular basis for H κ p, [α] of the form (5.19). The following proposition uses Corollary 2.33 to give a partial answer to this problem. , s ∈ T (λ) and t ∈ T φ 0 (λ). Hence, the only elements of the basis (5.19) that are fixed by the * anti-automorphism are the µ(c λ ss ) for all λ ∈ P κ [α] and s ∈ T φ 0 (λ). We obtain

N = λ∈P κ [α] #T φ 0 (λ) = λ∈P κ [α] #T 0 (λ) = [λ]∈P κ [α] #T 0 [λ],
which contradicts (5.32).

Remark 5.33. We can also define an adapted cellularity for H κ p,n , similarly to Definition 5.28. Using Proposition 1.2, we can show that if p and n are not coprime and p is odd, then the basis of H κ p,n that we obtain from (5.19) and (5.24) is not adapted cellular. Note that, under these conditions, there can exist an α ∈ Q κ n with #[α] = p, so that the subalgebra H κ p, [α] is cellular (cf. §5.2.4). This explains why we are dealing with H κ p, [α] and not only with H κ p,n .

Restriction of Specht modules

Since we have a cellular datum (P κ n , T , c) for the algebra H κ n , we have a collection of cell modules {S λ : λ ∈ P κ n }. In this case, the cell modules are called Specht modules. The algebra H κ p,n is not known to be cellular in general, but Hu and Mathas [HuMa12]

Proposition 1. 2 .

 2 Let C := {#[λ] : λ is an r-partition of n} ⊆ N * . We have max C = p and min C = p gcd(p,n) .

  parameters are x 0 (∅) = x 1 (∅) = x 2 (∅) = 0. As we saw in Example 2.6, the 5-abacus associated with the 5-core λ = (3, 2, 2, 1) is

  |ǫ j | = |v|. Moreover, since ǫ j ∈ {0, 1} n we have |ǫ j | = ǫ j 2 thus 1 p p-1 j=0 ǫ j 2 = |v|. Now assume that |v| ∈ N. There are in the set {1, . . . , |v|p = |w|} exactly |v| integers of residue j modulo p for each j ∈ {0, . . . , p-1}. Since {W i } i∈{0,...,n-1} is a partition of {1, . . . , |w|}, we deduce that n-1 i=0 ǫ j i = # elements of {1, . . . , |w|} of residue j modulo p = |v|, for all j ∈ {0, . . . , p -1}. Hence |ǫ j | = |v| and we conclude.

  .11) and |ǫ j(ℓ) | = |v (ℓ) |.

  .16) For each ℓ ∈ {0, . . . , d-1}, we have two e-tuples m (ℓ) := m

  )). We conclude since by (5.21), µ sends a basis of H κ α onto a basis of H κ p,[α] .Corollary 5.23. If p and n are coprime then the algebraH κ p,n is cellular. Proof. Let us first prove that #[β] = p for all β ∈ Q + with |β| = n. If #[β] = p ′ then p ′ divides p and we can write β = p ′ η-1 i=0 β i α i + α p ′ η+i + • • • + α (d-1)p ′ η+i ,where d := p p ′ and β 0 , . . . , β p ′ η-1 ∈ N. We deduce thatn = |β| = d p ′ η-1 i=0 β i ,hence d divides n. But d also divides p thus d = 1 and p ′ = p as desired. Hence, each subalgebra appearing in the following decomposition Proposition 5.22, where Q κ n is the quotient of Q κ n by the equivalence relation ∼ generated by β ∼ σ • β for all β ∈ Q κ n . We now easily check that H κ p,n is cellular, using the following fact: for any [β] = [β ′ ] ∈ Q κ n we have hh ′ = 0 for all h ∈ H κ [β] and h ′ ∈ H κ [β ′ ] (cf. (5.12b)).

Proposition 5 .

 5 31. If #[α] < p and p is odd then the basis (5.19)µ(c λ st ) : λ ∈ P κ [α] , s ∈ T (λ), t ∈ T φ 0 (λ) , of H κ p,[α] is not adapted cellular. Proof. Let N be the cardinality of µ(c λ st ) : λ ∈ P κ [α] , s ∈ T (λ), t ∈ T φ 0 (λ), µ(c λ st ) * = µ(c λ st ) .Assume that the basis (5.19) is adapted cellular with associated cellular datum (Λ, T , c). Lemma 5.2 yields, with the notation of Definition 5.28, ] ≥ 1 for all [λ] ∈ P κ [α] . Moreover, since #[α] < p we know by Corollary 2.33 that there exists [λ] ∈ P κ [α] such that p #[λ] > 1. Thus, we obtain p is odd, thus by Lemma 5.29 we know that µ(c λ st ) * = c λ st ⇐⇒ s = t, for all λ ∈ P κ [α]

  The integer p ′ divides p since σ has order p. By Lemma 2.29, we know that κ is compatible with (p ′ d, p ′ η, p p ′ ). Moreover, we have σ p ′ η,p • α = α thus Lemma 2.29 also gives

  . The algebra H κ n and its blocks H κ α for α ∈ Q κ n are examples of cellular algebras. We are interested in the fixed point subalgebras

	H κ p,[α] (respectively H κ p,n ) of H κ [α] (resp. H κ n ) for the algebra homomorphism σ. We can easily
	give bases for these algebras (cf. Proposition 5.18). In §5.2.4, we prove that if #[α] = p (resp.
	if p and n are coprime) then H κ p,[α] (resp. H κ p,n ) is cellular. Otherwise, using Corollary 2.33 we show that if in addition p is odd then none of these bases of H κ p,[α] are adapted cellular (see §5.2.5). Finally, in §5.3 we will study the restriction of Specht modules of H κ [α] .

  .7) Example 5.8. Recall that the multicharge κ is compatible with(d, η, p). For any t ∈ T [λ], the compatibility condition (2.19) ensures that there exists a unique standard tableau φ(t) ∈ [t] such that 1 is in the image of the first d components of φ(t), that is, such that there exists c ∈ {0, . . . , d -1} with φ(t) (0, 0, c) = 1. Note that when d = 1 (i.e. when r = p), this condition is the same as res κ φ -1 (1) = κ 0 . The map φ : T [λ] → T [λ] is constant on the equivalent classes of ∼. Thus, it factorises to a map φ : T[λ] → T [λ] that lifts the natural projection. In this case, for any j ∈ {0, . . . , p -1} we have We will see in §5.2.4 another example of a lift φ of the natural projection.Remark 5.9. Here, we chose φ to be a map T[λ] → T [λ]. If P is any subset of P κ n /∼, the equivalence relation ∼ is also defined on ∪ [λ]∈P T [λ] and the equivalence classes are in natural bijection with ∪ [λ]∈P T[λ]. Thus, we can allow φ to be a lift ∪

	T φ

j (λ) = t ∈ T (λ) : there exists c ∈ {(pj)d, . . . , (pj + 1)d -1} such that t (0, 0, c) = 1 .

  The basis(5.19) of H κ p,[α] that we obtain is thus µ(c λ st ) : λ ∈ P κ α and s, t ∈ T (λ) . (5.21) For any λ ∈ P κ α and s, t ∈ T (λ), we set d λ st := µ(c λ st ). Recall that (P κ α , T , c) is a cellular datum for H κ α . Recall that #[α] = p. The triple (P κ α , T , d) is a cellular datum for H κ p,[α] . Proof. It suffices to prove that µ commutes with * and induces an algebra isomorphism between H κ α and H κ p,[α]

	Proposition 5.22.
		T [λ]
		,
		t -→ t α
	that lifts the natural projection. For any λ ∈ P κ [α] , we have
	T φ 0 (λ) =	T (λ), if λ ∈ P κ α , ∅, otherwise.

  defined what they also called Specht modules for H κ p,n . It is a family denotes the restriction of the H κ n -module S λ to an H κ p,n -module. For any λ ∈ P κ n and j, j ′ ∈ {0, . . . , p #[λ] -1}, the H κ p,n -modules S λ j and S λ j ′ are isomorphic up to a twist of the action of H κ p,n . The purpose of the name "Specht module" is that each irreducible H κ p,n -module is isomorphic to the head of a S λ j . By Proposition 1.2, we know that the maximal number of summands in (5.34) is gcd(p, n) when we restrict a Specht module of H κ n and that this bound is reached. Our result Corollary 2.33 refines this result. For any α ∈ Q κ n , the maximal number of summands in (5.34) is p #[α] and this bound is reached, when we restrict a Specht module S λ with λ ∈ P κ [α] , that is, when we restrict a Specht module of H κ [α] .

		S λ j : j ∈ {0, . . . ,	p #[λ]	-1} ,
	of H κ p,n -modules with	S λ	  H κ n H κ p,n	≃ S λ 0 ⊕ • • • ⊕ S λ p #[λ] -1 ,	(5.34)
	for any λ ∈ P κ n , where S λ	  H κ n H κ p,n
	Proposition 5.35.

Acknowledgements I am thankful to Maria Chlouveraki and Nicolas Jacon for their numerous corrections and suggestions about the presentation of the paper. I also thank an anonymous referee for pointing out the reference [Fa] for Proposition 2.14.

and N max := # (i, j) ∈ {0, . . . , η -1} × {0, . . . , p -1} : | E j [i] | = M , N min := # (i, j) ∈ {0, . . . , η -1} × {0, . . . , p -1} : | E j [i] | = m , we have ∆ = M -N and N = N max N min . Note that by (3.18), for all i ∈ {0, . . . , η -1} and j ∈ {0, . . . , p -1} we have

By the assumption |V [i] | ∈ N and (3.13), thanks to Lemma 3.10 we know that ∆ = Hence,by (3.19a) we have

where δ is the Kronecker symbol. By (3.21) and (3.22), we obtain

(3.23)

. By induction, this concludes the proof of Proposition 3.14.

A few inequalities

We will prove some inequalities that we will use to prove Theorem 2.30. The setting of the first one is reminiscent of Lemma 3.9 and the following ones use convexity. Recall that • is the euclidean norm on R n and denote by •, • the associated scalar product.

Lemma 5.3. For any λ ∈ Λ, all the composition factors of the cell module S λ belong to the same block of the algebra A.

Let λ ∈ Λ and let B be the block of A such that all the composition factors of S λ belong to B. We say that λ belongs to the block B.

Cellularity of the fixed point subalgebra

We will first give more definitions from combinatorics, and recall the existence of a particular cellular datum for H κ n and its blocks H κ α . Then, we will construct bases for the algebra H κ p, [α] and study its cellularity. We will use the following notation:

Tableaux

Let λ = λ (0) , . . . , λ (r-1) be an r-partition of n. Recall that we defined in §2.1 and §2.

The κ-residue sequence of a λ-tableau t is the sequence

.

A λ-tableau t : Y(λ) → {1, . . . , n} is standard if the value of t increases along the rows and down the columns of Y(λ). We denote by T (λ) the set of standard λ-tableaux.

Example 5.4. We take r = p = 2 and we consider the bipartition λ := (4, 1), ( 1) . The map t : Y(λ) → {1, . . . , 6} described by

is a λ-tableau (we warn the reader that we represented in the same way the multiset of residues associated with a multipartition), but it is not standard. The tableau s : Y(λ) → {1, . . . , 6} described by

is standard. With κ = (0, 2) and e = 4 = 2η, the residue sequence of s is res κ (s) = (0, 3, 2, 1, 2, 3).

Mimicking Definition 2.27, we define the shift of a λ-tableau t = t (0) , . . . , t (r-1) by σ t := t (r-d) , . . . , t (r-1) , t (0) , . . . , t (r-d+1) , and we denote by [t] the orbit of t under the action of σ. Note that σ t is a σ λ-tableau, which is standard if t is standard. In particular the set

In other words, if t is any standard λ-tableau then φ([t]) ∈ [t]. For any j ∈ {0, . . . , p -1}, we define

Note that the set T φ j (λ) may be empty for some j ∈ {0, . . . , p -1}, but we have a partition

(5.5) Among the generators e(i) for any i ∈ (Z/eZ) n , we know exactly the ones that are non-zero (see [START_REF] Hu | Graded cellular bases for the cyclotomic Khovanov-Lauda-Rouquier algebras of type A[END_REF]4.1. Lemma]).

Lemma 5.13. For any i ∈ (Z/eZ) n , the idempotent e(i) ∈ H κ n is non-zero if and only if there exist λ ∈ P κ n and t ∈ T (λ) such that i = res κ (t). There is a well-defined algebra anti-automorphism * : H κ n → H κ n , which we now fix, that is the identity on each Khovanov-Lauda generator (see [START_REF] Hu | Graded cellular bases for the cyclotomic Khovanov-Lauda-Rouquier algebras of type A[END_REF]§5.1]). We can find a cellular basis of H κ n of the form (5.10) such that the associated anti-automorphism is the map * , with the additional property c λ st ∈ e(res κ (s))H κ n e(res κ (t)), (5.14) for all λ ∈ P κ n and s, t ∈ T (λ) (see [START_REF] Hu | Graded cellular bases for the cyclotomic Khovanov-Lauda-Rouquier algebras of type A[END_REF] and also [Bo]). Note that we recover the result of Lemma 5.13. We now fix such a cellular basis. Remark 5.15. The cellular bases that are constructed in [START_REF] Hu | Graded cellular bases for the cyclotomic Khovanov-Lauda-Rouquier algebras of type A[END_REF][START_REF] Bowman | The many graded cellular basis of Hecke algebras[END_REF] are graded cellular bases: the algebra H κ n is Z-graded ( [Rou, BrKl]) and there exists a map deg :

st is homogeneous of degree deg s + deg t. These graded cellular bases seem to be more adapted to σ than the ungraded one of [DJM]: if H κ n is semisimple, we can prove that σ permutes the elements of the graded basis but its action on the ungraded basis is more complicated.

The condition (5.14) allows us to give a more precise description of this cellular structure for H κ n . For any α ∈ Q + with |α| = n, denote by I α the subset of (Z/eZ) n given by the n-tuples i ∈ (Z/eZ) n that have exactly α i components equal to i for any i ∈ {0, . . . , e -1}. The subalgebra

and {0} otherwise (see [LyMa]). By (5.14), when α ∈ Q κ n the algebra H κ α is cellular, with cellular basis c λ st : λ ∈ P κ α and s, t ∈ T (λ) (cf. [START_REF] Hu | Graded cellular bases for the cyclotomic Khovanov-Lauda-Rouquier algebras of type A[END_REF]Corollary 5.12]).

Subalgebras of fixed points

Recall from the introduction that we defined a subalgebra H κ p,n ⊆ H κ n as the subalgebra of the fixed points of σ :

is the linear map defined by µ := p-1 j=0 σ j , we have µ(H κ n ) = H κ p,n . Remark 5.16. We warn the reader that the map that we denoted by µ in [Ro] is the map 1 p µ. We now look at the blocks of H κ n . Let α ∈ Q κ n and denote by [α] the orbit of α under the action of σ (cf. Definition 2.26). The subalgebra H κ α ⊆ H κ n is not necessarily stable under σ. Indeed, by (5.11a) we have

(5.17)

Hence, the smallest subalgebra of H κ n stable under σ and containing

Similarly, we define denotes the subalgebra of fixed points of σ then H κ p, [α] = µ (H κ [α] ).

Recalling that #T φ 0 [λ] does not depend on φ, we obtain

(5.25)

Remark 5.26. With (5.7) and Remark 5.1 we obtain the equality dim

. Suppose that there exists a cellular datum (Λ, T , c) for H κ p, [α] . Remark 5.1 and (5.25) give two ways to write dim H κ p, [α] as a sum of squares:

These two sums have the same terms up to reordering if and only if for all ∈ Λ such that the conditions (5.27) are satisfied, together with c λ st * = c λ ts for all λ ∈ Λ and s, t ∈ T (λ).

We say that a basis B of H κ p, [α] is adapted cellular if there exists an adapted cellular datum (Λ, T , c) for H κ p, [α] such that B coincides with c λ st : λ ∈ Λ and s, t ∈ T (λ) . By (5.11a), (5.12a), (5.12b) and (5.14), we deduce that there exists j ∈ {0, . . . , p -1} such that c λ ts = σ j (c λ st ).

(5.30)

Since σ and * commute, we obtain c λ st = σ j (c λ ts ),