Unipotent Hecke algebras: the structure, representation theory, and combinatorics

Arun Ram
Department of Mathematics and Statistics
University of Melbourne
Parkville, VIC 3010 Australia
aram@unimelb.edu.au

Last updated: 26 March 2015

This is an excerpt of the PhD thesis Unipotent Hecke algebras: the structure, representation theory, and combinatorics by F. Nathaniel Edgar Thiem.

Preliminaries

Hecke algebras

This section gives some of the main representation theoretic results used in this thesis, and defines Hecke algebras. Three roughly equivalent structures are commonly used to describe the representation theory of an algebra A: (1) Modules. Modules are vector spaces on which A acts by linear transformations. (2) Representations. Every choice of basis in an n-dimensional vector space on which A acts gives a representation, or an algebra homomorphism from A to the algebra of n×n matrices. (3) Characters. The trace of a matrix is the sum of its diagonal entries. A character is the composition of the algebra homomorphism of (2) with the trace map. The following discussion will focus on modules and characters.

Modules and characters

Let A be a finite dimensional algebra over the complex numbers ℂ. An A-module V is a finite dimensional vector space over ℂ with a map A×V ⟶ V (a,v) ⟼ av such that (c1)v = cv, c∈ℂ, (ab)v = a(bv), a,b∈A,v∈V, (a+b) (c1v1+c2v2) = c1av1+ c2av2+ c1bv1+ c2bv2, c1,c2∈ℂ. An A-module V is irreducible if it contains no nontrivial, proper subspace V′ such that av′∈V′ for all a∈A and v′∈V′.

An A-module homomorphism θ:V→V′ is a ℂ-linear transformation such that aθ(v)=θ(av), for a∈A,v∈V, and an A-module isomorphism is a bijective A-module homomorphism. Write HomA(V,V′) = {A-module homomorphisms V→V′} EndA(V) = HomA(V,V).

Let Aˆ be an indexing set for the irreducible modules of A (up to isomorphism), and fix a set {Aγ}γ∈Aˆ of isomorphism class representatives. An algebra A is semisimple if every A-module V decomposes V≅⨁γ∈Aˆ mγ(V)Aγ, wheremγ(V)∈ ℤ≥0,mγ (V)Aγ= Aγ⊕⋯⊕Aγ⏟mγ(V) terms. In this thesis, all algebras (though not necessarily all Lie algebras) are semisimple.

