This paper introduces Tanabe algebras, a class of partition algebras associated with complex reflection groups, and studies their representation theory, including irreducible modules, Bratteli diagrams, and Jucys-Murphy elements.
Contribution
It defines Tanabe algebras for complex reflection groups and analyzes their irreducible modules, Bratteli diagrams, and Jucys-Murphy elements, extending previous work on partition algebras.
Findings
01
Parametrization of irreducible modules of Tanabe algebras
02
Construction of Bratteli diagrams for Tanabe algebra towers
03
Explicit Jucys-Murphy elements and their actions
Abstract
This paper defines the partition algebra for complex reflection group G(r,p,n) acting on k-fold tensor product (Cn)⊗k, where Cn is the reflection representation of G(r,p,n). A basis of the centralizer algebra of this action of G(r,p,n) was given by Tanabe and for p=1, the corresponding partition algebra was studied by Orellana. We also establish a subalgebra as partition algebra of a subgroup of G(r,p,n) acting on (Cn)⊗k. We call these algebras as Tanabe algebras. The aim of this paper is to study representation theory of Tanabe algebras: parametrization of their irreducible modules, and construction of Bratteli diagram for the tower of Tanabe algebras. We conclude the paper by giving Jucys-Murphy elements of Tanabe algebras and their actions on the Gelfand-Tsetlin basis, determined by this multiplicity free tower, of…
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Full text
On representation theory of partition algebras for complex reflection groups
Ashish Mishra and Shraddha Srivastava
Abstract
This paper defines the partition algebra, denoted by \mathpzcTk(r,p,n), for complex reflection group G(r,p,n) acting on k-fold tensor product (Cn)⊗k, where Cn is the reflection representation of G(r,p,n). A basis of the centralizer algebra of this action of G(r,p,n) was given by Tanabe and for p=1, the corresponding partition algebra was studied by Orellana.
We also define a subalgebra \mathpzcTk+21(r,p,n) such that \mathpzcTk(r,p,n)⊆\mathpzcTk+21(r,p,n)⊆\mathpzcTk+1(r,p,n) and establish this subalgebra as partition algebra of a subgroup of G(r,p,n) acting on (Cn)⊗k. We call the algebras \mathpzcTk(r,p,n) and \mathpzcTk+21(r,p,n) as Tanabe algebras. The aim of this paper is to study representation theory of Tanabe algebras: parametrization of their irreducible modules, and construction of Bratteli diagram for the tower of Tanabe algebras
[TABLE]
We conclude the paper by giving Jucys-Murphy elements of Tanabe algebras and their actions on the Gelfand-Tsetlin basis, determined by this multiplicity free tower, of irreducible modules.
The symmetric group Sk acts on the k-fold tensor product V⊗k of the n-dimensional vector space V=Cn over the field of complex numbers C. The general linear group GLn(C) acts on V⊗k diagonally where V is the defining representation of GLn(C). These two actions commute; moreover, they generate the centralizers of each other. This is known as the classical Schur-Weyl duality [Gre07].
Jones [Jon94] and Martin [Mar94], independently, defined partition algebra CAk(q), where q∈C, as a generalization of Temperley-Lieb algebras and Potts model in higher dimensional statistical mechanics. The symmetric group Sn, being the subgroup of permutation matrices in GLn(C), acts on V⊗k. Jones [Jon94] proved Schur-Weyl duality between the partition algebra CAk(n) and the symmetric group Sn acting on V⊗k. Furthermore, Martin and Saleur studied the structure of partition algebras in [MS93, MS94] and proved that the partition algebra CAk(n) is semisimple unless n is an integer such that 0≤n<2k−1.
The subalgebra CAk+21(n) of partition algebra CAk+1(n) was introduced by Martin [MR98, Mar00]. Halverson and Ram [HR05] showed Schur-Weyl duality between CAk+21(n) and the subgroup Sn−1 of Sn; and thus established it to be equally important as partition algebra CAk(n). It was also shown in [HR05] that the branching rule is multiplicity free for CAl−21(n)⊆CAl(n) for l∈21Z>0 whenever both the algebras are semisimple.
Recursively building the Bratteli diagram for the tower of partition algebras
[TABLE]
the Jucys-Murphy elements of partition algebras were also given in [HR05, Theorem 3.37]. Later, the seminormal representations of parition algebra were derived by Enyang [Eny13].
The complex reflection group G(r,p,n), where r,p and n are positive integers such that p divides r, is a subgroup of GLn(C). The group G(r,1,n) is the wreath product of the cyclic group Z/rZ by the symmetric group Sn and G(r,p,n) is a normal subgroup of index p of G(r,1,n).
Shephard and Todd [ST54] gave a classification of finite irreducible complex reflection groups. It was shown there that the families of groups Sn for n>1, Z/rZ for r>1, and G(r,p,n) (except when (r,p,n)=(2,2,2)\mboxor(1,1,1)) are the only infinite families of finite irreducible complex reflection groups and there are exactly 34 more finite irreducible complex reflection groups. Also they characterized the group G(r,p,n), for n>1, by showing that these are the only finite irreducible imprimitive complex reflection groups up to isomorphism.
The restriction of the action of GLn(C) on V to G(r,p,n) is the reflection representation of G(r,p,n). Tanabe [Tan97, Lemma 2.1] described a basis of the centralizer algebra of the action of G(r,p,n) on the tensor space V⊗k. Orellana [Ore07] defined a subalgebra \mathpzcTk(n,r) of partition algebra CAk(n), and proved Schur-Weyl duality between \mathpzcTk(n,r) and G(r,1,n) [Ore07, Theorem 5.4]. Also, she recursively constructed the Bratteli diagram for the tower of algebras
In this paper, we define a subalgebra, denoted by \mathpzcTk(r,p,n), of partition algebra CAk(n) such that there is Schur-Weyl duality between \mathpzcTk(r,p,n) and the complex reflection group G(r,p,n). In particular, for p=1, the algebra \mathpzcTk(r,1,n) is equal to the algebra \mathpzcTk(n,r) defined by Orellana. Along the lines of [HR05], we introduce a subgroup L(r,p,n) of G(r,p,n) which plays a role analogous to the subgroup Sn−1 of Sn in the study of partition algebra. We define a subalgebra, denoted by \mathpzcTk+21(r,p,n), of partition algebra CAk+21(n) and exhibit Schur-Weyl duality between \mathpzcTk+21(r,p,n) and L(r,p,n). Thus, the algebras \mathpzcTk(r,p,n) and \mathpzcTk+21(r,p,n) are partition algebras for the complex reflection group G(r,p,n) and its subgroup L(r,p,n) respectively. We call the algebras \mathpzcTk(r,p,n) and \mathpzcTk+21(r,p,n) as Tanabe algebras.
The main results in this paper are as follows.
(a)
For Tanabe algebras:
(i)
Decomposition of the centralizer algebras \mboxEndG(r,p,n)(V⊗k) and \mboxEndL(r,p,n)(V⊗k) into their irreducible modules which, in particular, gives parametrization of the irreducible modules of Tanabe algebras \mathpzcTk(r,p,n) and \mathpzcTk+21(r,p,n) for n≥2k and n≥2k+1 respectively (Theorem 6.4).
2. (ii)
Construction of Bratteli diagram recursively for the tower
[TABLE]
In this case, the Bratteli diagram is a simple graph (Section 6).
3. (iii)
Description of a specific set of commuting elements, called Jucys-Murphy elements, which act as scalars on the canonical basis, called Gelfand-Tsetlin basis, of each irreducible module of Tanabe algebras (Theorem 7.6).
2. (b)
For complex reflection groups:
(i)
Construction of a basis of irreducible G(r,p,n)-modules (Theorem 4.10) using a combination of ideas from Okounkov-Vershik approach to the representation theory of G(r,1,n) in [MS16], Clifford theory and higher Specht polynomials in [MY98].
2. (ii)
Branching rule from G(r,p,n) to L(r,p,n) (Theorem 4.12).
3. (iii)
Decomposition of V⊗k in terms of irreducible G(r,p,n)-modules and L(r,p,n)-modules (Theorem 6.3).
Using theory of the basic construction, [HR05, Theorem 3.27] shows that the necessary and sufficient condition for the semisimplicity of partition algebra CAl(n), for n∈Z≥2 and l∈21Z≥0, is l≤2n+1. In the case of Tanabe algebras, an important question that still remains to be done is to find a necessary and sufficient condition for their semisimplicity.
The inductive approach to the representation theory of symmetric groups was done by Okounkov and Vershik in [VO04, OV96]. This approach considers the chain of symmetric groups
[TABLE]
to study their representation theory recursively. The advantage over the traditional approach is that the appearance of Young diagrams and standard Young tableaux is given a spectral explanation, and the braching rule is determined simultaneously. The Gelfand-Tsetlin decomposition, the Gelfand-Tsetlin algebra, the canonical Gelfand-Tsetlin basis of the irreducible representations, and the Jucys-Murphy elements, a set of generators of Geland-Tsetlin algebra, are fundamental to this approach. The corresponding approach in the case of G(r,1,n) proves fruitful in giving new proofs of some known results and also in establishing new results in this paper.
This paper is organized in the following sections. Section 2 gives a brief introduction to partition algebra, Okounkov-Vershik approach to the representation theory of G(r,1,n), and Clifford theory.
In Section 3, we define Tanabe algebras, \mathpzcTk(r,p,n) and \mathpzcTk+21(r,p,n), as subspaces of partition
algebras and prove that these subspaces are algebras.
Section 4 contains a description of representation theory of complex reflection group G(r,p,n) and its subgroup L(r,p,n) (Theorems 4.7 and 4.9). We review the representation theory of G(r,p,n) using Clifford theory. We parametrize the irreducible L(r,1,n)-modules and, then by Clifford theory, determine the representation theory of L(r,p,n). This section concludes with the branching rule from G(r,p,n) to L(r,p,n).
In Section 5, we demonstrate that \mathpzcTk(r,p,n) and \mathpzcTk+21(r,p,n) are in Schur-Weyl duality with G(r,p,n) and L(r,p,n) respectively.
Using results from Section 4, Section 6 starts with the decomposition of V⊗k as G(r,p,n)-module and L(r,p,n)-module. Then, we give decomposition of V⊗k as (G(r,p,n),\mathpzcTk(r,p,n))-bimodule and (L(r,p,n),\mathpzcTk+21(r,p,n))-bimodule (Theorem 6.5) and use it to construct Bratteli diagram of Tanabe algebras.
In Section 7, we give Jucys-Murphy elements and their actions on the canonical Gelfand-Tsetlin basis of irreducible modules of Tanabe algebras.
Conventions: Throughout this paper, we assume that
(i)
r,p,m and n are positive integers such that p divides r and m=pr, and
2. (ii)
we index the components in a w-tuple from 1,…,w, therefore, for a multiple t of w, the t(\mboxmodw)-th component means the w-th component.
2 Preliminaries
In this section, we give an overview of partition algebra, Okounkov-Vershik approach and Clifford theory to set up notations and to state basic definitions and results used in the rest of the paper.
2.1 Partition algebra
For k∈Z≥0, let Ak be the set of all set partitions of {1,2,…,k,1′,2′,…,k′}. Given an element d∈Ak, we say that i and j are in the same block in d if i and j belong to the same set partition in d. The elements of Ak can be depicted as graphs, called partition diagrams, with the vertices {1,2,,…,k} and {1′,2′,…,k′} in the top and bottom rows respectively and two vertices in the same block are connected by an edge. By d=(B1,B2,…,Bs), we denote that there are exactly s blocks B1,B2,…,Bs in d. Also, ∣d∣ denotes the number of blocks in d.
The multiplication of two elements d1,d2∈Ak, denoted by d1∘d2, is obtained by concatenating the diagrams d1 and d2 in the following way: place d1 above d2, identify the vertices in the bottom row of d1 with the vertices in the top row of d2, then remove all the connected blocks which are entirely in the middle row. The multiplication ∘ makes (Ak,∘) a monoid with the identity element given by
Define a subset Ak+21 of Ak+1 consisting of those elements which have (k+1) and (k+1)′ in the same block. It can be easily seen that Ak+21 is a submonoid of Ak+1. The monoids Ak and Ak+21 are called partition monoids.
The multiplication of basis elements, which when extended linearly makes CAk(q) an associative algebra, is defined as: for d1,d2∈Ak, define
[TABLE]
where l is the number of blocks removed from the middle row while computing d1∘d2. Also, CAk+21(q) is a subalgebra of CAk+1(q). The algebras CAk(q) and CAk+21(q) are called partition algebras.
Example 2.2**.**
In example 2.1, the product d1d2 in CA6(q) is given by
since one block has been removed from the middle row.
2.2 The Okounkov-Vershik approach
Let Gn denote the direct product of n-copies of a finite group G.
The action of the symmetric group Sn on Gn by permuting the coordinates defines the semidirect product of Gn by Sn. The group Gn⋊Sn is also known as wreath product of G by Sn. We use the notation G(r,1,n):=Gn⋊Sn throughout for the particular case when G=Z/rZ=⟨ζ⟩, the cyclic group of order r with ζ being a primitive r-th root of unity. Thus,
[TABLE]
In this section, we follow [MS16] and present here a brief summary of Okounkov-Vershik approach to the representation theory of G(r,1,n).
Consider the following chain of subgroups of G(r,1,n)
[TABLE]
where, for 1≤i≤n,
[TABLE]
The irreducible representations of H1,n≅Gn=(Z/rZ)n are one-dimensional.
The following well-known result of Wigner is useful in proving that the chain (1) is multiplicity free.
Theorem 2.3**.**
Let M be a complex finite dimensional semisimple algebra and let N be a
semisimple subalgebra.
Then the relative commutant of the pair M and N, denoted by Z(M,N), consisting of all the elements of M that commute with the elements of N is semisimple and the
following conditions are equivalent:
(a)
The restriction of any finite dimensional complex irreducible
representation of M to N is multiplicity free.
2. (b)
The relative commutant Z(M,N) is commutative.
Using Theorem 4.3 in [MS16], we can conclude that the relative commutant of the pair of group algebras C[Hm,n] and C[Hm−1,n] is commutative for all 2≤m≤n.
For each i=1,2,…,n, suppose that Hi,n∧ denotes the indexing set of irreducible Hi,n-modules and given λ∈Hi,n∧, assume that Vλ denotes the corresponding Hi,n-module. Bratteli diagram of the chain (1) is a simple graph in which the vertices at i-th level are elements of Hi,n∧ and a vertex μ∈Hi−1,n∧ is joined by an edge with a vertex λ∈Hi,n∧ if Vμ appears in the restriction of Vλ to Hi−1,n.
For a fixed 1≤m≤n, consider the Hm,n-module Vλm, where λm∈Hm,n∧. The branching rule being multiplicity free implies that the decomposition of Vλm into irreducible Hm−1,n-modules is canonical, and the decomposition is
[TABLE]
where the sum is over all λm−1∈Hm−1,n∧ with an edge from λm−1 to λm such that Vλm−1 is identified with the corresponding submodule of Vλm. Iterating this decomposition, a canonical decomposition of Vλm into irreducible H1,n∧-submodules is
[TABLE]
where the sum is over all possible paths T=(λ1,λ2,…,λm) from a vertex in H1,n to λm in Bratteli diagram.
[TABLE]
with λi∈Hi,n∧ for 1≤i≤m.
The decomposition (2) is called the Gelfand-Tsetlin decomposition (GZ-decomposition) of Vλm and each VT in (2) is called a Gelfand-Tsetlin subspace (GZ-subspace) of Vλm. In our case, each GZ-subspace VT is one-dimensional. Choose a non-zero vector vT∈VT. The basis
[TABLE]
of Vλm is called the Gelfand-Tsetlin basis (GZ-basis) of Vλm and it is unique up to scalars
and
[TABLE]
Considering the Fourier transform, i.e., the algebra isomorphism
[TABLE]
given by
[TABLE]
we can define Gelfand-Tsetlin algebra (GZ-algebra), a subalgebra of C[Hm,n] based on the GZ-decomposition (2):
[TABLE]
Thus, GZm,n is a maximal commutative subalgebra of C[Hm,n].
Theorem 2.4**.**
[MS16, Theorem 3.1(i)]** Let Zi,n denote the center of C[Hi,n] for each i=1,2,…,m. Then,
[TABLE]
By a GZ-subspace of Hm,n we mean a GZ-subspace of some irreducible Hm,n-module Vλm for some λm∈Hm,n∧.
The theorem above implies the following result which is [MS16, Lemma 3.2].
Lemma 2.5**.**
(a)
Let v∈Vλm for some λm∈Hm,n∧ such that v is an eigenvector of every element of GZm,n, then (a scalar multiple of) v belongs to the GZ-basis of Vλm.
2. (b)
Let v and u be elements in Vλm and Vμm respectively for some λm,μm∈Hm,n∧ such that v and u have the same eigenvalues for every element of GZm,n, then v=u and λm=μm.
Thus, a GZ-subspace uniquely determines the irreducible representation of Hm,n of which it is a GZ-subspace.
The Jucys-Murphy elements for the wreath product of a finite group by a symmetric group were given in [Pus97]. For our particular case G(r,1,n),
the Jucys-Murphy elements can be written as:
[TABLE]
where ζilζj−lsij=(1,…,1,ζl,1…,1,ζ−l,1,…,1,sij)∈G(r,1,n), with ζl and ζ−l as i-th and j-th coordinates respectively. It is clear that the element Xj belongs to Hj,n also.
A GZ-subspace V of Hm,n is isomorphic to ρ1⊗⋯⊗ρn,ρi∈G∧ for all i. We call ρ=(ρ1,…,ρn) the label of V. And define the weightα(V) of V by
[TABLE]
where \alpha_{i}=\mbox{eigenvalue of X_{i}onV}.
Using Lemma 2.5 and Theorem 2.6, it can be easily shown that a GZ-subspace is uniquely determined by its weight.
Let Y be the set of all Young diagrams. The unique Young diagram with zero boxes is empty Young diagram denoted by ∅. For λ∈Y, let ∣λ∣ denote the number of boxes in λ. Define
[TABLE]
i.e., Y(r,n) is the set of r-tuples of Young diagrams such that the total number of boxes is n. The irreducible representations of G(r,1,n) are parametrized by elements of the set Y(r,n).
Let μ∈Y. A standard Young tableau of shape μ is obtained by filling the boxes in the Young diagram μ with the distinct numbers 1,2,…,∣μ∣ such that the numbers in the boxes strictly increase along each row and each column of μ. For λ∈Y(r,n), a standard r-tuple of Young tableau of shape λ obtained by filling the n-boxes in the r-tuple λ with the distinct numbers 1,2,…,n such that the numbers in the boxes strictly increase along each row and each column of all Young diagrams occurring in λ. Define
\mboxTab(r,λ) as the set of all standard r-tuple of Young tableau and set \mboxTab(r,n):=∪λ∈Y(r,n)\mboxTab(r,λ).
For each i=1,2,…,r, define the irreducible representation σi of G:
[TABLE]
The irreducible representations of G are σ1,σ2,…,σr.
The content c(b) of a box b of a Young diagram is its y-coordinate − its x-coordinate (We draw Young diagrams by following the convention of writing down matrices with x-axis running downwards and y-axis running to the right). Given λ=(λ1,…,λr)∈Y(r,n), T∈\mboxTab(r,λ) and 1≤i≤n, the number i resides in exactly one box of one of λ1,…,λr, let bT(i) be this box in Young diagram λji for a unique ji∈{1,…,r} and let rT(i):=σji .
The following result for G(r,1,n) can be easily seen from Theorem 6.5 in [MS16].
Theorem 2.7**.**
Let λ∈Y(r,n). Then the GZ-subspaces of
Vλ can be parametrized by T∈\mboxTab(r,λ) and the GZ-decomposition of Vλ can be written as
[TABLE]
where each VT is closed under the action of Gn and, as a Gn-module, is isomorphic to the irreducible
Gn-module
[TABLE]
For i=1,…,n, the eigenvalue of Xi on VT is given by
rc(bT(i)).
Let R denote the element of \mboxTab(r,λ) defined as follows: for λ=(λ1,…,λr), we start with λ1 by filling the Young diagram λ1 with the
numbers 1,…,∣λ1∣ in row major order, i.e., the first row is filled with 1,2,…,l1 in increasing order where l1 is the length of the first row, the second row is filled with l1+1,…,l1+l2 in increasing order where
l2 is the length of the second row and so on till the last row of
λ1 has been filled. Then we fill the Young diagram λ2 with ∣λ1∣+1,…,∣λ1∣+∣λ2∣ in row major order and so on till the last Young diagram λr.
The irreducible representations of G(r,1,n) are parametrized by r-tuple of Young diagrams in Y(r,n) and given λ∈Y(r,n), the GZ-basis elements (and hence, GZ-subspaces) of Vλ are parametrized by T∈\mboxTab(r,λ).
2.3 Clifford Theory
We give an outline of Clifford theory for a finite group H and its normal subgroup N such that H/N is a cyclic group of order p as done in [Ste89, MY98, BB07].
The pair H and N on which they have applied Clifford theory is the pair G(r,1,n) and G(r,p,n).
The group G(r,p,n) can be considered as the subgroup of GLn(C) consisting of generalized permutation matrices such that the m-th power of the product of nonzero entries is one. We discuss the complex reflection group G(r,p,n) and its representation theory in detail in Section 4 and review Clifford theory for the rest of this section.
Let H∧ denote the indexing set of irreducible representations of H.
Identifying H/N with the group C consisting of one-dimensional representations of H which contain N in their kernel, we can define an action of C on the set of irreducible representations of H by
[TABLE]
where δ∈C and Vρ is the irreducible representation of H indexed by ρ∈H∧. Denote the orbit of Vρ by [ρ] with respect to the action of C. The irreducible representations of H which are in the same orbit are called associates of each other. Assume that Vρ has b(ρ) associates. Then the stabilizer subgroup of C with respect to Vρ, denoted by Cρ, has the order u(ρ)=b(ρ)p. Suppose that δ0 is a generator of Cρ. It is easy to see that there exists a N-linear map A:Vρ⟶Vρ such that A(hv)=δ0(h)hA(v) for all h∈H and v∈Vρ. Then by Schur’s lemma, the H-linear map Au(ρ) acts by a nonzero scalar. Normalizing the scalar, we obtain that Au(ρ) is the identity map on Vρ. Such an A is called the associator of Vρ. Also, if μ∈[ρ], then the stabilizer subgroup Cμ=Cρ. The following theorem gives parametrization of irreducible N-modules.
Theorem 2.8**.**
(a)
The eigenspace decomposition of Vρ with respect to A is given by
[TABLE]
where E(l) is the eigenspace with eigenvalue eu(ρ)2πil. The group Cρ can be identified with {eu(ρ)2πil∣l=0,1,…,u(ρ)−1}.
2. (b)
The eigenspaces E(l), for 0≤l≤u(ρ)−1, occuring in (7) are inequivalent irreducible N-modules, each of which is of dimension dim(Vρ)/u(ρ).
3. (c)
For any 0≤l≤u(ρ)−1, we have
[TABLE]
4. (d)
Let O denote the set of all orbits in H∧.
The irreducible N-modules are parametrized by the pairs ([ρ],ϵ) where [ρ]∈O and ϵ∈Cρ.
3 Tanabe algebra
The partition monoid is a poset with the partial order given as: for d,d′∈Ak, d′≤d if d′ is coarser than d, i.e., if i and j are in the same block of d, then i and j are in the same block of d′.
For d∈Ak, define the unique element xd∈CAk(n) satisfying
[TABLE]
This partial order on Ak can be extended to a total order on Ak.
It can be easily seen that the transition matrix between {d∣d∈Ak} and {xd∣d∈Ak} is an upper triangular matrix with 1′s on the diagonal and thus, {xd∣d∈Ak} is also a basis of the partition algebra CAk(n), see also [HR05, p. 879].
An internal block in d1∘d2, for d1,d2∈Ak, is a block that is entirely in the middle while computing d1∘d2. We say that the bottom row of d1 matches with the top row of d2 if the following condition is satisfied: i′ and j′ are in the same block in d1 if and only if i and j are in the same block in d2 for 1≤i,j≤k. For every s in a block B of d∈Ak, if we put is=t for some 1≤t≤n, then t is said to be a mark of the blockB. The next lemma and the idea of its proof are from the online notes [Ram10b]. It gives the structure constants with respect to the basis {xd∣d∈Ak} of CAk(n).
Lemma 3.1**.**
For d1,d2∈Ak, the multiplication of xd1 and xd2 in CAk(n) is given by
[TABLE]
where the sum is taken over all those d in Ak such that d is coarser than d1∘d2 and the coarsening is done by connecting a block of d1 which is contained entirely in the top row of d1 with a block of d2 which is contained entirely in the bottom row of d2 and
[TABLE]
where ∣d∣ is the number of blocks in d, [d1∘d2] is the number of internal blocks in [d1∘d2], and for a∈Z, b∈Z≥0,
[TABLE]
such that when a,b∈Z≥0 and a≥b, we have (a)b=\prescriptaPb, the number of permutations of a objects taken b at a time.
Proof.
Let n≥2k. Then ϕk:CAk(n)≅\mboxEndSn(V⊗k) (by Schur-Weyl duality for partition algebras, Theorem 5.1). Identifying xd with ϕk(xd), we have
[TABLE]
If the bottom row of d1 does not match with the top row of d2, then using (20) it can be seen that xd1xd2=0.
If the bottom row of d1 matches with the top row of d2, then again using (20) we have
[TABLE]
where αd is some positive integer and the sum is over all d obtained by coarsening d1∘d2 which is done by connecting a block of d1 contained entirely in the top row of d1 and a block of d2 contained entirely in the bottom row of d2. So, αd= number of ways the internal blocks of d1∘d2 can be marked distinctly after putting distinct marks on the blocks of d=(n−∣d∣)[d1∘d2]=cd.
Fix k and vary n. For a given n, fix d1,d2,d∈Ak(n). Then the coefficient of xd in the product xd1xd2 is a polynomial fd(n) in n. Then by above arguments, for n≥2k, we have fd(n)=(n−∣d∣)[d1∘d2]. The fundamental theorem of algebra implies that fd(n)=(n−∣d∣)[d1∘d2] for all n.
∎
Let B be a block of d∈Ak. Suppose that N(B) is the number of elements in B⋂{1,2,…,k} and M(B) is the number of elements in B⋂{1′,2′,…,k′}. Thus, N(B) and M(B) are the number of elements in the block B in top row and bottom row of d respectively.
Define the following mutually disjoint subsets of Ak:
[TABLE]
Also, define Ak(r,p,n), a subset of Ak, by setting
[TABLE]
Definition 3.2**.**
Define \mathpzcTk(r,p,n):=C-span{xd∣d∈Ak(r,p,n)}, a subspace of partition algebra CAk(n).
Remark 3.3**.**
The set Πk(r) is a submonoid of Ak and Ak(r,1,n)=Πk(r). Also, for d∈Πk(r), the elements d′≤d also belong to Πk(r) because the difference in the number of elements between top row and bottom row in each block remains 0(\mboxmodr) even after coarsening. Thus,
[TABLE]
is a subalgebra of CAk(n).
Let V=Cn be the n-dimensional vector space on which GLn(C) acts naturally. The action of G(r,p,n) on V is given by the restriction of the action of GLn(C) on V. Also, G(r,p,n) acts on the k-fold tensor product V⊗k by the diagonal action.
The proof of the following theorem uses the basis of the centralizer algebra of the action of G(r,p,n) on V⊗k as given in Lemma 5.2(a) (also, [Tan97, Lemma 2.1]).
Theorem 3.4**.**
The vector space \mathpzcTk(r,p,n) is a subalgebra of CAk(n).
Proof.
Let d1,d2∈Ak(r,p,n). It is sufficient to assume that the bottom row of d1 matches with the top row of d2.
The multiplication xd1xd2 is given by
[TABLE]
Case (i): If d1,d2∈Πk(r), then by Remark 3.3, we have xd1xd2∈\mathpzcTk(r,1,n)⊆\mathpzcTk(r,p,n).
Case (ii): One of d1 or d2 is in Θk(r,p,n). Without loss of generality, assume that d1∈Θk(r,p,n) and d2∈Ak(r,p,n). Claim: cd=0\mboxford∈/Ak(r,p,n) in (9). Since d1 has more than
n blocks, therefore using Schur-Weyl duality for partition algebra (Theorem 5.1), we get, in (9)
[TABLE]
The linear independence of {ϕk(xd)∣∣d∣≤n} implies that cd=0 for d∈Ak,∣d∣≤n. Thus, cd can be nonzero only when ∣d∣>n. For such d, we show that either d∈Πk(r) or d∈Θk(r,p,n).
Suppose d∈/Πk(r), then there exists 1≤j≤∣d∣ such that N(Bj)≡M(Bj)(\mboxmodr).
Subcase (a):
Suppose d=d1∘d2.
If a block B in d1 is connected with a block B′ in d2 then N(B)≡M(B)(\mboxmodm), N(B′)≡M(B′)(\mboxmodm) and M(B)=N(B′). Thus, N(B)≡M(B′)(\mboxmodm) and d∈Θk(r,p,n). This also includes the cases when either of B and B′ are entirely in the top or bottom row of d1 and d2 respectively.
Subcase (b): Suppose that d is obtained by coarsening of d1∘d2 as in Lemma 3.1. Let the coarsening be done by connecting a block B entirely in the top row of d1 with a block B′ entirely in the bottom row of d2. Then
[TABLE]
Thus, N(B)≡M(B′)(\mboxmodm) and d∈Θk(r,p,n).
Case (iii): One of d1 and d2 is in Πk(r) and the other is in Λk(r,p,n). Without loss of generality, assume that d1∈Πk(r) and d2∈Λk(r,p,n). If ∣d1∣>n, then we can argue similar to the case (ii) above. So, assume that ∣d1∣≤n. From (9), we have
[TABLE]
Using the basis of \mboxEndG(r,p,n)(V⊗k) as in Lemma 5.2(a), it follows that, for d such that ∣d∣≤n, cd can be nonzero only when d∈Πk(r)⋃Λk(r,p,n).
If there exists d in (9) with more than n blocks such that cd=0, then by the arguments similar to the case (ii), we get either d∈Πk(r) or d∈Λk(r,p,n).
∎
Define the following mutually disjoint subsets of Ak+21:
[TABLE]
Also, define Ak+21(r,p,n), a subset of Ak+21, by setting
[TABLE]
Definition 3.5**.**
Define \mathpzcTk+21(r,p,n):=C\mbox−span{xd∣d∈Ak+21(r,p,n)}, a subspace of partition algebra CAk+21(n).
Theorem 3.6**.**
The vector space \mathpzcTk+21(r,p,n) is a subalgebra of
CAk+21(n).
Proof.
Note that \mathpzcTk+21(r,p,n)=\mathpzcTk+1(r,p,n)⋂CAk+21(n), hence \mathpzcTk+21(r,p,n) is an algebra.
∎
Definition 3.7** (Tanabe algebra).**
We call the algebras \mathpzcTk(r,p,n) and \mathpzcTk+21(r,p,n) as Tanabe algebras.
From [HR05, Page 879], there is an injective algebra homomorphism
[TABLE]
where d∈Ak and d′∈Ak+21 has same blocks as d with an additional block {(k+1),(k+1)′}. It is easy to see that the corresponding element xd is mapped to (xd′+∑xd′′), where the sum is over all d′′∈Ak+21∖{d′} obtained by connecting a block in d′ with the block {(k+1),(k+1)′}. Using the description of the above map in terms of the elements
xd, we see that the algebra \mathpzcTk(r,p,n) can be embedded inside the algebra \mathpzcTk+21(r,p,n).
Example 3.8**.**
In this example, we describe \mathpzcTk(r,p,n) for various specific values of r,p and n when k=2. The monoid A2={d1,d2,…,d15} with the elements given as below:
Thus, \mathpzcT2(2,2,2) is the partition algebra CA2(2).
2. (b)
For p=2,n=3, Λ2(2,2,3) is an empty set and Θ2(2,2,3)={d1}.
3. (c)
For p=2,n=4, we have Λ2(2,2,4)={d1} and Θ2(2,2,4) is an empty set.
2. (ii)
For r=1,2, we have Π2(r)={d9,d10,d15}. For r=3, Λ2(r,p,n) is nonempty if and only if (r,p,n)=(3,3,3); and Λ2(3,3,3)={d2,d7}.
For r=4, Λ2(r,p,n) is nonempty if and only if (r,p,n)=(4,2,2) or (4,4,2); and Λ2(4,2,2)=Λ2(4,4,2)={d8}. For r>4, Λ2(r,p,n) is empty for all values of p and n. In general, for r>2k, Λk(r,p,n) is empty for all values of p and n.
Remark 3.9**.**
For n≥2k, Θk(r,p,n) is an empty set. For n≥2k, the set Λk(r,p,n) is nonempty if and only if (r,p,n)=(2,2,2k); Λk(2,2,2k)={d}, where d is a partition diagram with 2k blocks, i.e., each block consists of a single vertex. Using the multiplication rule in Lemma 3.1, it is easy to check that the corresponding xd is a central element of Tanabe algebra \mathpzcTk(2,2,2k).
4 Complex reflection groups
For an n-dimensional complex vector space W, a linear isomorphism of W of finite order is said to be a reflection in W if it has exactly (n−1) eigenvalues equal to 1. A complex reflection groupR in W is a group generated by reflections in W. The space W is called the reflection representation of R. We say R is irreducible if the R-invariant complement of the subspace WR, which is fixed pointwise by R, in W is irreducible. If there exists a direct sum
W=W1⊕W2⊕⋯⊕Wt, where Wi is non-trivial proper subspace of W for each 1≤i≤n, such that W1,W2,…,Wt are permuted among themselves under the action of R, then we say that R is imprimitive. By Shephard-Todd classification, the groups G(r,p,n), for n>1, are the only finite irreducible imprimitive complex reflection groups [ST54, Section 2].
Suppose that G:=Z/rZ is the cyclic group of order r with ζ, a primitive r-th root of unity. Define \mboxD(r,p,n) to be the subgroup of GLn(C) consisting of diagonal matrices as:
[TABLE]
Let Sn be the group of n×n permutation matrices. Define G(r,p,n) to be the subgroup of GL(n,C) generated by \mboxD(r,p,n) and Sn. Since Sn normalizes \mboxD(r,p,n) and \mboxD(r,p,n)⋂Sn={In}, where In is the identity matrix, so the group G(r,p,n) is a semidirect product:
[TABLE]
Thus, as a subgroup of GLn(C), the group G(r,p,n) consists of generalized permutation matrices with nonzero entries being r-th roots of unity and the m-th power of the product of nonzero entries is one. Also, the elements of G(r,p,n) can be written as (n+1)-tuple:
[TABLE]
The particular case when p=1 is the group G(r,1,n), the wreath product of the group G by the symmetric group Sn, of order rnn!. Taking the exact sequence
[TABLE]
we see that G(r,p,n) is a normal subgroup of the group G(r,1,n) of index p. So, the order of the group G(r,p,n) is (rnn!)/p.
Some families of groups which are special cases of G(r,p,n) are:
(a)
cyclic group of order r, i.e., Z/rZ=G(r,1,1),
2. (b)
dihedral group of order 2r, D2r=G(r,r,2),
3. (c)
symmetric group on n symbols, Sn=G(1,1,n),
4. (d)
Weyl group of type Bn (also called hyperoctahedral group) is G(2,1,n),
5. (e)
Weyl group of type Dn is G(2,2,n).
Let G(n) be an isomorphic copy of G in G(r,1,n) defined as
[TABLE]
Assume that Sn−1 is the subgroup of Sn consisting of elements fixing n. The groups G(r,1,n−1)×G(n) and G(r,p,n) are subgroups of G(r,1,n). Let L(r,p,n) be the subgroup of G(r,p,n) defined as:
[TABLE]
As a subgroup of GLn(C), the group L(r,p,n) consists of those elements in G(r,p,n) such that the (n,n)-th entry is nonzero.
For p=1, we have
[TABLE]
The order of L(r,1,n) is rn(n−1)!. Taking the exact sequence
[TABLE]
we see that L(r,p,n) is a normal subgroup of the group L(r,1,n) of index p.
Thus, the order of L(r,p,n) is (rn(n−1)!)/p.
Given an r-tuple of Young diagrams (λ1,λ2,…,λr)∈Y(r,n−1), choose one i∈{1,2,…,r}, take λi (λi may be empty also), color it by n and denote by λin. We note that λin denotes the same Young diagram λi, but it has the color n. The (n,i)-colored r-tuple of Young diagrams, denoted by λ(n,i):=(λ1,λ2,…,λi−1,λin,λi+1,…,λr), consists of the r-tuple (λ1,λ2,…,λr)∈Y(r,n−1) with i-th component λi colored by n. Let Yn(r,n−1) denote the set of all (n,i)-colored r-tuples of Young diagrams with total n−1 boxes for i=1,2,…,r.
Lemma 4.1**.**
The irreducible L(r,1,n)-modules are indexed by the elements of Yn(r,n−1).
Proof.
The irreducible representations of G are σ1,σ2,…,σr (defined in Section 2.2). Suppose that Vλ is the irreducible representation of G(r,1,n−1) corresponding to λ∈Y(r,n−1). Then,
[TABLE]
is the set of irreducible representations of L(r,1,n) which is indexed by the elements of the set Yn(r,n−1).
∎
We describe the branching rule from G(r,1,n) to L(r,1,n). For μ=(μ1,μ2,…,μr)∈Y(r,n) with μi=∅, let μ↓i denote the set of elements ν(n,i)∈Yn(r,n−1) such that ν is obtained from μ by removing the box at an inner corner of μi and then coloring the i-th component of ν by n to obtain (n,i)-colored r-tuple ν(n,i). Assume that Vμ and Vν(n,i) are the irreducible G(r,1,n)-module and L(r,1,n)-module corresponding to μ∈Y(r,n) and ν(n,i)∈Yn(r,n−1) respectively.
Theorem 4.2** (Branching rule from G(r,1,n) to L(r,1,n)).**
We have
[TABLE]
Remark: We take equality in place of isomorphism because the restriction rule is multiplicity free which makes the decomposition canonical and we identify Vν(n,i) with the corresponding L(r,1,n)-submodule of Vμ.
Proof.
Since νj=μj for j=i and ∣νi∣=∣μi∣−1, therefore given a GZ-subspace of Vμ, there exists a GZ-subspace of Vν(n,i)=Vν⊗σi with the same label. Also, for 1≤i≤n−1, the action of Xi∈GZn−1,n⊆GZn,n on GZ-subspace of Vν(n,i) is same as its action on GZ-subspace of Vμ. A GZ-subspace is uniquely determined by its weight and a GZ-subspace uniquely determines the parametrization of irreducible representation. Thus, Vν(n,i) appears in the restriction of Vμ as a L(r,1,n)-module with multiplicity one since the restriction from G(r,1,n) to L(r,1,n) is multiplicity free (follows from chain (1) since Hm−1,n=L(r,1,n)).
∎
The next step is the parametrization of the irreducible representations of G(r,p,n) and L(r,p,n) using Clifford theory. Consider the one-dimensional representation
[TABLE]
[TABLE]
As a G(r,1,n)-module, δ0 is parametrized by (∅,(n),∅,…,∅) and G(r,p,n)⊆\mboxKer(δ0m). We use the same notation δ0 to denote the restriction of δ0 to L(r,1,n). It will be clear from the context whether we consider δ0 as a G(r,1,n)-module or as a L(r,1,n)-module. As a L(r,1,n)-module, δ0 is parametrized by the (n,2)-colored r-tuple (∅,(n−1)n,∅,…,∅) and L(r,p,n)⊆\mboxKer(δ0m). The cyclic group C generated by δ0m is of order p. Thus
[TABLE]
Define the shift map on Y(r,n) as sh:Y(r,n)⟶Y(r,n) by
[TABLE]
Using the same notation, the shift map on Yn(r,n−1) is defined as
[TABLE]
where the r-tuples on L.H.S. and R.H.S. are (n,i)-colored and (n,i+1)-colored respectively.
Suppose that Vλ and Vμ(n,i) denote the irreducible representations of G(r,1,n) and L(r,1,n) parametrized by the r-tuple λ=(λ1,λ2,…,λr)∈Y(r,n) and (n,i)-colored r-tuple μ(n,i)=(μ1,μ2,…,μin,…,μr)∈Yn(r,n−1) for some i∈{1,2,…,r} respectively.
The following lemma is proved using Okounkov-Vershik approach. Part (a) is [MRW04, Theorem 24] and it was proved there using ∗-rim hook tableaux.
Lemma 4.3**.**
For λ∈Y(r,n) and μ(n,i)∈Yn(r,n−1), the following are true:
(a)
As G(r,1,n)-modules,
[TABLE]
2. (b)
As L(r,1,n)-modules,
[TABLE]
Proof.
(a)
A GZ-subspace of an irreducible representation of G(r,1,n) is uniquely determined by its weight. Also, a GZ-subspace uniquely determines the r-tuple of Young diagrams in Y(r,n) which parametrize the irreducible representation of which it is a GZ-subspace.
For λ=(λ1,λ2,…,λr)∈Y(r,n) with yi:=∣λi∣, let R be the standard r-tuple of Young tableaux written in row major order. The GZ-subspace of type VR is isomorphic to
[TABLE]
as a Gn-module. For i=1,2,…,n and GZ-basis element
[TABLE]
we have
Xi(vR)=rc(bR(i))(vR).
The GZ-subspace of δ0 is given by n-fold σ2⊗⋯⊗σ2 with GZ-basis element given by n-fold v2⊗⋯⊗v2. Thus, the GZ-subspace of δ0⊗Vλ is
[TABLE]
isomorphic as Gn-module, with basis element v′ being
[TABLE]
Also, for 1≤i=j≤n, we have
[TABLE]
So, for 1≤i≤n,
[TABLE]
which implies that v′=vsh(R).
We have shown that Vsh(R) is a GZ-subspace of δ0⊗Vλ. Thus, Vsh(λ), corresponding to r-tuple sh(λ), is a G(r,1,n)-submodule of δ0⊗Vλ. The irreducibility of δ0⊗Vλ implies the result.
2. (b)
This part can be proved by arguments similar to those in part (a). To be able to do so, we note that a GZ-subspace of an irreducible representation of L(r,1,n) is uniquely determined by its weight, i.e., its label and the action of Jucys-Murphy elements X1,X2,…,Xn−1 on it. ∎
Lemma 4.3 implies Corollaries 4.4 and 4.5.
Part (a) of Corollary 4.4 is [MRW04, Corollary 25] and is also stated as Theorem 2.1 in [Ore07].
Corollary 4.4**.**
For λ∈Y(r,n) and μ(n,i)∈Yn(r,n−1), the following are true for t∈Z:
(a)
As a G(r,1,n)-module,
[TABLE]
2. (b)
As a L(r,1,n)-module,
[TABLE]
Corollary 4.5**.**
For t∈Z:
(a)
As a G(r,1,n)-module, δ0t is parametrized by (∅,…,∅,(n),∅,…,∅)∈Y(r,n), where (n) occurs at (t+1)(\mboxmodr)-th component.
2. (b)
As a L(r,1,n)-module, δ0t is parametrized by the (n,(t+1)(\mboxmodr))-colored r-tuple (∅,…,∅,(n−1)n,∅,…,∅)∈Yn(r,n−1), where (n−1) also occurs at (t+1)(\mboxmodr)-th component.
We define a combinatorial object (m,p)-necklace as in [HR98, p. 174] which will be useful in parametrization of irreducible G(r,p,n)-modules and L(r,p,n)-modules.
Let λ=(λ1,λ2,…,λr)∈Y(r,n). For each i such that 1≤i≤m, consider the p-tuple
[TABLE]
Depict λ~(i) as a p-necklace in the following way: the circular necklace, with centre on the x-axis, has p nodes and lies in a vertical xy-plane with the first node λi placed at the point, where tangent to the necklace in (y>0)-half plane is parallel to the x-axis. The placement of nodes is done in clockwise direction with the j-th node being λ(j−1)m+i and placed at a clockwise angle of 2π/(j−1) with y-axis for j=2,…,p. A (m,p)-necklace of total n boxes obtained from λ∈Y(r,n), denoted by λ~, is a m-tuple
[TABLE]
where λ~(i) is a p-necklace for each 1≤i≤m. For 1≤j≤p and 1≤i≤m, let λ~(i,j) denote the j-th node in λ~(i), i.e., λ~(i,j)=λ(j−1)m+i. Thus, we have
[TABLE]
Two (m,p)-necklaces, λ~ and μ~, both of total boxes n, are said to be equivalent if for some integer t, λ~(i,j)=μ~(i,(j+t)(modp)) for all 1≤j≤p and 1≤i≤m. Let Y(m,p,n) denote the set of inequivalent (m,p)-necklaces of total n boxes.
Note that for any element μ∈[λ], the stabilizer subgroup Cμ=Cλ. So, the stabilizer subgroup of a representative of [λ] can be written as Cλ while considering (m,p)-necklace λ~.
Example 4.6**.**
An example of a (3,4)-necklace of total 30 boxes obtained from
[TABLE]
* **
*
* **
*
(1,1)
* **
*
(1,2)
* **
*
* **
*
* **
*
(1,3)
* **
*
(1,4),
* **
*
* **
*
(2,1)
* **
*
* **
*
(2,2)
* **
*
* **
*
(2,3)
* **
*
(2,4),
* **
*
* **
*
* **
*
(3,1)
* **
*
* **
*
(3,2)
* **
*
(3,3)
* **
*
(3,4).
Theorem 4.7 and its proof follows the expositions in [Ste89, MY98, BB07].
Theorem 4.7**.**
The irreducible G(r,p,n)-modules are parametrized by the ordered pairs (λ~,δ), where λ~∈Y(m,p,n) and δ∈Cλ. Given λ∈Y(r,n), the restriction of the corresponding G(r,1,n)-module Vλ to G(r,p,n) has multiplicity free decomposition given as:
[TABLE]
Also, for μ∈[λ],
[TABLE]
Proof.
The group C=⟨δ0m⟩ acts on the set of irreducible G(r,1,n)-modules. For λ∈Y(r,n), suppose that [λ] denotes the elements in Y(r,n) which parametrize the irreducible G(r,1,n)-modules in the orbit of Vλ. Using Corollary 4.4(a), we have
[TABLE]
Let the order of the orbit [λ] be b(λ). Then, the order of the stabilizer subgroup Cλ is u(λ):=b(λ)p. Also, Cλ is generated by δ0b(λ)m. The result follows from Theorem 2.8.
∎
Given μ~∈Y(m,p,n−1), the (n,i,j)-colored (m,p)-necklace, denoted by μ~(n,i,j), is obtained by coloring μ~(i,j) by n, for 1≤i≤m and 1≤j≤p. The colored (m,p)-necklaces, μ~(n,i,j) and ν~(n,s,t), are equivalent if and only if
(i)
i=s, and j=(t+l)(\mboxmodp) for some l∈Z, and
2. (ii)
the corresponding μ~ and ν~ are equivalent as (m,p)-necklaces using the same l as in (i), i.e., μ~(a,b)=ν~(a,(b+l)(modp)) for all 1≤a≤m and 1≤b≤p.
Let Yn(m,p,n−1) be the set of inequivalent (n,i,j)-colored (m,p)-necklaces of total n−1 boxes for all 1≤i≤m, 1≤j≤p.
Example 4.8**.**
Corresponding to the example 4.6, the following is a colored (3,4)-necklace where we take (i,j)=(2,3):
By depicting μ=(μ1,μ2,…,μtn,…,μr)∈Yn(r,n−1) as a (m,p)-necklace, we get μ~(n,i,j)∈Yn(m,p,n−1), where t=(j−1)m+i for a unique pair (i,j) such that 1≤i≤m and 1≤j≤p.
Theorem 4.9**.**
The irreducible L(r,p,n)-modules are parametrized by the elements of Yn(m,p,n−1).
For μ(n,t)∈Yn(r,n−1), the restriction of the corresponding irreducible L(r,1,n)-module Vμ(n,t) to L(r,p,n) has multiplicity free decomposition given as:
[TABLE]
where t=(j−1)m+i for a unique pair (i,j) such that 1≤i≤m and 1≤j≤p. Also, for any ν(n,s)∈[μ(n,t)],
[TABLE]
Proof.
The group C=⟨δ0m⟩ acts on the set of irreducible L(r,1,n)-modules. For μ(n,t)∈Yn(r,n−1), suppose that [μ(n,t)] denotes the elements in Yn(r,n−1) which parametrize the irreducible L(r,1,n)-modules in the orbit of Vμ(n,t). Using Corollary 4.4(b), we have
[TABLE]
Since the color is also shifting, therefore, the number of elements in the orbit is p and thus the stabilizer subgroup consists of identity element only. The results follow from Theorem 2.8.
∎
Branching rule from G(r,p,n) to L(r,p,n).
The construction of higher Specht polynomials for G(r,p,n) from the higher Specht polynomials for G(r,1,n) was described in [MY98] to decompose a module isomorphic to left regular G(r,p,n)-module into its irreducible submodules. Applying a similar (but not identical) construction on the canonical GZ-bases of irreducible G(r,1,n)-modules obtained in Okounkov-Vershik approach in Section 2, we construct the bases of irreducible G(r,p,n)-modules in Theorem 4.10. We use such constructed basis to show in Theorem 4.11 that the irreducible G(r,p,n)-modules V(λ~,δ1) and V(λ~,δ2), for λ~∈Y(m,p,n) and δ1,δ2∈Cλ, are isomorphic as L(r,p,n)-modules. Theorem 4.11 is useful in the proof of Theorem 4.12 for description of branching rule from G(r,p,n) to L(r,p,n).
Fix λ∈Y(r,n). Define the shift map
sh:\mboxTab(r,λ)⟶\mboxTab(r,λ)
by
[TABLE]
Since Cλ is generated by δ0mb(λ), the G(r,1,n)-modules Vλ and δ0mb(λ)⊗Vλ are isomorphic. Suppose that T∈\mboxTab(r,λ) and 1δ0mb(λ) is the basis element of one-dimensional G(r,1,n)-module δ0mb(λ). Using Corollary 4.4(a), define the G(r,1,n)-linear isomorphism \mathpzcE:Vλ⟶δ0mb(λ)⊗Vλ by
[TABLE]
Also, the map \mathpzcF:δ0mb(λ)⊗Vλ⟶Vλ given by
1δ0mb(λ)⊗vT↦vT
is a G(r,p,n)-linear isomorphism.
The associator of Vλ is given by
[TABLE]
For h=1,2,…,r, we define
[TABLE]
For T∈\mboxTab(r,λ)mb(λ), we get the following u(λ) distinct standard r-Young tableaux:
[TABLE]
An element δ∈Cλ=⟨δ0mb(λ)⟩ can be identified with ζlmb(λ) for some 0≤l≤u(λ)−1.
Fixing δ∈Cλ, we define, for each T∈\mboxTab(r,λ)mb(λ),
[TABLE]
The linear independence of {vT∣T∈\mboxTab(r,λ)} implies that {vT(δ)∣T∈\mboxTab(r,λ)mb(λ)}, for a fixed δ∈Cλ, is linearly independent.
Theorem 4.10**.**
For λ=(λ1,λ2,…,λr)∈Y(r,n), consider λ~∈Y(m,p,n). For each δ∈Cλ, define
[TABLE]
The following are true:
(a)
The eigenspace decomposition of Vλ with respect to the associator \mathpzcAλ is:
[TABLE]
2. (b)
The eigenspace V(λ~,δ), for δ∈Cλ, is an irreducible G(r,p,n)-module.
3. (c)
The set {V(λ~,δ)∣λ~∈Y(m,p,n),δ∈Cλ} is the complete set of irreducible G(r,p,n)-modules.
Proof.
It can be seen from the definition of the associator \mathpzcAλ in (4) that
[TABLE]
This implies that the subspaces V(λ~,δ), for δ∈Cλ, are contained in the distinct eigenspaces of \mathpzcAλ. Thus, we have
[TABLE]
Also for each δ∈Cλ, the dimension of V(λ~,δ) is equal to the number of elements in \mboxTab(r,λ)mb(λ), denoted by #(\mboxTab(r,λ)). This implies that we have
[TABLE]
Thus, the dimensions of both sides in (13) are equal which implies equality in (13). This proves part (a).
The proofs of parts (b) and (c) follow from Clifford theory and part (a) of this theorem.
∎
Theorem 4.11**.**
For a fixed λ~∈Y(m,p,n) and δ1,δ2∈Cλ, we have
[TABLE]
Proof.
The linear map θ:V(λ~,δ1)⟶V(λ~,δ2) defined by setting
[TABLE]
is an L(r,p,n)-module isomorphism.
∎
Given λ~∈Y(m,p,n),1≤i≤m,1≤j≤p, let λ~↓(i,j) denote the set of all elements in Yn(m,p,n−1) obtained by deleting a box from an inner corner in λ~(i,j) and then coloring the corresponding node by n. For a fixed 1≤i≤m, define J(i)⊆{1,2,…,p} such that for s,t∈J(i),s=t, we have λ~↓(i,s)⋂λ~↓(i,t)=∅.
If λ~↓(i,s)⋂λ~↓(i,t)=∅, then λ~↓(i,s)=λ~↓(i,t).
Theorem 4.12** (Branching rule from G(r,p,n) to L(r,p,n)).**
For λ~∈Y(m,p,n) and δ∈C(λ), we have
[TABLE]
and the branching rule from G(r,p,n) to L(r,p,n) is multiplicity free.
Proof.
We use the transitivity of restriction from G(r,1,n) to L(r,p,n):
[TABLE]
Given λ~, we have λ∈Y(r,n). Considering Vλ as L(r,1,n)-module, Theorem 4.2 implies that
[TABLE]
Writing t=(j−1)m+i, where 1≤i≤m,1≤j≤p, we note that u(λ) distinct elements of Yn(r,n−1)
[TABLE]
give rise to the same μ~(n,i,j)∈Yn(m,p,n−1) and j∈J(i). Also, from μ(n,s) (not in (15)) such that s=(y−1)m+i, where 1≤y≤p, we get μ~(n,i,y)∈Yn(m,p,n−1), not equivalent to μ~(n,i,j), and thus y∈J(i) and y=j. Restricting Vλ as L(r,p,n)-module in (14), Theorem 4.9 implies that
[TABLE]
Considering Vλ as G(r,p,n)-module, Theorem 4.7 implies that
[TABLE]
Further restricting Vλ as L(r,p,n)-module in (17), using Theorem 4.11 and the order of Cλ being u(λ), we get
[TABLE]
where δ∈Cλ.
The result follows from (16) and (18).
∎
5 Schur-Weyl duality for Tanabe algebras
Let V=Cn be the n-dimensional vector space with standard basis {v1,v2,…,vn}. There is a natural action of GLn(C) on V. For k∈Z≥0, consider the k-fold tensor product V⊗k=V⊗V⊗⋯⊗V with the basis
[TABLE]
With respect to this basis, F∈\mboxEnd(V⊗k) can be written as a matrix (Fi1′,⋯,ik′i1,⋯,ik) such that
[TABLE]
The action of GLn(C) on V⊗k is given by
[TABLE]
for g∈GLn(C) and vi1⊗vi2⊗⋯⊗vik∈V⊗k. The symmetric group Sn can be identified with the subgroup of permutation matrices of GLn(C). Also, we can identify the subgroup Sn−1 of Sn fixing n with the subgroup of of permutation matrices having (n,n)-th entry as 1 of GLn(C). The action of Sn on V⊗k is given by the restriction of the action of GLn(C) to Sn. Define V⊗(k+21):=V⊗k⊗vn, a subspace of V⊗(k+1), which is isomorphic to V⊗k as a Sn−1-module.
Define a map
[TABLE]
such that for d∈Ak and for 1≤i1,i2,…,ik,i1′,i2′,…,ik′≤n,
The action of the partition algebra CAk+21(n) on V⊗(k+21) is
[TABLE]
given by ϕk+21=ϕk+1∣CAk+21(n).
The following theorem is [HR05, Theorem 3.6] which shows that CAk(n) and CAk+21(n) are in Schur-Weyl duality with Sn and Sn−1 acting on V⊗k and V⊗(k+21) respectively.
Theorem 5.1**.**
(a)
The image of the map ϕk:CAk(n)→\mboxEnd(V⊗k) is \mboxEndSn(V⊗k) and the kernel is given by C\mbox−span{xd∣d\mboxhasmorethann\mboxblocks}. Thus, the partition algebra CAk(n) is isomorphic to \mboxEndSn(V⊗k) if and only if n≥2k.
2. (b)
The image of the map ϕk+21:CAk+21(n)→\mboxEnd(V⊗(k+21)) is \mboxEndSn−1(V⊗(k+21)) and the kernel is given by
C\mbox−span{xd∣d\mboxhasmorethann\mboxblocks}. Thus, the partition algebra CAk+21(n) is isomorphic to \mboxEndSn−1(V⊗(k+21)) if and only if n≥2k+1.
Let Πk(r,n) and Πk+21(r,n) be subsets of Πk(r) and Πk+21(r) (defined in Section 3) respectively consisting of those elements which have at most n blocks. Define
[TABLE]
subsets of Ak(r,p,n) and Ak+21(r,p,n) respectively.
The actions of G(r,p,n) and L(r,p,n) on V are given by restrictions of the action of GLn(C) on V. Also, V is the reflection representation of G(r,p,n). We note that C-span{vn} is a L(r,p,n)-invariant subspace of V.
The following lemma gives bases of the centralizer algebras of the diagonal actions of G(r,p,n) and L(r,p,n) on V⊗k and V⊗(k+21) respectively. Part (a) is [Tan97, Lemma 2.1] and we follow the proof there to prove part (b) here.
Lemma 5.2**.**
(a)
{ϕk(xd))∣d∈Πk(r,p,n)}* is a basis of \mboxEndG(r,p,n)(V⊗k).*
2. (b)
{ϕk+21(xd)∣d∈Πk+21(r,p,n)}* is a basis of \mboxEndL(r,p,n)(V⊗(k+21)).*
Proof.
(b) An element d∈Πk+21(r,p,n) has at most n blocks. By part (b) of Theorem 5.1, ϕk+21(xd)=0. Also,
[TABLE]
is a linearly independent set.
Since Sn−1 is a subgroup of L(r,p,n), thus we have
[TABLE]
Choose 0=F∈\mboxEndL(r,p,n)(V⊗(k+21)). Then, F can be written as
[TABLE]
with ϕk+21(xd)=0 and ad=0 for some d∈Ak+21.
Fix such a d∈Ak+21 and let 1≤i1,…,ik,i1′,…,ik′≤n with ik+1=i(k+1)′=n such that
[TABLE]
For 1≤u≤n, define
[TABLE]
Note that d=(B1,B2,…,Bn), where some of the blocks B1,B2,…,Bn−1 may be empty and {k+1,(k+1)′}⊆Bn.
For 1≤i≤n, define
[TABLE]
where ζp is i-th component, and for 1≤i=j≤n, define
[TABLE]
where ζ and ζ−1 are i-th and j-th components respectively. The elements ti, for 1≤i≤n, and the elements hij, for 1≤i=j≤n, together generate \mboxD(r,p,n).
If N(B1)≡M(B1)(\mboxmodr), then (24) implies that N(Bi)≡M(Bi)(\mboxmodr) for all 1≤i≤n. So, we have
[TABLE]
2. (ii)
If N(B1)≡M(B1)(\mboxmodr), then (24) implies that N(Bi)≡M(Bi)(\mboxmodr) for all 1≤i≤n. Thus, the number of elements, N(Bi)+M(Bi), in the block Bi is nonzero for all 1≤i≤n. So, all the n blocks, B1,…,Bn, in d are nonempty. Along with (23), we get d∈Λk+21(r,p,n).
Combining both the cases we get that d∈Πk+21(r,p,n).
∎
Recall from Section 3 that Tanabe algebras \mathpzcTk(r,p,n) and \mathpzcTk+21(r,p,n) are subalgebras of partition algebras CAk(n) and CAk+21(n) respectively. The actions of \mathpzcTk(r,p,n) and \mathpzcTk+21(r,p,n) on V⊗k and V⊗(k+21) respectively are given by:
[TABLE]
The next theorem shows that \mathpzcTk(r,p,n) and \mathpzcTk+21(r,p,n) are in Schur-Weyl duality with G(r,p,n) and L(r,p,n) acting on V⊗k and V⊗(k+21) respectively.
Theorem 5.3**.**
(a)
The image of the map ψk:\mathpzcTk(r,p,n)→\mboxEnd(V⊗k) is \mboxEndG(r,p,n)(V⊗k) and the kernel is given by C\mbox−span{xd∣d∈Ak(r,p,n)\mboxhasmorethann\mboxblocks}. Thus, Tanabe algebra \mathpzcTk(r,p,n) is isomorphic to \mboxEndG(r,p,n)(V⊗k) if and only if n≥2k.
2. (b)
The image of the map ψk+21:\mathpzcTk+21(r,p,n)→\mboxEnd(V⊗(k+21)) is \mboxEndL(r,p,n)(V⊗(k+21)) and the kernel is given by C\mbox−span{xd∣d∈Ak+21(r,p,n)\mboxhasmorethann\mboxblocks}. Thus, Tanabe algebra \mathpzcTk+21(r,p,n) is isomorphic to \mboxEndL(r,p,n)(V⊗(k+21)) if and only if n≥2k+1.
Proof.
(a)
For r=1, this is Theorem 5.1(a) which is Schur-Weyl duality between CAk(n) and Sn acting on V⊗k. Now consider r≥2.
Using Lemma 5.2(a), we have
[TABLE]
The element d∈Ak(r,p,n)∖Πk(r,p,n) has more than n blocks. So, Theorem 5.1(a) implies that
[TABLE]
for vi1⊗vi2⊗⋯⊗vik∈V⊗k.
Thus, we get the image and kernel as stated in the theorem.
The kernel of ψk is zero if and only if n≥2k.
2. (b)
The proof of this part is along the similar lines as that of part (a) using Lemma 5.2(b) and Theorem 5.1(b). ∎
Remark 5.4**.**
Putting p=1 in Theorem 5.3(a) we recover Schur-Weyl duality between \mathpzcTk(r,1,n) and G(r,1,n) as given in [Ore07, Theorem 5.4].
6 Bratteli diagram of Tanabe algebras
Let us first study the decomposition of V⊗k and V⊗(k+21) as G(r,p,n)-module and as L(r,p,n)-module respectively. For the rest of the paper, we assume that r≥2.
It can be easily seen using Okounkov-Vershik approach that the G(r,1,n)-module V is an irreducible module parametrized by ((n−1),(1),∅,…,∅)∈Y(r,n). Using the theory of Section 4, we see that for (r,p,n)=(2,2,2), the G(r,p,n)-module V is an irreducible module parametrized by (λ~,δ), where λ~∈Y(m,p,n) and δ∈Cλ are as follows:
(i)
If p=r, then λ~=(λ~(1),…,λ~(m)) with
[TABLE]
and δ=1 since Cλ={1}.
2. (ii)
If p=r and (r,p,n)=(2,2,2), then λ~=(λ~(1))=((n−1),(1),∅,…,∅) and δ=1 since Cλ={1}.
For (r,p,n)=(2,2,2), V is the direct sum of irreducible G(2,2,2)-modules parametrzied by (((1),(1)),1) and (((1),(1)),−1).
Suppose that 1n is the trivial representation of G(r,1,n). Then, σ=1n−1⊗σ2 is a one-dimensional representation of L(r,1,n) and thus, by restriction, a representation of L(r,p,n). The parametrization of σ as a L(r,1,n)-module is μ=((n−1),∅n,∅,…,∅)∈Yn(r,n−1). The parametrization of σ as a L(r,p,n)-module is μ~(n,i,j)∈Yn(m,p,n−1) given as follows:
(i)
If p=r, then i=2,j=1 and μ~(n,2,1)=(μ~(1),μ~(2)(n,1),…,μ~(m)) with
[TABLE]
2. (ii)
If p=r, then i=1,j=2 and μ~(n,1,2)=(μ~(1)(n,2))=((n−1),∅n,∅,…,∅).
Using the above parametrizations of V and σ, by Frobenius reciprocity and Theorem 4.12, we have (for (r,p,n)=(2,2,2) also)
[TABLE]
Let M be a G(r,p,n)-module. Then using the tensor identity, we have
[TABLE]
Thus, taking M=V⊗(k−1) for k≥1, we have
[TABLE]
as G(r,p,n)-module and L(r,p,n)-module respectively.
It will be clear from the context whether we consider σ as a L(r,1,n)-module or as a L(r,p,n)-module.
Given λ(n,t)∈Yn(r,n−1), assume that Vλ(n,t) is the corresponding irreducible L(r,1,n)-module.
Lemma 6.1**.**
For λ(n,t)∈Yn(r,n−1)
[TABLE]
where λ(n,z)∈Yn(r,n−1) and z=(t+1)(\mbox\emmodr).
Proof.
Noting that the GZ-subspace of σ is given by (n−1)\mbox−foldσ1⊗⋯⊗σ1⊗σ2 with GZ-basis element given by (n−1)\mbox−foldv1⊗⋯⊗v1⊗v2, the proof is similar to that of Theorem 4.3.
∎
Given an (n,i,j)-colored (m,p)-necklace λ~(n,i,j)∈Yn(m,p,n−1), suppose that Vλ~(n,i,j) is the corresponding irreducible L(r,p,n)-module.
Lemma 6.2**.**
For λ~(n,i,j)∈Yn(m,p,n−1)
[TABLE]
where λ~(n,x,y)∈Yn(m,p,n−1) is obtained from λ~(n,i,j) by the following rule:
(i)
If i<m, then x=i+1 and y=j;
2. (ii)
If i=m, then x=1 and y=(j+1)(\mboxmodp).
Proof.
The proof follows by using Lemma 6.1 and Theorem 4.9.
∎
Define the sets Ωk(r,p,n) and Ωk+21(r,p,n) as follows.
Let
[TABLE]
where λ~=(((n),∅,…,∅),(∅,…,∅),…,(∅,…,∅))∈Y(m,p,n).
For k∈Z>0 the sets Ωk(r,p,n)⊆Y(m,p,n)×C and Ωk+21(r,p,n)⊆Yn(m,p,n−1) are obtained by the following recursive rule.
From Ωk(r,p,n) to Ωk+21(r,p,n):
For (λ~,δ)∈Ωk(r,p,n), let λ~(i,j)−∈Y(m,p,n−1) be the set of (m,p)-necklaces obtained by deleting an inner corner from λ~(i,j).
For μ~∈λ~(i,j)−, color μ~ by (n,i,j) to obtain μ~(n,i,j)∈Ωk+21(r,p,n).
From Ωk+21(r,p,n) to Ωk+1(r,p,n):
For μ~(n,i,j)∈Ωk+21(r,p,n), remove the color (n,i,j) to get μ~∈Y(m,p,n−1) and then add a box to an outer corner, either in the j-th node of (i+1)-th component of μ~ if 1≤i≤m−1 or in the (j+1)(\mboxmodp)-th node of the first component of μ~ if i=m, to obtain ν~∈Y(m,p,n). Let Cν be the correspoding stabilizer subgroup. For δ∈Cν⊆C, the element (ν~,δ)∈Ωk+1(r,p,n).
Theorem 6.3**.**
The indexing sets of the irreducible G(r,p,n)-modules occuring in V⊗k and of the irreducible L(r,p,n)-modules occuring in V⊗(k+21) are Ωk(r,p,n) and Ωk+21(r,p,n) respectively.
Proof.
The proof follows from (25), (26), Lemma
6.2, branching rule from G(r,p,n) to L(r,p,n) in Theorem 4.12, Frobenius reciprocity and the observation that the spaces V⊗(k+21) and V⊗k are isomorphic as L(r,p,n)-modules.
∎
Theorem 6.4**.**
The indexing sets of the irreducible \mboxEndG(r,p,n)(V⊗k)-modules and of the irreducible \mboxEndL(r,p,n)(V⊗(k+21))-modules are Ωk(r,p,n) and Ωk+21(r,p,n) respectively.
Proof.
The proof is a consequence of the centralizer theorem ([HR05, Theorem 5.4]) and Theorem 6.3.
∎
Theorem 6.5**.**
Let n and k be nonnegative integers.
(a)
For n≥2k, as (C[G(r,p,n)],\mathpzcTk(r,p,n))-bimodule,
[TABLE]
where V(λ~,δ) is the irreducible G(r,p,n)-module and \mathpzcTk(λ~,δ) is the irreducible \mathpzcTk(r,p,n)-module parametrized by (λ~,δ)∈Ωk(r,p,n). Also
[TABLE]
2. (b)
For n≥2k+1, as (C[L(r,p,n)],\mathpzcTk+21(r,p,n)))-bimodule,
[TABLE]
where Vμ~(n,i,j) is the irreducible L(r,p,n)-module and \mathpzcTk+21μ~(n,i,j) is the irreducible
\mathpzcTk+21(r,p,n)-module parametrized by μ~(n,i,j)∈Ωk+21(r,p,n) and
[TABLE]
Proof.
The proofs of (a) and (b) follow from Theorem 5.3(a) and (b) respectively along with the centralizer theorem, Theorem 6.3 and Theorem 6.4.
∎
For (λ~,δ)∈Ωk(r,p,n), define the set Ak−21(λ~,δ) as consisting of the elements μ~(n,i,j)∈Ωk−21(r,p,n) for some 1≤i≤m and 1≤j≤p such that (λ~,δ) is obtained from μ~(n,i,j) while constructing Ωk(r,p,n) from Ωk−21(r,p,n).
For μ~(n,i,j)∈Ωk+21(r,p,n), define the set Akμ~(n,i,j) as consisting of the elements (λ~,δ)∈Ωk(r,p,n) such that μ~(n,i,j) is obtained from (λ~,δ) while constructing Ωk+21(r,p,n) from Ωk(r,p,n).
Corollary 6.6**.**
(a)
For n≥2k and for (λ~,δ)∈Ωk(r,p,n), we have
[TABLE]
2. (b)
For n≥2k+1 and for μ~(n,i,j)∈Ωk+21(r,p,n), we have
From the above isomorphism and Frobenius reciprocity, we get
[TABLE]
where σ′ is the contragredient representation of σ. The L(r,1,n)-representation σ′=σ−1=(r−1)\mbox−foldσ⊗⋯⊗σ and thus, σ′ is parametrized by ((n−1),∅,…,∅,∅n)∈Yn(r,n). First using Theorem 4.12 and then by the repeated application of Lemma 6.2, we compute σ′⊗\mboxResL(r,p,n)G(r,p,n)V(λ~,δ). Then, from (a) and Theorem 6.5(b), we have the restriction rule.
2. (b)
The proof is along the similar lines as that of part (a) using Theorem 6.5(b), (26), Theorem 4.12, Frobenius reciprocity and Theorem 6.5(a).
∎
Orellana [Ore07, p. 614] describes the rule for recursively constructing Bratteli diagram for the tower of algebras
[TABLE]
We consider the tower of Tanabe algebras
[TABLE]
and using Theorems 6.3, 6.4 and Corollary 6.6, construct the corresponding Bratteli diagram \mathpzcT(r,p,n) recursively by the following rule: For l∈21Z≥0, the vertices at l-th level of Bratteli diagram are elements of the set Ωl(r,p,n). A vertex \mathpzcvl at l-th level is connected by an edge with a vertex \mathpzcvl+21 at (l+21)-th level if and only if \mathpzcvl+21 is obtained from \mathpzcvl while constructing Ωl+21(r,p,n) from Ωl(r,p,n). The Bratteli diagram of Tanabe algebras is a simple graph.
Remark 6.7**.**
For t∈Z≥0, t≤⌊2n⌋ and (λ~,δ)∈Ωt(r,p,n), the stabilizer subgroup Cλ is non-trivial if and only if (r,p,n)=(2,2,2k) and t=k; in this case Cλ={1,−1}. Thus, for n≥2k, there is a one-to-one correspondence between the irreducible representations of the same degree occuring at t-th level in Bratteli diagrams for \mathpzcTk(r,1,n) and \mathpzcTk(r,p,n) if and only if (r,p,n,t)=(2,2,2k,k); the correspondence in terms of parametrization is λ↦(λ~,1).
We draw Bratteli diagram for (r,p,n)=(2,2,4). Note that at level k=2, a node parametrized by (λ~,−1) also appears when λ=((2),(2)) because Cλ is nontrivial.
The following is a part of Bratteli diagram of Tanabe algebras when (r,p,n)=(6,2,6). Note that \mathpzcT25\mathpzcv corresponding to \mathpzcv=(((4),∅),((1)6,∅),(∅,∅))) is of dimension two. (Due to limitation of width of the page, we have written the nodes at level k=25 in two rows.)
Recall from Section 2 that the Jucys-Murphy elements for G(r,1,n) are:
[TABLE]
For T∈\mboxTab(r,λ), we have
[TABLE]
and it is easily seen that b∈λ∑c(b) is independent of the choice of T∈\mboxTab(r,λ).
Lemma 7.1**.**
(a)
For r,n∈Z≥0,
[TABLE]
is a central element of C[G(r,p,n)] and κr,n=b∈λ∑c(b) as operators on V(λ~,δ), the irreducible G(r,p,n)-module parametrized by (λ~,δ)∈Y(m,p,n)×Cλ.
2. (b)
For r,n∈Z≥0,
[TABLE]
is a central element of C[L(r,p,n)] and κr,n−1=b∈μ∑c(b) as operators on Vμ(n,i), the irreducible L(r,1,n)-module parametrized by μ(n,i)∈Yn(r,n−1).
Proof.
(a)
First, we consider the case p=1. Being the sum of elements in the conjugacy class of (1,1,…,1,s12), κr,n is a central element of C[G(r,1,n)] and
[TABLE]
For the irreducible G(r,1,n)-module Vλ parametrized by λ∈Y(r,n), the canonical decomposition of Vλ into GZ-subspaces is
[TABLE]
Using Theorem 2.7 for the action of Jucys-Murphy elements of G(r,1,n), we have
[TABLE]
where vT is GZ-basis element corresponding to T∈\mboxTab(r,λ). Thus, κr,n=b∈λ∑c(b) as operators on Vλ.
For a divisor p of r, note that κr,n∈C[G(r,p,n)]⊆C[G(r,1,n)]. Thus, κr,n is a central element of C[G(r,p,n)] also, and its action on the irreducible G(r,p,n)-module V(λ~,δ) follows by restricting the action of G(r,1,n) on Vλ.
2. (b)
The proof is along the similar lines as that of part (a). ∎
Now, we describe a specific central element in C[G(2,2,2k)]. The conjugacy class C of the element (1,1,…,1,(12)(34)⋯(2k−1,2k)) in G(2,1,2k) consists of elements of the
form (a1,a2,…,a2k,(i1,i2)(i3,i4)⋯(i2k−1,i2k)) such
that (i1,i2),(i3,i4),…,(i2k−1,i2k) are mutually disjoint transpositions in S2k, and aijaij+1=1 for all j=1,3,…,2k−1 with ai∈G=Z/2Z={1,−1} for all i=1,…,2k. Using [Rea77, Theorem 11], the conjugacy class of (1,1,…,1,(12)(34)⋯(2k−1,2k)) in G(2,1,2k) decomposes into two conjugacy classes, denoted by C1 and C2, in G(2,2,2k) with
representatives
[TABLE]
[TABLE]
respectively. The classes C1 and C2 consist of those elements in C such that the number of pairs (aij,aij+1)=(−1,−1), where j=1,3,…,2k−1, is odd and even respectively. Let z1 and z2 be the conjugacy class sums of C1 and C2 respectively. Define z=z2−z1 which is a central element in C[G(2,2,2k)].
Lemma 7.2**.**
Let λ∈Y(2,2k).
(a)
For λ=((k),(k)), z=0 as operators on the irreducible G(2,2,2k)-module V(λ~,1).
2. (b)
For λ=((k),(k)), z=2kk! as operators on the irreducible G(2,2,2k)-module V(λ~,1) and z=−2kk! as operators on the irreducible G(2,2,2k)-module V(λ~,−1).
Proof.
In the following, we use [MS16, Theorem 6.10] to describe the action of z on irreducible G(2,2,2k)-modules.
The irreducible G(2,1,2k)-module Vλ parametrized by λ=(λ1,λ2)∈Y(2,2k) has a GZ-basis element vR where R=(R1,R2) is the element of \mboxTab(2,λ) written in row major order, i.e., the entries in R1 are in from 1,…,∣λ1∣ and entries in R2 are from ∣λ1∣+1,…,∣λ1∣+∣λ2∣, both filled in row major order.
We have the following cases:
(a)
λ=((k),(k)): Vλ remains irreducible as G(2,2,2k)-module and V(λ~,1)=Vλ with vR(1)=vR as one of the basis elements using the parametrization of irreducible G(2,2,2k)-module in Theorem 4.7 and construction of basis of irreducible G(2,2,2k)-modules.
Let Y be the set of those π∈S2k which can be written as a product of disjoint transpositions such that the elements of each transposition are either in R1 or in R2. For a fixed π∈Y, the action of ∑(a1,…,a2k,π) on vR(1), where the sum is over all such elements in C1, is equal to the action of ∑(b1,…,b2k,π) on vR(1), where the sum is over all such elements in C2.
The coefficient of vR in tvR(1) is zero for any t∈C1∪C2 which is of the form t=(a1,a2,…,a2k,(i1,i2)(i3,i4)⋯(i2k−1,i2k)) such that there is at least one transposition (iy,iy+1) with one of iy,iy+1 being from the entries in R1 and the other being from the entries in R2.
Thus, we have zvR(1)=0.
2. (b)
λ=((k),(k)): Vλ decomposes into two irreducible as G(2,2,2k)-modules V(λ~,1) and V(λ~,−1) with vR(1)=vR+vsh(R) and vR(−1)=vR−vsh(R) as one of their basis elements respectively. Analogous to part (a), for a fixed π∈Y, the action of ∑(a1,…,a2k,π) on vR and vsh(R), where the sum is over all such elements in C1, is equal to the action of ∑(b1,…,b2k,π) on vR and vsh(R), where the sum is over all such elements in C2, respectively.
Let P be the set of those β∈S2k which can be written as a product of disjoint transpositions such that one element of each transposition is from 1,…,k and the other one is from k+1,…,2k. The order of P is k!. For (a1,…,a2k,β)∈C1 and β∈P, (a1,…,a2k,β)vR=−vsh(R) and (a1,…,a2k,β)vsh(R)=−vR.
For (a1,…,a2k,β)∈C2 and β∈P, (a1,…,a2k,β)vR=vsh(R) and (a1,…,a2k,β)vsh(R)=vR.
For those elements (a1,…,a2k,γ)∈C1∪C2 such that γ∈/Y∪P, the coefficients of both vR and vsh(R) in both (a1,…,a2k,γ)vR and (a1,…,a2k,γ)vsh(R) are zero.
Thus,
[TABLE]
Thus, we get the scalars as stated in the theorem. ∎
Assume that S is a subset of {1,2,…,k}, I is a subset of S⋃S′ and Ic denotes the complement of I in S⋃S′, where S′ is the set of all j′ such that j∈S. Define the elements bS and dI of the partition monoid Ak:
[TABLE]
Thus, bS∈Πk(r). Also, it is easy to see that
[TABLE]
Example 7.3**.**
For k=6, S={1,2,4}, and I={1,4′}⊂S∪S′, bS and dI are:
Following the notation of Section3, let N(I) and M(I) denote the number of elements in top row and bottom row of the block I respectively.
For k∈Z≥0, we define an element Zk,r∈\mathpzcTk(r,1,n)⊆\mathpzcTk(r,p,n):
[TABLE]
where the outer sum is over all the nonempty subsets S of {1,2,…,k} and the inner sum is over I⊆S⋃S′ such that dI∈Πk(r) and dI=bS.
Define an element Zk+21,r∈\mathpzcTk+21(r,1,n)⊆\mathpzcTk+21(r,p,n) as follows:
[TABLE]
where the first outer sum is over all the nonempty subsets S of {1,2,…,k+1} such that k+1∈/S and the inner sum in that is over I⊆S⋃S′ such that dI∈Πk+21(r) and dI=bS;
and the second outer sum is over all the nonempty subsets S of {1,2,…,k,k+1} such that k+1∈S and the inner sum in that is over I⊆S⋃S′ such that
{k+1,(k+1)′}⊆I\mboxorIc, dI∈Πk+21(r) and dI=bS.
The elements Zk,r and Zk+21,r and the idea of the proof of the next theorem are from the online notes [Ram10a].
Theorem 7.4**.**
(a)
Let k∈Z≥0. Then,
[TABLE]
as operators on V⊗k and V⊗(k+21) respectively.
2. (b)
Let k∈Z≥0. Then Zk,r is a central element of \mathpzcTk(r,p,n). For n≥2k
[TABLE]
as operators on \mathpzcTk(λ~,δ), the irreducible \mathpzcTk(r,p,n)-module parametrized by
(λ~,δ)∈Ωk(r,p,n).
Also, Zk+21,r is a central element of \mathpzcTk+21(r,p,n). For n≥2k+1,
[TABLE]
as operators on \mathpzcTk+21μ~(n,i,j), the irreducible \mathpzcTk+21(r,p,n)-module parametrized by μ~(n,i,j)∈Ωk+21(r,p,n).
Proof.
(a)
We express the action of κr,n in terms of matrices Ei,j.
[TABLE]
Let S be a subset of {1,2,…,k} such that Sc corresponds to the tensor positions where 1 is acting, I⊂S⋃S′ corresponds to the tensor positions that must equal i and Ic corresponds to the tensor positions that must equal j. Let
[TABLE]
Thus, expanding (a), we get that 2κr,n(vi1⊗vi2⊗⋯⊗vik) equals
[TABLE]
Now, we take various cases of S and I to compute the above expression (32). Let ∣S∣=0, then I is empty set and
Assume that ∣S∣≥1 and we consider various cases of I⊂S⋃S′. Since the whole sum is symmetric in i and j and in I and Ic, therefore, the sum obtained is same when I is interchanged with Ic. If I=S⋃S′, then
[TABLE]
and thus the corresponding summand in expression (32) is
[TABLE]
We get an identical summand for the case I=∅.
Consider I⊊S⋃S′ and N(I)≡M(I)(\mboxmodr). Let
[TABLE]
[TABLE]
[TABLE]
Thus, N(I)=∣T(I)∣,M(I)=∣D(I)∣. Also, we can see that
[TABLE]
[TABLE]
Thus,
[TABLE]
In this case, since the sum of all the r-th roots of unity is zero, so the summand for all such I in expression (32) is zero.
Now, consider those subsets I⊊S⋃S′ such that N(I)≡M(I)(\mboxmodr). Define B(I)′:={t′∣t∈B(I)}, thus
[TABLE]
[TABLE]
This implies that
[TABLE]
Thus, for the subsets I such that N(I)≡M(I)(\mboxmodr), we get
the summand in expression (32) as:
[TABLE]
Also, for the subsets I such that N(I)≡M(I)(\mboxmodr), we also have N(Ic)≡M(Ic)(\mboxmodr) and thus we get an identical summand by interchanging I and Ic.
Combining all the above cases together, we get that, as operators on V⊗k,
[TABLE]
Now we prove the second part of (b). We have
[TABLE]
Thus,
[TABLE]
In the expression (a), the first summand is equal to 2κr,n(vi1⊗vi2⊗⋯⊗vik) which has been calculated in the first part of (b). Since i=j, so the last summand is zero. Expanding the middle summand gives
[TABLE]
The case ∣S∣=0 does not arise because k+1∈S. For ∣S∣>1, we consider various cases of I⊂S⋃S′ which are:
[TABLE]
and identical summands arise when I is interchanged with Ic in the cases (i),(ii), and (iii). Thus, the middle summand gives us
[TABLE]
So, as opeartors on V⊗(k+21), we have κr,n−1=Zk+21,r.
2. (b)
Using Theorem 6.5(a) and using Lemma 7.1(a), we get that for n≥2k, Zk,r acts on \mathpzcTk(λ~,δ) as the constant stated in the theorem. Therefore, Zk,r is a central element of \mathpzcTk(r,p,n) for n≥2k. Since the multiplication of elements of \mathpzcTk(r,p,n) is a polynomial in n, therefore
[TABLE]
for all xd∈\mathpzcTk(r,1,n) and for all n.
Theorem 6.5(b) and Lemma 7.1(b) along with the arguments similar to the above imply the result for Zk+21,r.
∎
In the light of Remarks 3.9 and 6.7, (r,p,n)=(2,2,2k) is the special case.
Define Mk,2,2:=xd∈\mathpzcTk(2,2,2k), where d is the only element in Λk(2,2,2k) and d consists of 2k blocks, each vertex being a block. The element Mk,2,2 is a central element of \mathpzcTk(2,2,2k).
Theorem 7.5**.**
(a)
Let k∈Z≥0. Then,
Mk,2,2=2k1z
as operators on V⊗k.
2. (b)
Let k∈Z≥0. Then, for λ=((k),(k)), Mk,2,2=0 as operators on the irreducible \mathpzcTk(2,2,2k)-module \mathpzcTk(λ~,1).
For λ=((k),(k)),
[TABLE]
as operators on the irreducible \mathpzcTk(2,2,2k)-module \mathpzcTk(λ~,1) and
[TABLE]
as operators on the irreducible \mathpzcTk(2,2,2k)-module \mathpzcTk(λ~,−1).
Proof.
(a)
The action of Mk,2,2 on V⊗k is:
[TABLE]
where π varies over all the permutations of {j1,…,jk}={1,…,2k}∖{i1,…,ik}.
Now, we discuss the action of z on V⊗k.
Consider vi1⊗⋯⊗vik∈V⊗k such that i1,…,ik are distinct elements of {1,…,2k}. Then,
[TABLE]
if (a1,…,a2k,(i1,j1)⋯(ik,jk))∈C1
and
[TABLE]
if (a1,…,a2k,(i1,j1)⋯(ik,jk))∈C2,
where in each case
[TABLE]
For a fixed (i1,j1)⋯(ik,jk) element in S2k, there are 2k−1 elements of the form (a1,…,a2k,(i1,j1)⋯(ik,jk)) in each of C1 and C2.
Consider an element of the form (a1,…,a2k,(x1,y1)⋯(xk,yk))∈C such that at least one pair, say {x1,y1}⊂{i1,…,ik}. Then, one of x2,…,xk, say xk, is different from i1,…,ik and one can choose yk∈{1,…,2k}∖{i1,…,ik,xk,y2,…,yk−1}. Now, (axk,ayk)=(1,1) or (axk,ayk)=(−1,−1) keeps the sign of the action of (a1,…,a2k,(x1,y1)⋯(xk,yk)) on (vi1⊗⋯⊗vik) same.
Given (b1,…,b2k,(x1,y1)⋯(xk,yk))∈C1 such that (bx1,by1)=(1,1), we have the element (f1,…,f2k,(x1,y1)⋯(xk,yk))∈C2, such that (fxi,fyi)=(bxi,byi) for i=k and (fxk,fyk)=−(bxk,byk) and
[TABLE]
A similar analysis can be done if (bx1,by1)=(−1,−1).
If at least two of i1,…,ik are same, say i1=i2, then we can find a pair (axk,ayk) such that the action of (a1,…,a2k,(x1,y1)⋯(xk,yk)) on (vi1⊗⋯⊗vik) has the same sign whether (axk,ayk)=(1,1) or (−1,−1). A similar analysis as above shows that corresponding to any element (b1,…,b2k,(x1,y1)⋯(xk,yk))∈C1 such that we can find the element (f1,…,f2k,(x1,y1)⋯(xk,yk))∈C2, such that
[TABLE]
Collecting all the cases, we have
[TABLE]
where π varies over all the permutations of {j1,…,jk}={1,…,2k}∖{i1,…,ik}.
2. (b)
The proof is clear by using part (a) of this theorem, Theorem 6.5(a) and Lemma 7.2.
∎
For l∈21Z>0, define the Jucys-Murphy elements of \mathpzcTl(r,p,n) as follows:
[TABLE]
In addition to these elements, \mathpzcTk(2,2,2k) has one more Jucys-Murphy element which is Mk,2,2.
Theorem 7.6**.**
Let l∈21Z≥0 and let n be a positive integer.
(a)
The elements M21,r,M1,r,…,Ml−21,r,Ml,r commute with each other in \mathpzcTl(r,p,n).
2. (b)
Assume that n≥2l. Let \mathpzcvl∈Ωl(r,p,n) and \mathpzcTl\mathpzcvl be the irreducible \mathpzcTl(r,p,n)-module parametrized by \mathpzcvl. Then there is a unique, up to scalars, basis
[TABLE]
of \mathpzcTl\mathpzcvl such that, for all \mathpzcP=(\mathpzcv0,\mathpzcv21,\mathpzcv1,…,\mathpzcvl), and for all k∈Z≥0, k≤l
[TABLE]
and
[TABLE]
where \mathpzcvk/\mathpzcvk−21 and \mathpzcvk/\mathpzcvk+21 denote the box by which \mathpzcvk differs from \mathpzcvk−21 and \mathpzcvk+21 as r-tuple of Young diagrams respectively.
3. (c)
For (r,p,n)=(2,2,2k), the element Mk,2,2 commutes with the elements M21,2,M1,2,…,M2k−21,2,M2k,2. The scalars by which the Jucys-Murphy elements of \mathpzcTk(2,2,2k) act on the basis (as given by part (b)) of \mathpzcTk(((k),(k)),1) and \mathpzcTk(((k),(k)),−1) are same except for Mk,2,2.
Proof.
(a)
For i,j∈21Z≥0 and i≤j≤l, we have Zi,r,Zj,r∈\mathpzcTj(r,p,n) and Zj,r is a central element of \mathpzcTj(r,p,n)⊆\mathpzcTl(r,p,n), thus Zi,rZj,r=Zj,rZi,r. Since Mj,r=Zj,r−Zj−21,r, thus Jucys-Murphy elements commute with each other in \mathpzcTl(r,p,n).
2. (b)
The branching rule from \mathpzcTj(r,p,n) to \mathpzcTj−21(r,p,n) is multiplicity free for all j∈21Z≥0 and n≥2j. Thus, \mathpzcTl\mathpzcvl has canonical decomposition as irreducible \mathpzcTl−21-module:
[TABLE]
such that there is an edge from \mathpzcvl−21 to \mathpzcvl in \mathpzcT(r,p,n). Further, iterating this decomposition, a canonical decomposition of \mathpzcTl\mathpzcvl into irreducible \mathpzcT0(r,p,n)-modules is obtained:
[TABLE]
where \mathpzcT\mathpzcP are one-dimensional \mathpzcT0(r,p,n)-modules and the sum is over all paths \mathpzcP=(\mathpzcv0,\mathpzcv21,\mathpzcv1,…,\mathpzcvl) such that \mathpzcvj∈Ωj(r,p,n). The basis of \mathpzcTl\mathpzcvl is obtained by choosing a nonzero vector uP in each \mathpzcT\mathpzcP in the decomposition (34). Such a basis is called the Gelfand-Tsetlin basis of the corresponding irreducible representation and it is unique, up to scalars. Using the decomposition (34) and the definition of u\mathpzcP, we get
[TABLE]
for all j∈21Z≥0 and j≤l ,which implies that u\mathpzcP is a basis element of \mathpzcTj\mathpzcvj. Thus, for all j∈21Z≥0 and j≤l, the action of Zj,r on u\mathpzcP is as a scalar given in Theorem 7.4(b).
Now, by the definition of Jucys-Murphy elements, we get their actions on u\mathpzcP.
3. (c)
The element Mk,2,2 is a central element of \mathpzcTk(2,2,2k). For (r,p,n)=(2,2,2k) and λ=((k),(k)), let \mathpzcvk=(λ~,1)∈Ωk(2,2,2k), \mathpzcvk′=(λ~,−1)∈Ωk(2,2,2k). Then
[TABLE]
as \mathpzcTk−21(r,p,n)-modules. Thus, the part of the paths from \mathpzcv0 to \mathpzcvk and \mathpzcvk′ are same for l<k, l∈21Z≥0 and so, we have
[TABLE]
where uP and u\mathpzcP′ are Gelfand-Tsetlin basis elements of \mathpzcTk\mathpzcvk and \mathpzcTk\mathpzcvk′ respectively. However, by Theorem 7.5(b), we get that
[TABLE]
which proves the result. ∎
Acknowledgements
The authors thank Arun Ram for suggesting the problem, for valuable insights and for his online notes [Ram]. The second author gratefully acknowledges the workshop “Representation Theory of Symmetric Groups and Related Algebras” at Institute of Mathematical Sciences, NUS, Singapore, where she had the opportunity to have discussions with Arun Ram.
The first author has been supported by UFPA-CAPES/PNPD fellowship and visiting professorship at UFPA, Brazil. The second author is supported by post-doctoral fellowship NPDF under DST-SERB, India.
Bibliography25
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[BB 07] Eli Bagno and Riccardo Biagioli. Colored-descent representations of complex reflection groups G ( r , p , n ) 𝐺 𝑟 𝑝 𝑛 G(r,p,n) . Israel J. Math. , 160:317–347, 2007.
2[Eny 13] John Enyang. A seminormal form for partition algebras. J. Combin. Theory Ser. A , 120(7):1737–1785, 2013.
3[Gre 07] J. A. Green. Polynomial representations of GL n subscript GL 𝑛 {\rm GL}_{n} , volume 830 of Lecture Notes in Mathematics . Springer, Berlin, augmented edition, 2007. With an appendix on Schensted correspondence and Littelmann paths by K. Erdmann, Green and M. Schocker.
4[HR 98] Tom Halverson and Arun Ram. Murnaghan-Nakayama rules for characters of Iwahori-Hecke algebras of the complex reflection groups G ( r , p , n ) 𝐺 𝑟 𝑝 𝑛 G(r,p,n) . Canad. J. Math. , 50(1):167–192, 1998.
5[HR 05] Tom Halverson and Arun Ram. Partition algebras. European J. Combin. , 26(6):869–921, 2005.
6[Jon 94] V. F. R. Jones. The Potts model and the symmetric group. In Subfactors (Kyuzeso, 1993) , pages 259–267. World Sci. Publ., River Edge, NJ, 1994.
7[Mar 94] Paul Martin. Temperley-Lieb algebras for nonplanar statistical mechanics—the partition algebra construction. J. Knot Theory Ramifications , 3(1):51–82, 1994.
8[Mar 00] P. P. Martin. The partition algebra and the Potts model transfer matrix spectrum in high dimensions. J. Phys. A , 33(19):3669–3695, 2000.