Combinatorics of Iwahori Whittaker Functions
Abstract.
We give a combinatorial evaluation of Iwahori Whittaker functions for unramified genuine principal series representations on metaplectic covers of the general linear group over a non-archimedean local field. To describe the combinatorics, we introduce new combinatorial data that we call colored data: colored Lusztig data, colored Gelfand-Tsetlin patterns, and colored lattice models. We show that all three are equivalent. To achieve the result, we give an explicit Iwahori decomposition for the maximal unipotent subgroup of a split reductive group which gives the parametrization of the generalized Mirković-Vilonen cycles in the affine flag varieties and is of interest in itself.
Our result is based and naturally extends Peter McNamara’s evaluation of the metaplectic spherical Whittaker function in terms of Lusztig data.
Key words and phrases:
Whittaker functions, Iwahori decomposition, colored lattice models, Lusztig data2020 Mathematics Subject Classification:
Primary: 22E50; Secondary: 82B23, 05E05, 11F701. Introduction
Consider a split reductive group over a non-archimedean local field. The principal series representation is a representation parabolically induced from a character of the maximal torus. We consider Whittaker functions on the group which are certain matrix coefficients on the principal series representation corresponding to Whittaker functionals and spherical/Iwahori vectors. See Appendix A for details.
The non-achimedean Whittaker functions were introduced by Jacquet in [Jac67] and were given in the form of a -adic Jacquet integral over the maximal unipotent subgroup. There is a rich theory of combinatorial evaluation of the non-achimedean Whittaker functions explored in [McN11, BBF11b, BBBG19, BBBG20] and related special functions in [Tok88, Oka90, HK07] and others.
The spherical Whittaker function is the first and simplest example. It was computed explicitly by T. Shintani in [Shi76] for Lie groups of type A. Later Casselman and Shalika in [CS80] gave a formula for all Lie types as a product of the deformed Weyl denominator times the character of the dual Langlands group.
The spherical Whittaker functions of the metaplectic -covers for Lie groups of type A is the next example. In [McN11], McNamara gave the expression of in terms of Lusztig data and showed that this data is equivalent to Mirković-Vilonen cycles of the affine grassmanian. In [BBF11b], Brubaker, Bump, and Friedberg also expressed (as the Whittaker coefficient of Borel Eisenstein series) in terms of crystal graphs (and in terms of strict Gelfand-Tsetlin patterns).
The Iwahori Whittaker functions in type A are refinements of the spherical Whittaker functions that comes from the Iwahori decomposition instead of the Iwasawa decomposition. In [BBBG19], a recursive evaluation of the functions was given using the intertwining operators. By connecting the intertwiners with Yang-Baxter equations, functions were expressed in terms of colored lattice models. Moreover, In [BBBG20], the calculation was extended for metaplectic -covers of Lie groups of type A in terms of supersymmetric lattice models using similar methods. At the present, it is the most general result which specializes to all functions mentioned above.
Thanks to the Casselman-Shalika formula (the CS-formula) for the spherical Whittaker function , one can study the combinatorics by analyzing the explicit expression given in terms of the special functions. In this approach, one does not need any representation theory to obtain the combinatorial results. These special functions occur independently in the literature with no relation to the Whittaker functions.
Tokuyama in [Tok88] found an exact expression for the generating function of strict Gelfand-Tsetlin patterns which incidentally matched the CS-formula. In [Oka90], the CS-formula was expressed in terms of partially strict shifted plane partitions. In [HK07], it was computed combinatorically by applying jeu de taquin to the primed tableaux. In [BBF11a], Brubaker, Bump, and Friedberg evaluated the CS-formula as the partition function of a free-fermionic solvable lattice model which gave a new combinatorial interpretation using Yang-Baxter equation, a tool from statistical mechanics. A posteriori, all these methods give a combinatorial evaluation of the spherical Whittaker function .
Some progress was made for other types other Lie types as well. In [HK02], a variation of the CS-formula was given combinatorically by Hamel and King. Moreover, they introduced lattice models with U-turns. In [Iva12], Ivanov used lattice models with U-turns and introduced Yang-Baxter equation that allowed to get the CS-formula for the symplectic group as the partition function of his model. Later, in [Gra17] Gray extended lattice models with U-turns and conjectured that the partition function is the spherical Whittaker function for the metaplectic covers of the symplectic group. In [FZ16], a partial evaluation of the CS-formula for type B was found by Friedberg and Zhang. Also, in [DeF21] DeFranco gave the CS-formula for type by brute force. A non-finite variant of such computations was given for the metaplectic cover of by Leslie in [Les19].
Spherical vector | Iwahori vector | |
---|---|---|
Type A | [Tok88], [Oka90], [HK07], [BBF11a] | [BBBG19], this paper |
Metaplectic type A | [BBF11b], [McN11] | [BBBG20], this paper |
Type C | [HK02] (partial), [Iva12] | – |
Metaplectic type C | [Gra17] (partial) | – |
Type B | [FZ16] (partial) | – |
Type G2 | [DeF21] | – |
Other types | – | – |
The main goal of this paper is to extend McNamara’s approach from the spherical Whittaker function to the Iwahori Whittaker functions. An advantage of McNamara’s approach is the description of the spherical Whittaker function as a sum over combinatorial data. Each term in the sum corresponds to a Mirković-Vilonen cycle. The combinatorial sum is obtained directly, without using intertwining operators, recursive relations, explicit expressions, or multiple Dirichlet series. This geometric approach has the following steps.
-
(1)
Write explicit Iwasawa decomposition for the maximal unipotent subgroup that corresponds to Mirković-Vilonen cycles in the affine grassmanian. It gives the decomposition into cells;
-
(2)
The spherical Whittaker function is defined by a -adic integral over . The explicit decomposition for gives a combinatorial sum ;
-
(3)
Evaluate each individual integral explicitly in appropriate coordinates to obtain combinatorial weights for each term;
-
(4)
Describe the decomposition and weights combinatorically, for example, in terms of Gelfand-Tsetlin patterns.
In Section 4 of [McN11], McNamara found an explicit Iwasawa decomposition for the maximal unipotent subgroup into disjoint cells . In Section 2, we extend his decomposition and produce explicit Iwahori decomposition for into cells that are the refinement of McNamara’s decomposition.
In Section 8 of [McN11], McNamara computes the values of the spherical Whittaker functions using the explicit decomposition. In Section 4 we extend the calculation to the case of the Iwahori Whittaker functions using cells .
There Iwahori case has several difficulties compared to the spherical case from McNamara’s work. First, the space of Iwahori Whittaker functions is not one dimensional which results in computing each Iwahori basis element separately. Second, the Iwahori Whittaker functions are defined by the affine Weyl group, not just by the diagonal which results in two parameters for the group element to consider. Third, we introduce new combinatorial data that we call colored data. We give equivalent definitions of colored Lusztig data, colored Gelfand-Tsetlin patterns, and colored lattice models.
The lattice model we introduce is dual to the one from [BBBG19, BBBG20]. This gives a geometric meaning to the admissible states of the lattice model as they are in bijection with the cells and the weights are the -adic integrals over the corresponding cells. We remark that we don’t use the intertwining operators or Yang-Baxter equation in our approach. Instead, we give the combinatorial evaluation directly from the definition of the Iwahori Whittaker functions by the Jacquet integral.
Let us be more precise now.
Let be a split reductive group over a non-achimedean local field and let be an -fold metaplectic cover of . Let be a fixed split maximal torus of , the Borel subgroup, be the maximal unipotent subgroup and its opposite, the opposite Iwahori subgroup, and the Weyl group. See Section A.1 for details. In Section 2, we give the explicit Iwahori decomposition for that depends on a long word decomposition i:
Theorem (Theorem 2.3).
Let and . Then there is an explicit Iwahori decomposition with , , , given by Proposition 2.2.
We use this explicit decomposition to write as a union of cells which are related to the generalized Mirković-Vilonen cycles in the affine flag varieties. In this paper, it will be important that we can describe each cell in appropriate coordinates to compute integrals explicitly.
Theorem (Theorem 2.9).
Similar to Section 7 of [McN11], we can show that cells are in bijection with the generalized Mirković-Vilonen cycles in the affine flag variety which gives a parametrization of the generalized Mirković-Vilonen cycles. Alternative parametrization in terms of refined alcove paths was explored in [PRS09] by Parkinson, Ram, and Schwer.
Remark 1.1.
We remark that our parametrization of the generalized Mirković-Vilonen cycles resembles the Lusztig graph which has the natural crystal structure. It is interesting to find the “colored crystal structure” on the generalized Mirković-Vilonen cycles in the affine flag variety.
Let now specialize to . In Section A.4 we define Iwahori Whittaker functions parametrized by Weyl group elements . In short, these are the matrix coefficients on the unramified genuine principal series representation of corresponding to the averaged Whittaker functional and an Iwahori fixed vector. In Section 4, we evaluate all values of in terms of colored Lusztig data, combinatorial objects we introduce in Section 3.
Theorem (Theorem 4.6).
Compare it with Theorem 8.6 from [McN11]:
Theorem (Theorem 8.6, [McN11]).
Let with . Then the integrals defined in the paper that determines values of the spherical Whittaker function is given by
where contributions are given explicitly by (8.2) in [McN11].
As usual, one can use the combinatorial formulas to get the branching rules, specializations, and asymptotics for the Iwahori Whittaker functions. We do not do it here.
Remark 1.2.
Note that . Therefore, Theorem 4.6 is a refinement of McNamara’s calculation. We remark that in the summation, non-trivial cancellations between Iwahori Whittaker functions happen which are “invisible” in the spherical case. See Section 5 for examples.
In Section 3, we define colored Lusztig data, colored Gelfand-Tsetlin patterns, and supersymmetric lattice models. We show that all of them are equivalent. Thus, Theorem 4.6 can be written over any of these equivalent data. In examples in Section 5 we primarily use colored GT-patterns.
Theorem 1.3 (Theorem 3.1).
There are weight-preserving bijections between
-
•
colored Lusztig data ,
-
•
colored Gelfand-Tsetlin patterns ,
-
•
colored states .
This result connects our approach to colored lattice models and supersymmetric lattice models dual to ones introduced in [BBBG19] and [BBBG20]. We note that the alternative choice of the long word decomposition yields the exact lattice models. By combining two models, one can obtain the standard results like the Cauchy identities and duality for the supersymmetric ice.
Remark 1.4.
Note that the Boltzmann weights for the lattice models are given by -adic integrals over the corresponding cells. A posteriori, the lattice model is integrable and satisfies the Yang-Baxter equation. In other words, this approach allows one to come up with solvable lattice models and Boltzmann weights without “guessing” the weights.
We finally remark that our approach can be adapted in other settings. Instead of the general linear group, one can choose any other split reductive group and its covers. Instead of the delta word decomposition, one can pick the gamma word decomposition to obtain combinatorics matching colored lattice models from [BBBG19, BBBG20]. The main difficulty lies in the explicit expression of the character in coordinates which is the reason why we need to pick a “good” word decomposition.
We use notation .
Acknowledgements. We thank Dan Bump for being a great advisor and his support throughout the project. We thank Alexei Borodin and Ben Brubaker for their helpful comments on the presentation of the paper. We thank Claire Frechette for the discussion about the general metaplectic covers. Thank you!
2. Explicit Iwahori Decomposition
In Section 4 of [McN11], McNamara gives an explicit Iwasawa decomposition for the opposite maximal unipotent subgroup of a metaplectic cover of a split reductive group. We extend his results to get an explicit Iwahori decomposition. We loosely follow the exposition of Section 4 of [McN11].
Let be a split reductive group over a non-archumedian local field . Let be an -fold metaplectic cover of . We use notation from Section A.1, A.4: ring of integers , maximal ideal , torus , Borel subgroup , maximal unipotent subgroup and its opposite , and the opposite Iwahori subgroup . And from Section A.5: positive roots , coroots , the Weyl group , simple reflections , and generators and .
Let be a -tuple of indices such that is a reduced decomposition of the long word . The choice of i defines a total ordering on the set of positive roots given by
where . The proof can be found in any Lie theory text, for example [Bou68][Ch VI, §6].
For each , let denote the set of elements which can be expressed in the form
Note that . It slightly differs from from Section 4 of [McN11] as we don’t include the torus element in our definition.
Lemma 2.1 (Lemma 4.3 from [McN11]).
For all and , there exists a unique such that
Proof.
In the proof of Lemma 4.3 from [McN11] the argument changes only when crossing a torus element which we don’t have in our definition of . ∎
Before we give an explicit Iwahori decomposition, we need a technical result which is an extension of Algorithm 4.4 of [McN11] to the Iwahori subgroup.
Proposition 2.2.
Let and . Write as for unique . Then there exist coordinates , shifts , and elements with , , , and , such that for each we have
and explicit expressions
Proof.
By decreasing induction on . For , we have , , , , and . Next, suppose
We take the last term in the product and commute it with elements on the right. We write for some . By Lemma 2.1,
for some new . Next, commute with to get . To commute with , we consider the following cases.
- If or if ( and ):
-
We apply the identity
to and get
Let , then we define
- If or if ( and ):
-
Then .
Then we define
In any case, the induction step is successful, and we are done. ∎
Theorem 2.3 (Explicit Iwahori Decomposition).
Let and . Then there is an explicit Iwahori decomposition with , , , given by Proposition 2.2.
Proof.
Set in Proposition 2.2 and notice that . ∎
We can also reformulate the result in terms of simple reflections. We favor this reformulation because it is easier to give a combinatorial description in terms of simple reflections.
Lemma 2.4.
Define
Then , in particular, . Then we can rewrite expressions for from the theorem in terms of simple reflections.
Proof.
Recall that , and so
Note that .
We prove by decreasing induction on . For we have . Next, if , we consider two cases.
If or if ( and ), we get
If or if ( and ), we get
We also note that
Now all the data can be written in terms of the simple reflections. ∎
Now we extract the combinatorial essence from the results above. We want to describe all possible sequences of that can occur in the explicit Iwahori decomposition. We drop variables and keep only their valuations , in other words, if , we take the valuation of its inverse, and if , we set to be zero.
Definition 2.5.
Let and let . An coloring is a sequence with , , and
(2.1) |
Denote by the set of -colorings.
We call the input, and the output of the coloring.
Informally, start with and then read from right to left. At each entry, update the current element. If , skip it. If , multiply by if applying the inverse of the current element to lies in . Otherwise, either multiply or skip it. Then is the set of such sequences that end with . Note that may be empty.
Remark 2.6.
Note that the coloring depends on the vanishing of entries of , that is, whether an entry is zero or not, but not on the non-zero values of ’s.
Example 2.7.
Let and let . Then the positive roots are
Let be the input. Here are examples of different -colorings.
- :
-
has output
- :
-
has output
- :
-
has output and has output
- :
-
has output
- :
-
has output
- :
-
has output
- :
-
has output
- :
-
has output .
Definition 2.8.
Theorem 2.9.
The following decomposition holds.
Proof.
We first show that . Let . By definition in local coordinates of Theorem 2.3, we have , hence, .
Now we show that lies in for some and coloring . Let . We use the coordinates from Theorem 2.3 to get explicit Iwahori decomposition to define and .
We set . Next, we set to be the sigmas introduced in Lemma 2.4. Note that and from and by Iwahori decomposition, we conclude that . Next, is indeed a -coloring: if , then , and so and . If and , then and . If and , then we either have in case , or in case . Therefore, is a -coloring, and we are done. ∎
Remark 2.10.
Write , for and , for . From the proof of Theorem 2.9, we find a cell is a set of elements in with , where the domains are defined by
Now we give the relation to the cells introduced by McNamara in [McN11].
Theorem 2.11 ([McN11], Section 4).
We have the following relation of our cells with McNamara’s cells.
Proposition 2.12.
McNamara cells decomposes into cells as follows:
Remark 2.13.
This connection of cells explains the splitting phenomena observed in the colored lattice models. Since the integral over a cell equals to the sum of integrals over correspodning , we get a transition from colored models to uncolored models.
3. Colored data
In the case of the general linear group and a good choice of a long word decomposition, it is possible to write down colorings from Section 2 combinatorically which will be useful when computing Iwahori Whittaker functions in Section 4. In that section we will need weights and contributions of the colored data. For coherency, we define them in this section next to the corresponding data. The statistics and and the Gauss sums are defined in Section 4.
Let . Realize the root system as and the positive roots as . Denote the order of by . We identify weights and use the standard elementary basis , so that simple roots . The fundamental weights are defined by
We write a weight uniquely as with .
Let be the delta word, where
The choice of the delta word induces a total ordering on the positive roots given by if or if and . I.e.,
We choose the delta word because it allows us to use the induction argument. To emphasize it, we write data labeled by positive roots in the form of a table, reading the data from the end and writing in the table from right to left, from top to bottom. For example,
We identify . For the delta word, we interpret colorings in terms of actions on the set ; in this context we refer to numbers as colors.
The results of the section are summarized in the following
Theorem 3.1 (Equivalence of Colored Data).
There are weight-preserving bijections between
-
•
colored Lusztig data ,
-
•
colored Gelfand-Tsetlin patterns ,
-
•
colored states .
3.1. Colored Lusztig data
Let us rewrite Definition 2.5 for -colorings in terms of permutations . Note that if and only if .
Let and let be two permutations. An -coloring is a sequence with and . For the uniform notation, we denote for and . Then eq. 2.1 becomes
(3.1) |
From now on, we consider only the colorings for the delta word for the general linear group. We call the input and the output of a coloring . With the new notation, we give a characterization of the colorings in the following
Lemma 3.2.
An -coloring is uniquely determined by with and . We organize this data in table with rows:
(3.2) |
Note that the zeroth row defines the input .
Proof.
Write and the corresponding simple reflections in the form
The evaluation of goes from the top row of down to bottom, reading each row from right to left. At each entry we either multiply by the corresponding or skip it according to the colorings rules eq. 3.1. Note that after the -th row the future permutations do not affect colors in positions since there are no reflections in the sequel. Hence, by induction it is enough to prove that permutations for of the first row are determined by alone. Indeed, by the colorings rules in eq. 3.1,
But there is a unique way to write as a product of increasing simple reflections. Hence, determines all ’s which in order determine all ’s. Finally, is determined by its action on colors which is the first row of (after the zeroth one). ∎
Example 3.3.
Let . Let the input be . Let us use Lemma 3.2 to write all possible colorings:
- output :
-
, or ;
- output :
-
, or .
We cannot resist the temptation to merge with the coloring provided by Lemma 3.2. For convenience, we add the zeroth row to filled with dashes. We overlay and . If has color , we write . The example above becomes
Let and be a weight. We write as the sum of fundamental weights, so . We define statistics by
Definition 3.4.
Let be a weight. The finite set of such that for all is called the Lusztig data corresponding to and denoted by .
Lusztig data is used to parametrize the Kashiwara crystal for which explains the shift by in the notation. We exclusively use colorings for the Lusztig data. So we specialize from arbitrary strings to the set of Lusztig data.
A colored Lusztig data corresponding to with input and output is the pair of a Lusztig datum and a -coloring that we visualize as a table of entries of colored by using Lemma 3.2 as discussed above. The set of all colored Lusztig data with input and output is denoted by .
This definition is not exactly useful since for a given Lusztig datum we need to find a coloring , make a coloring by Lemma 3.2, and only then merge the pattern with the coloring to get a colored Lusztig datum. Now we give a purely combinatorial definition of the colored Lusztig data that doesn’t involve -colorings at all.
Definition 3.5.
Let be a weight and be two permutations. A coloring of a Lusztig data with input and output is an assignment of colors to each entry of according to the following procedure.
Procedure 3.6.
Write in the form
The zero-th row of dashes is given colors by the input permutation , that is, the zero-th row has colors . Starting from the next row, we color entries from top to bottom, from right to left, using the following rules at each step.
You have a buffer color . Every time you start a new row, you update to be the color to the top right most entry of the previous row. While in a row, will be updated as the procedure goes. At each step you have a triangle of values and colors
- If :
-
Paint to the color and update .
- If and :
-
Paint to the color and don’t update
- If and :
-
You can do one of the following
-
(1):
Paint to the color and update
-
(2):
Paint to the color and don’t update
-
(1):
Consider colors that are present in -th row, but not in -th row. Informally, they ”leave“ the table. They form a permutation which should be the output .
Note that the colorings from the definition above give all possible colorings by Lemma 3.2. Therefore, we give
Definition 3.7.
Let be a weight and be two permutations. The set of colored Lusztig data is the set of all possible pairs of Lusztig data and colorings given by Definition 3.5 with input and output .
Remark 3.8.
The coloring procedure itself is not an algorithm as it requires a choice in the case and . But it is the basis of an algorithm enumerating all colored Lusztig data as the leaves of a binary tree of all possible colorings.
Example 3.9.
Let and let
Here is the application of the coloring procedure to produce a coloring with input and output .
At the beginning, the buffer color .
-
Step 1:
and . Paint to the color (blue)
-
Step 2:
and . Paint to the color (green)
-
Step 3:
. Paint to the color and set (red)
-
New row:
Set (blue)
-
Step 4:
. Paint to the color (blue)
-
Step 5:
and . We have a choice. We choose to paint to the color . We do not update color .
-
New row:
Set (blue)
-
Step 6:
and . We have a choice. We choose to paint to the color (blue)
All possible colorings with the input are listed below.
Let be a colored Lusztig datum. A weight is defined by
Let
be a block of values and colors in the datum m, where is the position of . If is the right-most entry in , for convenience, we assume . Then the contribution at is defined by
(3.3) |
|
Note that the weight of a colored Lusztig datum is zero if there is any root with , and when or ( and ). It motivates the following
Definition 3.10.
A colored Lusztig datum is called strict if there are no blocks of values and colors
with , , and when or ( and ). Denote the set of strict colored Lusztig data by .
In the -metaplectic case, if . Analyzing the weight above, we see that it is zero if , , when or ( and ); or if when and . It motivates the following
Definition 3.11.
A colored Lusztig datum is called (-)superstrict if is strict and for all if when or ( and ); or if and . Denote the set of strict colored Lusztig data by .
Prefix “super” comes from the supersymmetric lattice models that we will introduce later.
3.2. Colored Gelfand-Tsetlin Patterns
We show that the colored Lusztig data is is in a weight-preserving bijection with the colored Gelfand-Tsetlin patterns which we define momentarily.
A Gelfand-Tsetlin pattern (or GT-pattern for short) with the top row is a triangular array of integers
such that the betweenness condition is satisfied for all . In other words, each entry in the pattern lies between two entries above it. Denote by the set of GT-patterns with the top row .
Let be a dominant weight, that is, a partition. For our convenience, we parametrize by solutions of the following inequalities: for each , , and
where we denote for each . This is how it looks:
A weight of a GT-pattern is defined by
Let be the sum of entries in -th row of a GT-pattern , and . Then the weight is also given by
Indeed, we get the power of in as follows:
Hence, , as required.
We now show that GT-patterns with the top row are in weight-preserving bijection with Lusztig data corresponding to .
Lemma 3.12.
There is a weight-preserving bijection between GT-patterns with the top row and colored Lusztig data corresponding to . The map defined by with for all is a weight-preserving bijection, that is, .
Proof.
First we show that is a GT-pattern, that is, .
Note that since the top row is . Thus, by induction,
Recall that and so . Since , we have for all . Thus, we get , or . On the other hand, since and , we get . Thus, is indeed a GT-pattern. The same argument shows that the inverse map defined by with is the inverse to , and so is a bijection. Since , the bijection is weight-preserving, that is, . ∎
Remark 3.13.
More generally, for a dominant weight , the map given by the same formula yeilds a bijection between two parametrizations of the crystal . We won’t need this result in the sequel.
Let be a colored Lusztig data. By the bijection above, we can define the coloring of a GT-patterns by coloring each entry in the same color as under the bijection. It defines colored GT-patterns .
For convenience, we rewrite the step of coloring 3.6 for the GT-patterns. The coloring of the top row is given by the input . Starting from the next row, we color entries from top to bottom, from right to left, using the following rules at each step.
Let . Let
be a block of values and colors in the pattern T, where is the position of . If is the right-most entry in , for convenience we assume . Then the contribution at is defined by
(3.4) |
|
The statistics and and the Gauss sums are defined in Section 4. We rewrite them in terms of colored GT-patterns: and .
A colored GT-pattern is called strict if no triangle of values and colors
with when or ( and ) is present in . Denote the set of strict colored GT-patterns by . A colored GT-pattern is called (-)superstrict if is strict and for all entries with when or ( and ), or when and in the notation above. The same map from Lemma 3.12 gives the bijection between strict Lusztig data and strict GT-patterns; and between -superstrict Lusztig data and -superstrict GT-patterns.
When computing examples, GT-patterns are especially convenient because of the following observation. A term with will be right-leaning, that is, . Similarly, an entry with , will be left-leaning, that is, . In [BBF11b], such entries were decorated by boxes and circles.
3.3. Colored Lattice Models
We show that the colored data introduced above is in a weight-preserving bijection with the supersymmetric lattice models dual to the ones from [BBBG19, BBBG20]. We work with the delta version of the models while in [BBBG19, BBBG20] the gamma version is used. See the details in Section 8 of [BBF11b].
3.3.1. Non-metaplectic case
We introduce the colored lattice model that depends on a partition of length and two permutations .
The model is a rectangular grid consisting of columns numbered from to from left to right, and rows numbered from to from top to bottom. We launch colored paths of different colors that can go only down and left. Any number of paths can occupy a given vertical edges, but only one color can occupy a given horizontal edge. More formally, we allow only configurations from Figure 1 in our model. The edges with no colors are marked by plus signs. See Sections 6-7 of [BBBG19] for details.
|
Weight and permutations specify the boundary conditions: paths are launched at columns and have colors in this order. Moreover, the left boundary condition specifies what colors can leave at each row. The order of leaving colors is . See Figure 2 for an example.
Remark 3.14.
Let be a state in the model. We define a weight of as the product of Boltzmann weights of all vertices in :
where Boltzmann weights are given in Figure 1.
Lemma 3.15.
There is a weight-preserving bijection between strict colored -patterns and colored lattice states . The weight-preserving property here means that
where .
Proof.
We first notice that a state in the model is uniquely determined by its vertical edges. Indeed, admissible configurations allow paths to move only down and left. The number of rows is exactly the number of paths. Then the vertical edges prescribe the positions at which each colored path must descent and at each row one path leaves the state.
A colored GT-pattern uniquely specifies the positions and colors of paths on vertical edges. The value corresponds to the position and the color corresponds to the color of a path. Conversely, each state in the lattice models gives a unique colored GT-pattern.
For uniqueness, notice that the only obstruction is when we have the following triangle of entries and colors in a colored GT-pattern:
By strictness of GT-patterns, we have , hence, there is no ambiguity.
For the weight-preserving property we consider separately the contribution of to the weight and the contribution of . Note that the only vertices that give -contributions are vertices with an empty horizontal edge. Their number is exactly the difference between two elements in a GT-pattern from two consequent rows. Hence, all together, we get exactly the difference of rows.
For contribution, we just follow how a GT-pattern is mapped to a lattice state. We consider an example of the first type of a vertex in Figure 1. Consider part of a GT-pattern with the following configuration where .
Then it maps exactly to the first type of a vertex from Figure 1. The only possible configurations for weights to be strict is when and due to the strictness condition. But then it forces for all . The weight of such configuration is which is exactly the contribution of the corresponding vertex in the lattice model.
Other vertices types are similar. ∎
3.3.2. Metaplectic case
Now we introduce the supersymmetric lattice model that depends a partition of length , two permutations , and an integer . The case corresponds to the non-metaplectic model from the previous section. The supersymmetric model is the dual lattice model to the one considered in [BBBG20], so we use their vocabulary. In particular, they explain that in physics, the prefix s is used to imply that scolor is the supersymmetry partner of color. Scolors are elements on .
The model is a rectangular grid consisting of columns numbered from to from left to right. We launch colored paths of different colors that can go only down and left. We also launch scolored paths of different scolors that can go only down and right. Any number of colors or scolors can occupy a given vertical edges, but only one color or scolor can occupy a given horizontal edge. Moreover, colors and scolors should use the same vertical edges. More formally, we allow only configurations from Figure 3 in our model. The edges with no color are marked by plus signs. See [BBBG20] for details.
For convenience, we write for colors, and for scolors. In other words, .
|
Note that the only admissible configurations are the ones where a path with scolor descends on columns . It will be useful because the Gauss sum when . The possible configurations will rule out the states with zero contributions.
Lemma 3.16.
The Boltzmann weight of a state in the supersymmetric model equals to the weight of the corresponding -superstrict colored GT-pattern under the bijection given in Lemma 3.15.
Proof.
We build on Lemma 3.15. We already have a bijection between strict GT-patterns and colored states. Now we refine it to get a bijection between superstrict GT-patterns and supersymmetric states. Indeed, the supercolored paths give exactly the restriction on which are given in the definition of the superstrict GT-patterns.
For the weights, we notice that is taken care by the limitation of admissible states (or superstrict GT-patterns). The only thing we need to change now is to replace with which is what we do in Figure 3. ∎
4. Computing metaplectic Iwahori Whittaker functions
In this section we compute Iwahori Whittaker functions for the metaplectic covers of the general linear group . We inherit notation from Section 3: basis , weights , roots , positive roots , and the long word decomposition .
Let be a -fold metaplecic cover of from Section A.1 coresponding to the bilinear form defined by . Then for any . At the end of the section we consider other metaplectic covers.
The Iwahori Whittaker functions are determined by (A.1):
Recall that for and zero otherwise. Then by Theorem 2.9, we can rewrite values as
Let . We use coordinates from Proposition 2.2. We introduce new coordinates as follows: if (equivalently, ), we write for , and if (equivalently, ), then for . We also need coordinates defined by if and if .
We first give the explicit expression for function and the character in terms of coordinates and .
Lemma 4.1.
Let for arbitrary long word decomposition i. Then
where
Proof.
By Proposition 2.12, we have , and then it is Lemma 6.3 in [McN11]. Note that typo in this lemma (there is no Hilbert symbol in the formula). The correct value of is given in the same paper in the proof of Theorem 8.4. The idea of the proof is prove it by induction using relation from eq. A.2:
In our case for all due to the choice of the metaplectic cover. ∎
Lemma 4.2.
Let . Then
where
Proof.
Analogous to Proposition 8.2 and the beginning of Theorem 8.4 in [McN11]. The idea of the proof is to follow how the entries of change with each step of Proposition 2.2 in coordinates and write the value of explicitly. ∎
By lemmas above, we have
where by we denote
(4.1) |
The change of variables
transforms the integral into
where
and
and the domains are defined by
See Section 8 of [McN11] for details of this computation.
Recall from Definition 3.4 that denotes the set of Lusztig data corresponding to . It is a finite set for any weight .
Lemma 4.3.
The integral unless .
Proof.
Let be not in . Let be such that . Recall that character is trivial on and nontrivial on .
- Case 1:
-
Assume that in Lemma 4.2. Then becomes
Then no matter if is , , or , the condition implies that as an integral of a nontrivial character over a compact subgroup.
- Case 2:
-
Assume that in Lemma 4.2. Note that implies that , and since , we have . Then consider instead. By above, is zero unless . Without loss of generality we assume that (if it exists) by decreasing if necessary. In other words, we get that .
In any case, if is not in . ∎
Remark 4.4.
McNamara conjectures that (Remark 8.5 in [McN11]) that the analogous sum for the spherical Whittaker function is always finite for arbitrary root system and arbitrary decomposition i. Leslie in [Les19] shows that it is not always the case and gives an example of a long word decomposition for that has infinitely many non-zero terms in the corresponding evaluation.
Next, we compute integrals explicitly. The integrals will be expressed in terms of the (normalized) Gauss sum corresponding to character which is given by
Standard manipulations with the integral give the following explicit values:
Moreover, if , then .
Lemma 4.5.
Let . Then , where
(4.2) |
Proof.
We mindlessly compute it case by case. Note that we have for all .
- Case 1:
-
Assume that in Lemma 4.2.
- Case 1.1:
-
Let . Then the integral becomes
by the definition of the normalized Gauss sum.
- Case 1.2:
-
Let . Then the integral becomes
- Case 2:
-
Assume that in Lemma 4.2.
- Case 2.1:
-
Let . Then the integral becomes
- Case 2.2:
-
Let . Then the integral becomes
Thus, , and it finishes the proof. ∎
We summarize the proof above.
Theorem 4.6 (Evaluation of Iwahori Whittaker functions).
Proof.
4.1. Other metaplectic covers
At the beginning of the section we chose a specific metaplectic cover that corresponds to the bilinear form defined by . Now we explore the situation of arbitrary metaplectic cover. See [Fre21] for details.
Let be a metaplectic cover of from Section A.1 corresponding to the bilinear linear form . The main difference is that enters the formula for multiplication on the torus in eq. A.2:
Then in Lemma 4.1, we have the explicit expression for function as follows:
Note that the only difference is that is replaced with which comes from the multiplication on the torus. It changes the formula for :
It results the change in the formula for weights. Each instance of the normalized Gauss sum will be change to . This is the only change.
5. Examples
In this section, we use Theorem 4.6 to compute values given by eq. A.1 which determine the metaplectic Iwahori Whittaker functions for the general linear group. For brevity, in all examples we write . We write examples in terms of colored GT-patterns, but by Theorem 3.1, they are equivalent to colored Lusztig data or colored lattice models.
Let be a weight. We denote for each . A GT-pattern with the top row looks like this:
Recall that the statistics are defined by
In particular, if an entry is right-leaning; otherwise . We also recall that statistics are defined by
To have an additional check to our computations, we use
Theorem 5.1 ([CS80]).
The value of the spherical Whittaker function on the diagonal element equals to
(5.1) |
Therefore, in non-metaplectic case , the sum over the Weyl group of Iwahori Whittaker functions will give us the closed Casselman-Shalika expression.
Let , so . We use the template to read off statistics and : we get and . The Weyl group consists just of two elements: identity and . The Weyl vector is .
Example 5.2.
Let , so . Let . Then . Here are all colored GT-patterns:
- Input , output :
-
;
- Input , output :
-
;
- Input , output :
-
;
- Input , output :
-
and .
Theorem 4.6 and eq. 4.2 provide the values of all Iwahori Whittaker functions:
In a non-metaplectic case, . Then the calculation is consistent with eq. 5.1:
More generally, we have
Example 5.3.
Let , so . Let for . Then . Here are all colored GT-patterns:
- Input , output :
-
, , …, ;
- Input , output :
-
;
- Input , output :
-
;
- Input , output :
-
, , …, , and
.
Theorem 4.6 and eq. 4.2 provide values of all Iwahori Whittaker functions:
In a non-metaplectic case, and for any . Then the calculation is consistent with eq. 5.1:
where .
The next example shows that should not necessary be a dominant weight to give a non-zero Iwahori Whittaker function. But by Lemma A.4, unless is -almost dominant.
Example 5.4.
Let , so . Let . Then . There are only two colored GT-patterns:
- Input , output :
-
.
- Input , output :
-
.
We get the values of Iwahori Whittaker functions:
The sum of Iwahori Whittaker function is zero which is consistent with eq. 5.1 as the spherical Whittaker function is zero for non-dominant weights.
Remark 5.5.
Note the non-trivial cancellations happen when we have choice for coloring an entry. These cancellations are “invisible” when calculating the spherical Whittaker function directly. In particular, a non-strict GT-pattern that has zero contribution to the spherical Whittaker function splits to two terms, each giving a non-zero contribution to the corresponding Iwahori component. Recall that the coloring choice comes from the splitting of into and when computing Iwahori Whittaker functions.
Example 5.6.
Let be a weight, be permutations such that is -almost dominant and . Then as there is only one admissible state in the colored data with output equals to the inverse of the input. It is Proposition 3.6 in [BBBG19].
For the next example, we write a table of all colored GT-patterns together with the corresponding colored Lusztig data to demonstrate the weight-preserving bijection.
Example 5.7.
Let , so . Let , and let the input be . Let us work in the non-metaplectic case . Then and for any . It is convenient to write all colored Lusztig data with input in a table together with weights and contributions. Then the value is the corresponding sum over rows with output . See the table on the next page. This time Theorem 4.6 and eq. 4.2 provide all diagonal values of the Iwahori Whittaker functions:
Note that we again can match the Casselman-Shalika formula:
Appendix A Metaplectic groups and Iwahori Whittaker Functions
Our main object of study is the Iwahori Whittaker functions which are certain matrix coefficients of an unramified genuine principal series representations of metaplectic covers of a split reductive group over a non-archimedean field. We remark that in all discussions one can set the degree of the cover to be one and obtain results about the split reductive group itself. We give only the definitions we directly need, and for the details on representation theory side we refer to [McN11][Sections 2-5], [McN12], [Moo68], and [Ste68].
A.1. Metaplectic groups
The discussion of metaplectic groups is based on [McN11], [McN12], [McN16]. As usual, we start with the way too familiar wall of text.
Let be a split (connected) reductive group over a non-archimedian local field with ring of integers . Let be the maximal ideal of with uniformizer . Denote by the cardinality of , and the residue field by . Let be a fixed split maximal torus of , and let be the corresponding maximal torus of , the Langlads dual group. Let be a Borel subgroup of containing , be its unipotent radical, and let be a maximal compact subgroup of . Let be the corresponding opposite subgroups.
Let be the root system of which we assume to be irreducible. Then is a subset of character group . The dual root system is a subset of the cocharacter group which is identified with . We use to denote the canonical pairing between and . If , the corresponding element of is denoted . We will denote . Let the finite index set of simple roots.
A metaplectic -fold cover of is a central extension of by :
As a set, with the group multiplication given by a cocycle in . Here is the natural projection map . For any subgroup of , we denote by the induced covering group of . E.g., and .
If and , we will denote the image of in under by . By abuse of notation, we will denote a representative in by the same symbol .
Let be a positive integer such that . It implies that contains distinct -th roots of unity. Let be the group of -th roots of unity. Fix a faithful character . Let be the -th power Hilbert symbol.
Let be an -invariant symmetric bilinear form on such that for all coroots . (There will never be any possible confusion between this use of the symbol and its use for a Borel subgroup).
Under these assumptions on and bilinear form , by Theorem 3.2 of [McN12], there exists an -fold metaplectic cover of such that
where is the group commutator and is the -th power Hilbert symbol. The identity does not depend on the choice of representatives for and .
Fix such a metaplectic cover of .
A.2. Unramified genuine principal series
We recall the construction of the unramified genuine principal series representation of metaplectic group . We follow [McN11, McN12, McN16].
Let . Since the cover splits over , the group may be regarded as a subgroup of . Let , the centralizer of in . It is a maximal abelian subgroup of by Lemma 1 of [McN12].
A function on is called genuine if for , . A genuine quasicharacter of is called unramified if it is trivial on . Let be an unramified quasicharacter of , and set
The group acts on by right translation. Denote this representation as . It is an irreducible finite-dimensional -module by Theorem 5.1 of [McN12]. Next, we inflate from to and then induce (with normalization) to to obtain
where is the modular quasicharacter of . The group acts by right multiplication on . This representation is called unramified genuine principal series representation of and denoted by . We assume that is irreducible.
By Lemma 6.3 of [McN12], has a one-dimensional space of -fixed vectors. Fix a non-zero vector which is called a spherical vector.
A.3. Whittaker functionals on metaplectic covers
Choose Haar measure on such that has volume , and denote it by . Choose a normalization of Haar measure on such that .
Fix a non-degenerate character of such that the restriction to the subgroup for each simple root has conductor , that is, trivial on , but non-trivial on .
A (complex-valued) Whittaker functional (with respect to ) on a representation of is a linear functional such that for all , .
By [McN16] (Section 6), there is a unique (up to constant) -valued function on given by the integral
The integral is convergent if for all positive roots , and can be extended to all by analytic continuation.
To get a Whittaker functional we need to compose with a linear functional on . More precisely, there is an isomorphism between and the space of -valued Whittaker functionals on given by composition (Theorem 6.2 of [McN16])
Thus, the dimension of the space of Whittaker functionals on is by Theorem 8.1 of [McN12].
Remark A.1.
Note that in the non-metaplectic case (), the space of Whittaker functionals is one-dimensional. In the metaplectic case () we have a richer theory of Whittaker functionals.
Now we construct a natural basis of the Whittaker functionals. Let and let be a subset of coweights such that is a set of coset representatives for . When unambiguous, we identify with this set. Then vectors form a basis of . Let for denote the corresponding dual basis of , so we have
By above, the space of Whittaker functionals on has the following basis
A.4. Iwahori Whittaker function for metaplectic covers
Define the Iwahori subgroup of as the preimage of under the mod reduction . The space of Iwahori fixed vectors has dimension . For each , define an Iwahori fixed vector by
where is the spherical fixed above, and , , , and ; we use the metaplectic Iwahori decomposition to express an arbitrary element as product of such terms. Note the twist by in the definition. By construction, form a basis of , and are sometimes called the standard Iwahori basis.
Remark A.2.
Note that . Thus, we have a refinement of a spherical vector , and we can obtain information about the spherical vector by summing over Iwahori basis.
Now we can define the main object of our study, the (metaplectic) Iwahori Whittaker functions , which are the matrix coefficients on corresponding to Whittaker basis functionals and Iwahori basis vectors . Explicitly,
Note that commutes with the integral. Write with , , , and , and write for , , and . For convenience, let us write as follows
Denote for for each . Then we write . Note that does not depend uniquely on : in particular, if , then the corresponding representations are isomorphic. Furthermore, is irreducible if and only if for all coroots . Finally, denote , and . Then in notaion above, if and zero otherwise.
The average metaplectic Iwahori Whittaker Function is given by
Definition A.3 (Definition 2.1, [BBBG20]).
Let , let be a simple root and the corresponding coroot. A weight is -almost dominant if
Lemma A.4 (Lemma 3.7, [BBBG20]).
Let and . Then unless is -dominant.
Let . By Iwahori decomposition, we can write with , , , and . Transform on the left by and on the right by trivially to up get
up to a constant. We can assume as the diagonal element in central, and we just get a factor of . Conjugate to get
up to a constant, , and
(A.1) |
This integral is the main object of our study as it gives all the values of the Iwahori Whittaker functions. The recursive calculation of it is given by Brubaker, Buciumas, Bump, and Gustafsson [BBBG19, BBBG20]. The main goal of present paper is to calculate these values combinatorically. We do it in Section 4.
Notice that the eq. A.1 is an integral over which lives in the derived group of . Hence, all the computations can be reduced to the derived group. We will need the following generators.
A.5. Generators of the derived group
Let be the derived group of , so is semisimple. Let be the induced covering group. We mainly work with since all the calculations happen in the subgroup of . Denote , , and . The Iwasawa decomposition lifts to , and hence . By Section 4, [McN12], splits over , , and . Thus, we can identify with their images in and in . Also, for and , we have , as one would expect.
The group is a quotient of the universal central extension of , and thus admits the description in terms of generators of relations. Namely, the group is generated by symbols where and , subject to the relations
where , and
for all and with , where is a fixed collection of integers, completely determined by the root system . See Section 3 of [McN11] and [Ste68] for details.
Note that the terms in the last product commute, so there is no ambiguity with respect to order of multiplication. In the noncommutative case we write for , and for where .
Moreover, there are additional relations coming from the choice of the central extension. Define the elements by and let . Then the following identities hold in .
(A.2) |
where we recall that is the value of Hilbert symbol and is central in .
With these generators, is generated by the images of all elements of the form for , is generated by the images of for and . Similarly, is the subgroup of generated by all where and .
Let be the Weyl group. The induced cover of splits over the maximal compact subgroup . If we choose coset representatives in , we can identify with .
Let be the representatives of . Then the elements generate . For any write , then we have the element that maps to under the projection map . For any positive root , choose a simple root and a Weyl group element such that . Then set .
References
- [BBBG19] Ben Brubaker, Valentin Buciumas, Daniel Bump, and Henrik P. A. Gustafsson. Colored Vertex Models and Iwahori Whittaker Functions, 2019. arXiv:1906.04140.
- [BBBG20] Ben Brubaker, Valentin Buciumas, Daniel Bump, and Henrik Gustafsson. Metaplectic Iwahori Whittaker functions and supersymmetric lattice models, 2020. arXiv:2012.15778.
- [BBF11a] Ben Brubaker, Daniel Bump, and Solomon Friedberg. Schur polynomials and the Yang-Baxter equation. Comm. Math. Phys., 308(2):281–301, 2011. URL: https://doi-org.stanford.idm.oclc.org/10.1007/s00220-011-1345-3, doi:10.1007/s00220-011-1345-3.
- [BBF11b] Ben Brubaker, Daniel Bump, and Solomon Friedberg. Weyl group multiple Dirichlet series, Eisenstein series and crystal bases. Ann. of Math. (2), 173(2):1081–1120, 2011. doi:10.4007/annals.2011.173.2.13.
- [Bou68] N. Bourbaki. Éléments de mathématique. Fasc. XXXIV. Groupes et algèbres de Lie. Chapitre IV: Groupes de Coxeter et systèmes de Tits. Chapitre V: Groupes engendrés par des réflexions. Chapitre VI: systèmes de racines. Actualités Scientifiques et Industrielles [Current Scientific and Industrial Topics], No. 1337. Hermann, Paris, 1968.
- [CS80] W. Casselman and J. Shalika. The unramified principal series of -adic groups. II. The Whittaker function. Compositio Math., 41(2):207–231, 1980. URL: http://www.numdam.org/item?id=CM_1980__41_2_207_0.
- [DeF21] Mario DeFranco. On a conjecture about an analogue of Tokuyama’s theorem for . J. Algebraic Combin., 53(1):157–175, 2021. doi:10.1007/s10801-019-00924-4.
- [Fre21] Claire Frechette. Yang-Baxter Equations for General Metaplectic Ice, 2021. arXiv:2009.13669.
- [FZ16] Solomon Friedberg and Lei Zhang. Tokuyama-type formulas for characters of type B. Israel J. Math., 216(2):617–655, 2016. URL: https://doi-org.stanford.idm.oclc.org/10.1007/s11856-016-1422-6, doi:10.1007/s11856-016-1422-6.
- [Gra17] Nathan Tyler Gray. Metaplectic Ice for Cartan Type C, 2017. Thesis (Ph.D.)–University of Minnesota. arXiv:1709.04971.
- [HK02] A. M. Hamel and R. C. King. Symplectic shifted tableaux and deformations of Weyl’s denominator formula for . J. Algebraic Combin., 16(3):269–300 (2003), 2002. URL: https://doi-org.stanford.idm.oclc.org/10.1023/A:1021804505786, doi:10.1023/A:1021804505786.
- [HK07] A. M. Hamel and R. C. King. Bijective proofs of shifted tableau and alternating sign matrix identities. J. Algebraic Combin., 25(4):417–458, 2007. URL: https://doi-org.stanford.idm.oclc.org/10.1007/s10801-006-0044-1, doi:10.1007/s10801-006-0044-1.
- [Iva12] Dmitriy Ivanov. Symplectic ice. In Multiple Dirichlet series, L-functions and automorphic forms, volume 300 of Progr. Math., pages 205–222. Birkhäuser/Springer, New York, 2012. URL: https://doi-org.stanford.idm.oclc.org/10.1007/978-0-8176-8334-4_10, doi:10.1007/978-0-8176-8334-4\_10.
- [Jac67] Hervé Jacquet. Fonctions de Whittaker associées aux groupes de Chevalley. Bull. Soc. Math. France, 95:243–309, 1967. URL: http://www.numdam.org/item?id=BSMF_1967__95__243_0.
- [Les19] Spencer Leslie. Resonant Mirković-Vilonen polytopes and formulas for highest-weight characters. Selecta Math. (N.S.), 25(3):Paper No. 41, 38, 2019. doi:10.1007/s00029-019-0486-7.
- [McN11] Peter J. McNamara. Metaplectic Whittaker functions and crystal bases. Duke Math. J., 156(1):1–31, 2011. URL: https://doi-org.stanford.idm.oclc.org/10.1215/00127094-2010-064, doi:10.1215/00127094-2010-064.
- [McN12] Peter J. McNamara. Principal series representations of metaplectic groups over local fields. In Multiple Dirichlet series, L-functions and automorphic forms, volume 300 of Progr. Math., pages 299–327. Birkhäuser/Springer, New York, 2012. URL: https://doi-org.stanford.idm.oclc.org/10.1007/978-0-8176-8334-4_13, doi:10.1007/978-0-8176-8334-4\_13.
- [McN16] Peter J. McNamara. The metaplectic Casselman-Shalika formula. Trans. Amer. Math. Soc., 368(4):2913–2937, 2016. URL: https://doi-org.stanford.idm.oclc.org/10.1090/tran/6597, doi:10.1090/tran/6597.
- [Moo68] Calvin C. Moore. Group extensions of -adic and adelic linear groups. Inst. Hautes Études Sci. Publ. Math., (35):157–222, 1968. URL: http://www.numdam.org/item?id=PMIHES_1968__35__157_0.
- [Oka90] Soichi Okada. Partially strict shifted plane partitions. J. Combin. Theory Ser. A, 53(1):143–156, 1990. URL: https://doi-org.stanford.idm.oclc.org/10.1016/0097-3165(90)90025-R, doi:10.1016/0097-3165(90)90025-R.
- [PRS09] James Parkinson, Arun Ram, and Christoph Schwer. Combinatorics in affine flag varieties. J. Algebra, 321(11):3469–3493, 2009. doi:10.1016/j.jalgebra.2008.04.015.
- [Shi76] Takuro Shintani. On an explicit formula for class- “Whittaker functions” on over -adic fields. Proc. Japan Acad., 52(4):180–182, 1976. URL: http://projecteuclid.org/euclid.pja/1195518347.
- [Ste68] Robert Steinberg. Lectures on Chevalley groups. Yale University, New Haven, Conn., 1968. Notes prepared by John Faulkner and Robert Wilson.
- [Tok88] Takeshi Tokuyama. A generating function of strict Gelfand patterns and some formulas on characters of general linear groups. J. Math. Soc. Japan, 40(4):671–685, 1988. URL: https://doi-org.stanford.idm.oclc.org/10.2969/jmsj/04040671, doi:10.2969/jmsj/04040671.