(Schur's Lemma). Suppose γ,μ∈Aˆ with corresponding irreducible modules Aγ and Aμ. Then dim(HomA(Aγ,Aμ))= δγμ= { 1, if γ=μ, 0, otherwise.

Suppose A⊆B is a subalgebra of B and let V be an A-module. Then B⊗AV is the vector space over ℂ presented by generators {b⊗v | b∈B,v∈V} with relations ba⊗v = b⊗av, a∈A,b∈B,v∈V, (b1+b2)⊗ (v1+v2) = b1⊗v1+ b1⊗v2+ b2⊗v1+ b2⊗v2, b1,b2∈B, v1,v2∈V. Note that the map B×(B⊗AV) ⟶ B⊗AV (b′,b⊗v) ⟼ (b′b)⊗v makes B⊗AV a B-module. Define induction and restriction (respectively) as the maps IndAB: {A-modules} ⟶ {B-modules} V ⟼ B⊗AV ResAB: {B-modules} ⟶ {A-modules} V ⟼ V

Suppose V is an A-module. Every choice of basis {v1,v2,…,vn} of V gives rise to an algebra homomorphism ρ:A→Mn(ℂ), where Mn(ℂ)= {n×n matrices with entries in ℂ}. The character χV:A→ℂ associated to V is χV(a)= tr(ρ(a)). The character χV is independent of the choice of basis, and if V≅V′ are isomorphic A-modules, then χV=χV′. A character χV is irreducible if V is irreducible. The degree of a character χV is χV(1)=dim(V), and if χ(1)=1, then a character is linear; note that linear characters are both irreducible characters and algebra homomorphisms.

Define R[A]=ℂ-span {χγ | γ∈Aˆ} ,where χγ= χAγ, with a ℂ-bilinear inner product given by ⟨χγ,χμ⟩ =δγμ. (2.1) Note that the semisimplicity of A implies that any character is contained in the subspace ℤ≥0-span {χγ | γ∈Aˆ}. If χV is a character of a subalgebra A of B, then let IndAB(χV)= χB⊗AV and if χV′ is a character of B, then ResAB(χV′) is the restriction of the map χV′ to A.

(Frobenius Reciprocity). Let A be a subalgebra of B. Suppose χ is a character of A and χ′ is a character of B. Then ⟨IndAB(χ),χ′⟩= ⟨χ,ResAB(χ′)⟩.

Weight space decompositions

Suppose A is a commutative algebra. Then dim(Aγ)=1, for all γ∈Aˆ. The corresponding character χγ:A→ℂ is an algebra homomorphism, and we may identify the label γ with the character χγ, so that av=χγ(a)v= γ(a)v,for  a∈A,v∈Aγ.

If A is a commutative subalgebra of B and V is an B-module, then as a A-module V=⨁γ∈Aˆ Vγ,where Vγ ={v∈V | av=γ(a)v,a∈A}. The subspace Vγ is the γ-weight space of V, and if Vγ≠0 then V has a weight γ.

For large subalgebras A, such a decomposition can help construct the module V. For example, 1. If 0≠vγ∈Vγ, then {vγ}Vγ≠0 is a linearly independent set of vectors. In particular, if dim(Vγ)=1 for all Vγ≠0, then {vγ} is a basis for V. 2. If V is irreducible, then BVγ=V. Chapter 6 uses this idea to construct irreducible modules of the Yokonuma algebra.

Characters in a group algebra

Let G be a finite group. The group algebra ℂG is the algebra ℂG=ℂ-span{g∈G} with basis G and multiplication determined by the group multiplication in G. A G-module V is a vector space over ℂ with a map G×V ⟶ V (g,v) ⟼ gv such that (gg′)v=g(g′v), g(cv+c′v′)=cgv+c′gv′, for c,c′∈ℂ,g,g′∈G,v,v′∈V. Note that there is a natural bijection {ℂG-modules} ⟶ {G-modules} V ⟼ V , so I will use G-modules and ℂG-modules interchangeably. Let Gˆ index the irreducible ℂG-modules.

The inner product (2.1) on R[G] has an explicit expression ⟨·,·⟩: R[G]×R[G] ⟶ ℂ (χ,χ′) ⟼ 1∣G∣∑g∈Gχ(g)χ′(g-1), and if U is a subgroup of G, then induction is given by IndUG(χ): G ⟶ ℂ g ⟼ 1∣U∣∑x∈Gxgx-1∈Uχ(xgx-1).

Hecke algebras

An idempotent e∈ℂG is a nonzero element that satisfies e2=e. For γ∈Gˆ, let eγ= χλ(1)∣G∣ ∑g∈Gχγ (g-1)g∈ ℂG. These are the minimal central idempotents of ℂG, and they satisfy 1=∑γ∈Gˆ eγ,eγ2= eγ,eγ eμ=δγμ eγ,ℂGeγ ≅dim(Gγ)Gγ. In particular, as a G-module, ℂG≅⨁γ∈Gˆ ℂGeγ.

Let U be a subgroup of G with an irreducible U-module M. The Hecke algebra ℋ(G,U,M) is the centralizer algebra ℋ(G,U,M)= EndℂG (IndUG(M)). If eM∈ℂU is an idempotent such that M≅ℂUeM, then IndUG(M)= ℂG⊗ℂU ℂUeM=ℂG ⊗ℂUeM ≅ℂGeM and the map θM: eMℂGeM ⟶∼ ℋ(G,U,M) eMgeM ⟼ ϕg where ϕg: ℂGeM ⟶ ℂGeM keM ⟼ keMgeM, (2.2) is an algebra anti-isomorphism (i.e. θM(ab)=θM(b)θM(a)).

The following theorem connects the representation theory of G to the representation theory of ℋ(G,U,M). Theorem 2.3 and the Corollary are in [CRe1981, Theorem 11.25].

(Double Centralizer Theorem). Let V be a G-module and let ℋ=EndℂG(V). Then, as a G-module, V≅⨁γ∈Gˆ dim(ℋγ)Gγ if and only if, as an ℋ-module, V≅⨁γ∈Gˆ dim(Gγ)ℋγ where {ℋγ | γ∈Gˆ,ℋγ≠0} is the set of irreducible ℋ-modules.

Suppose U is a subgroup of G. Let M≅ℂUeM be an irreducible U-module. Write ℋ=ℋ(G,U,M). Then the map {G-submodules of ℂGeM} ⟶ {ℋ-modules} V ⟼ eMV is a bijection that sends Gγ↦ℋγ for every irreducible Gγ that is isomorphic to a submodule of IndUG(M) (Gγ↪IndUG(M)).

Chevalley Groups

There are two common approaches used to define finite Chevalley groups. One strategy considers the subgroup of elements in an algebraic group fixed under a Frobenius map (see [Car1985]). The approach here, however, begins with a pair (𝔤,V) of a Lie algebra 𝔤 and a 𝔤-module V, and constructs the Chevalley group from a variant of the exponential map. This perspective gives an explicit construction of the elements, which will prove useful in the computations that follow (see also [Ste1967]).

Lie algebra set-up

A finite dimensional Lie algebra 𝔤 is a finite dimensional vector space over ℂ with a ℂ-bilinear map [·,·]: 𝔤×𝔤 ⟶ 𝔤 (X,Y) ⟼ [X,Y] such that (a) [X,X]=0, for all X∈𝔤, (b) [X,[Y,Z]]+[Y,[Z,X]]+[Z,[X,Y]]=0, for X,Y,Z∈𝔤. Note that if A is any algebra, then the bracket [a,b]=ab-ba for a,b∈A gives a Lie algebra structure to A.

A 𝔤-module is a vector space V with a map 𝔤×V ⟶ V (X,v) ⟼ Xv such that (aX+bY)v = aXv+bYv, for all a,b∈ℂ, X,Y∈𝔤,v∈V, X(av1+bv2) = aXv1+ bXv2, for all a,b∈ℂ, X∈𝔤,v1,v2∈V, [X,Y]v = X(Yv)- Y(Xv), for all X,Y∈𝔤,v∈V. A Lie algebra 𝔤 acts diagonally on V if there exists a basis {v1,…,vr} of V such that Xvi∈ℂvi, for all X∈𝔤 and  i=1,2,…,r.

The center of 𝔤 is Z(𝔤)= {X∈𝔤 | [X,Y]=0 for all Y∈𝔤}. Let γ∈𝔤ˆ index the irreducible 𝔤-modules 𝔤γ. A Lie algebra 𝔤 is reductive if for every finite-dimensional module V on which Z(𝔤) acts diagonally, V=⨁γ∈𝔤ˆ mγ(V)𝔤γ, where mγ(V)∈ ℤ≥0. If 𝔤 is reductive, then 𝔤=Z(𝔤)⊕𝔤s where 𝔤s=[𝔤,𝔤]  is semisimple.

Let 𝔤 be a reductive Lie algebra. A Cartan subalgebra 𝔥 of 𝔤 is a subalgebra satisfying (a) 𝔥k=[𝔥k-1,𝔥]=0 for some k≥1 (𝔥 is nilpotent), (b) 𝔥={X∈𝔤 | [X,H]∈𝔥,H∈𝔥} (𝔥 is its own normalizer). If 𝔥s is a Cartan subalgebra of 𝔤s, then 𝔥=Z(𝔤)⊕𝔥s is a Cartan subalgebra of 𝔤. Let 𝔥*=Homℂ (𝔥,ℂ)and 𝔥s*= Homℂ(𝔥s,ℂ).

As an 𝔥s-module, 𝔤s decomposes 𝔤s≅𝔥s⊕ ⨁0≠α∈𝔥s* (𝔤s)α,where (𝔤s)α= ⟨X∈𝔤s | [H,X]=α(H)X,H∈𝔥s⟩. The set of roots of 𝔤s is R={α∈𝔥* | α≠0,(𝔤s)α≠0}. A set of simple roots is a subset {α1,α2,…,αℓ}⊆R of the roots such that (a) ℚ⊗ℂ𝔥s*=ℚ-span{α1,α2,…,αℓ} with {α1,…,αℓ} linearly independent, (b) Every root β∈R can be written as β=c1α1+c2α2+⋯+cℓαℓ with either {c1,…,cℓ}⊆ℤ≥0 or {c1,…,cℓ}⊆ℤ≤0. Every choice of simple roots splits the set of roots R into positive roots R+= {β∈R | β=c1α1+c2α2+⋯+cℓαℓ,ci∈ℤ≥0} and negative roots R-= {β∈R | β=c1α1+c2α2+⋯+cℓαℓ,ci∈ℤ≤0} . In fact, R-=-R+.

Example. Consider the Lie algebra 𝔤𝔩2=𝔤𝔩2(ℂ)={2×2 matrices with entries in ℂ}, and bracket [·,·] given by [X,Y]=XY-YX. Write 𝔤𝔩2=Z(𝔤𝔩2) ⊕𝔰𝔩2, where Z(𝔤𝔩2)={(c00c) | c∈ℂ} and 𝔰𝔩2={X∈𝔤𝔩2 | tr(X)=0}. Also, 𝔰𝔩2= {(a00-a) | a∈ℂ}⊕ {(00c0) | c∈ℂ}⊕ {(0c00) | c∈ℂ}. Let α∈𝔥*={(a00b) | a,b∈ℂ}* be the simple root given by α(a00b)=a-b, so that R+={α} and R-={-α}.

From a Chevalley basis of 𝔤s to a Chevalley group

For every pair of roots α,-α, there exists a Lie algebra isomorphism ϕa:𝔰𝔩2→⟨𝔤α,𝔤-α⟩. Under this isomorphism, let Xα=ϕa (0100) ∈(𝔤s)α, Hα=ϕα (100-1) ∈𝔥s, X-α=ϕα (0010) ∈(𝔤s)-α. Note that [Xα,X-α]=Hα. The following classical result can be found in [Hum1972, Theorem 25.2].

(Chevalley Basis). There is a choice of the ϕα such that the set {Xα,Hαi | α∈R,1≤i≤ℓ} is a basis of 𝔤s satisfying (a) Hα is a ℤ-linear combination of Hα1,Hα2,…,Hαℓ. (b) Let α,β∈R such that β≠±α, and suppose l,r∈ℤ≥0 are maximal such {β-lα,…,β-α,β,β+α,…,β+rα} ⊆R. Then [Xα,Xβ]= { ±(l+1) Xα+β, if r≥1, 0 otherwise.

A basis as in Theorem 2.5 is a Chevalley basis of 𝔤s (For an analysis of the choices involved see [Sam1969] and [Tit1966]).

Let V be a finite dimensional 𝔤-module such that V has a ℂ-basis {v1,v2,…,vr} that satisfies (a) There exists a ℂ-basis {H1,…,Hn} of 𝔥 such that (1) Hαi∈ℤ≥0-span{H1,…,Hn}, (2) Hivj∈ℤvj for all i=1,2,…,n and j=1,2,…,r. (3) dimℤ(ℤ-span{H1,H2,…,Hn})≤dimℂ(𝔥). (b) Xαnn!vi∈ℤ-span{v1,v2,…,vr} for α∈R, n∈ℤ≥0 and i=1,2,…,r. (c) dimℤ(ℤ-span{v1,v2,…,vr})≤dimℂ(V). (Condition (a) guarantees that Z(𝔤) acts diagonally. If Z(𝔤)=0, then the existence of such a basis is guaranteed by a theorem of Kostant [Hum1972, Theorem 27.1]).

Let V be a finite dimensional 𝔤-module that satisfies (a)-(c) above. For H∈𝔥, let (Hn)= (H-1)(H-2)⋯(H-(n+1))n! ∈End(V). As a transformation of the basis v1,v2,…,vr, the element Hi=diag(h1,h2,…,hr)∈End(V) with hj∈ℤ. Let y∈ℂ*. Temporarily abandon precision (i.e. allow infinite sums) to obtain ∑n≥0 (y-1)n (Hin) = diag ( ∑n≥0(y-1)n (h1n), ∑n≥0(y-1)n (h2n),…, ∑n≥0(y-1)n (hrn), ) = diag(yh1,yh2,…,yhr) ∈End(V)(by the binomial theorem). This computation motivates some of the definitions below.

Let 𝔥ℤ=ℤ-span {H1,H2,…,Hn}. (2.3) The finite field 𝔽q with q elements has a multiplicative group 𝔽q* and an additive group 𝔽q+. Let Vq=𝔽q-span {v1,v2,…,vr}. (2.4)

The finite reductive Chevalley group GV⊆GL(Vq) is GV= ⟨ xα(a),hH(b)  | α∈R,H∈𝔥ℤ,α ∈𝔽q,b∈𝔽q* ⟩ , where xα(a) = ∑n≥0 anXαnn!, and (2.5) hH(b) = diag(bλ1(H),bλ2(H),…,bλr(H)), where Hvi=λi(H)vi. (2.6)

Remarks. 1. If we “allow” infinite sums, then hHi(b)= ∑n≥0 (b-1)n (Hin). 2. If 𝔤=𝔤s, then GV=⟨xα(t)⟩.

Example. Suppose (as before) 𝔤=𝔤𝔩2 and let V=ℂ-span {(10),(01)} be the natural 𝔤-module given by matrix multiplication. Then 𝔥 has a basis 𝔥={(a00b) | a,b∈ℂ}= ℂ-span{(1000),(0001)}. By direct computation, xα(t)= (1t01) andh(a00b) (t)=(ta00tb) for a,b∈ℤ, and GV=GL2(𝔽q) (the general linear group).

Some combinatorics of the symmetric group

This section describes some of the pertinent combinatorial objects and techniques.

A pictorial version of the symmetric group Sn

Let si∈Sn be the simple reflection that switches i and i+1, and fixes everything else. The group Sn can be presented by generators s1,s2,…,sn-1 and relations si2=1, sisi+1si= si+1sisi+1, sisj=sjsi, for ∣i-j∣>1. Using two rows of n vertices and strands between the top and bottom vertices, we may pictorially describe permutations in the following way. View sias
⋯ ⋯ i
.
Multiplication in Sn corresponds to concatenation of diagrams, so for example,
s1 s2
=
=
=s2s1.
Therefore, Sn is generated by s1,s2,…,sn-1 with relations
=
,
=
,
=
.

Compositions, partitions, and tableaux

A composition μ=(μ1,μ2,…,μr) is a sequence of positive integers. The size of μ is ∣μ∣=μ1+μ2+⋯+μr, the length of μ is ℓ(μ)=r and μ≤= {μ≤1,μ≤2,…,μ≤r} ,where μ≤i= μ1+μ2+⋯+μi. (2.7) If ∣μ∣=n, then μ is a composition of n and we write μ⊨n. View μ as a collection of boxes aligned to the left. If a box x is in the ith row and jth column of μ, then the content of x is c(x)=i-j. For example, if μ=(2,5,3,4)=
,
then ∣μ∣=14, ℓ(μ)=4, μ≤=(2,7,10,14), and the contents of the boxes are
0 1 -1 0 1 2 3 -2 -1 0 -3 -2 -1 0
.
Alternatively, μ≤ coincides with the numbers in the boxes at the end of the rows in the diagram
1 2 3 4 5 6 7 8 9 10 11 12 13 14
.

A partition ν=(ν1,ν2,…,νr) is a composition where ν1≥ν2≥⋯≥νr>0. If ∣ν∣=n, then ν is a partition of n and we write ν⊢n. Let 𝒫={partitions} and𝒫n= {ν⊢n}. (2.8) Suppose ν∈𝒫. The conjugate partition ν′=(ν1′,ν2′,…,νℓ′) is given by νi′=Card {j | νj≥i}. In terms of diagrams, ν′ is the collection of boxes obtained by flipping ν across its main diagonal. For example, ifν=
,thenν′=
.

Suppose ν,μ are partitions. If νi≥μi for all 1≤i≤ℓ(μ), then the skew partition ν/μ is the collection of boxes obtained by removing the boxes in μ from the upper left-hand corner of the diagram λ. For example, if ν=
andμ=
,thenν/μ=
.
A horizontal strip ν/μ is a skew shape such that no column contains more than one box. Note that if μ=∅, then ν/μ is a partition.

A column strict tableau Q of shape ν/μ is a filling of the boxes of ν/μ by positive integers such that (a) the entries strictly increase along columns, (b) the entries weakly increase along rows. The weight of Q is the composition wt(Q)=(wt(Q)1,wt(Q)2,…) given by wt(Q)i=number of i  in Q. For example, Q=
1 1 3 1 2 3 3 5
haswt(Q)= (3,1,3,0,1).

Symmetric functions

The symmetric group Sn acts on the set of variables {x1,x2,…,xn} by permuting the indices. The ring of symmetric polynomials in the variables {x1,x2,…,xn} is Λn(x)= {f∈ℤ[x1,x2,…,xn] | w(f)=f,w∈Sn}. For r∈ℤ≥0, the rth elementary symmetric polynomial is er(x:n)= ∑1≤i1<i2<⋯<ir≤n xi1xi2⋯xir, where by convention er(x:n) =0, if r>n, and the rth power sum symmetric polynomial is pr(x:n)= x1r+x2r+ ⋯+xnr. For any partition ν∈𝒫, let ev(x:n) = eν1(x:n) eν2(x:n)⋯ eνℓ(x:n) pv(x:n) = pν1(x:n) pν2(x:n)⋯ pνℓ(x:n). The Schur polynomial corresponding to ν is sν(x:n)= det(eνi′-i+j(x:n)), (2.9) for which Pieri’s rule gives sν(x:n) s(n)(x:n)= ∑horizontal strip γ/ν∣γ/ν∣=n sγ(x:n) [Mac1995, I.5.16]. (2.10)

For each t∈ℂ, the Hall-Littlewood symmetric function is Pν(x:n;t) = ∑wν∈Snνw ( x1ν1 x2ν2⋯ xnνn ∏νi>νj xi-txjxi-xj ) = 1vν(t) ∑w∈Snw ( x1ν1 x2ν2⋯ xnνn ∏i<j xi-txjxi-xj ) , where vν(t)∈ℂ is a constant as in [Mac1995, III.2]; and they satisfy Pν(x:n;0)= sν(x:n), P(1n) (x:n;t)= en(x:n). For t∈ℂ, Λn(x)=ℤ-span {eν(x:n)}= ℤ-span{sν(x:n)} =ℤ-span{Pν(x:n;t)}, (2.11) and if we extend coefficients to ℚ, then ℚ⊗Λn(x)= ℚ-span{pν(x:n)}.

Note that for n>m there is a map Λn(x) ⟶ Λm(x) f(x1,x2,…,xn) ⟼ f(x1,…,xm,0,…,0) which sends sν(x:n)↦sν(x:m), eν(x:n)↦eν(x:m), etc. Let {x1,x2,…} be an infinite set of variables. The Schur function sν(x) is the infinite sequence sν(x)= ( sν(x:1), sν(x:2), sν(x:3),… ) , and one can define elementary symmetric functions er(x), power sum symmetric functions pr(x), and Hall-Littlewood symmetric functions Pν(x;t), analogously. The ring of symmetric functions in the variables {x1,x2,…} is Λ(x)=ℤ-span {sν(x) | ν∈𝒫}, and let Λℂ(x)=ℂ -span{sν(x) | ν∈𝒫}.

RSK correspondence

The classical RSK correspondence provides a combinatorial proof of the identity ∏i,j>0 11-xiyj =∑ν⊢nn≥0 sν(x)sν(y) [Knu1970] by constructing for each ℓ≥0 a bijection between the matrices b∈Mℓ(ℤ≥0) and the set of pairs (P(b),Q(b)) of column strict tableaux with the same shape. The bijection is as follows.

If P is a column strict tableau and j∈ℤ>0, let P←j be the column strict tableau given by the following algorithm (a) Insert j into the the first column of P by displacing the smallest number ≥j. If all numbers are <j, then place j at the bottom of the first column. (b) Iterate this insertion by inserting the displaced entry into the next column. (c) Stop when the insertion does not displace an entry.

A two-line array (i1i2⋯inj1j2⋯jn) is a two-rowed array with i1≤i2≤⋯≤in and jk≥jk+1 if ik=ik+1. If b∈Mℓ(ℤ≥0), then let b→ be the two-line array with bij pairs (ij).

For b∈Mℓ(ℤ≥0), suppose b→= (i1i2⋯inj1j2⋯jn). Then the pair (P(b),Q(b)) is the final pair in the sequence (∅,∅)= (P0,Q0), (P1,Q1), (P2,Q2),…, (Pn,Qn),= (P(b),Q(b)), where (Pk,Qk) is a pair of column strict tableaux with the same shape given by Pk=Pk-1←jk and Qk is defined by sh(Qk)=sh(Pk) with ik in the new box sh(Qk)/sh(Qk-1). For example, b=(110002010) corresponds tob→= (1122321332) and provides the sequence (∅,∅), (
2
,
1
)
, (
1 2
,
1 1
)
, (
1 2 3
,
1 1 2
)
, (
1 2 3 3
,
1 1 2 2
)
, (
1 2 3 2 3
,
1 1 3 2 2
)
so that (P(b),Q(b))= (
1 2 3 2 3
,
1 1 3 2 2
)
.

Notes and References

This is an excerpt of the PhD thesis Unipotent Hecke algebras: the structure, representation theory, and combinatorics by F. Nathaniel Edgar Thiem.

page history