Quantized Howe-type dualities via Koornwinder polynomials and the phenomenon
Thomas Gerber
Address: Institut Camille Jordan, Lyon 1 University, France
Email address: gerber@math.univ-lyon1.fr, Bogdan Ion
Address: Department of Mathematics, University of Pittsburgh, USA
Email address: bion@pitt.edu, Cédric Lecouvey
Address: Institut Denis Poisson, University of Tours, France
Email address: Cedric.Lecouvey@univ-tours.fr and Cristian Lenart
Address: Department of Mathematics and Statistics,
State University of New York at Albany
Email address: clenart@albany.edu
Abstract.
We derive the equality between one-dimensional sums associated with tensor
products of Kirillov-Reshetikhin column crystals of classical affine types and
Lusztig -analogues of weight multiplicities. The matching of the corresponding root systems is suggested by Howe duality. Our main tool is the dual
Cauchy formula for Koornwinder polynomials due to Mimachi, which we combine with specializations in these polynomials.
The mentioned dualities are proved for one-dimensional sums of all (twisted and untwisted) classical affine types except types and . On another hand, all the Lusztig -analogues of classical type are covered by our dualities, but they may have different parameters depending on the length of the roots in the underlying root system.
Introduction
Lusztig’s -weight multiplicities are deformations of the usual weight multiplicities for complex simple Lie algebras [31].
They are also known as (generalized) Kostka-Foulkes (KF) polynomials,
as in type they coincide with the usual KF polynomials. The numerous connections of these polynomials with many fundamental structures in representation theory make them particularly fascinating and challenging objects of study.
Being affine Kazhdan-Lusztig polynomials [21, 31], the -weight multiplicities have non-negative integer coefficients,
but a combinatorial proof of this property is only known in type in full generality [23], and relies on a statistic on semistandard Young tableaux called charge.
In fact, the approach in [23] was twofold, in the sense that a combinatorial proof of the positivity,
based on rank recursion (the so-called Morris recurrence formula), was given simultaneously with the combinatorial description in terms of semistandard tableaux.
In other types, numerous partial results of this difficult problem have been established, but such a general picture remains incomplete for a general root system.
We refer the reader, for example, to [26, 18] for a description of the Kostka-Foulkes polynomials in classical types associated to the weight based on the combinatorics of generalized exponents, and for more historical background about the combinatorics of the Kostka-Foulkes polynomials with relevant references.
We also mention [7, 36], in which a charge statistic is shown to exist in type for row shapes and in rank 2, respectively.
The goal of this paper is to equate Kostka-Foulkes polynomials
(denoted ) with so-called one-dimensional sums (denoted ),
which are polynomials in obtained as generating functions of the energy on the set of classical highest weight vertices of certain finite affine crystals known as Kirillov-Reshetikhin (KR) crystals.
This provides a duality between -weight multiplicities and graded tensor product multiplicities, which, given the notation, is referred to as .
The first result dates back to 1997, when Nakayashiki and Yamada [35] gave a combinatorial description of the Kostka-Foulkes polynomials of type by establishing a relationship between the Lascoux-Schützenberger charge and the energy function on a certain tensor product of column shape Kirillov-Reshetikhin crystals of affine type .
In fact, these two statistics coincide up to a Howe-type duality, see [11, Section 2.8] for a more modern viewpoint.
Later, a further result was derived in [27], for all classical affine types in a stable limit. More precisely, it is shown that, if the two partitions are fixed, and the rank of the corresponding root system goes to infinity, then the corresponding one-dimensional sum stabilizes (i.e., it does not depend on ). It is then proved that there are only four stable limits, which correspond to the following affine types: , , , and . Finally, the stable limits are realized as certain parabolic Lusztig -weight multiplicities of the corresponding finite classical types. Much more recently, in [5], the Kostka-Foulkes polynomials of type (for any pair of dominant weights) and type (for any pair of spin dominant weights) are related to certain stable one-dimensional sums. Other versions of Lusztig -weight multiplicities are also considered.
In this paper, we establish remarkable identities between the Lusztig -weight multiplicities of all classical types and one-dimensional sums arising from the energy function on column Kirillov-Reshetikhin crystals of all (twisted and untwisted) classical affine types except type and .
More precisely, we prove that, for any partitions with at most rows and columns, we have
(1)
here
, with being the conjugate of , apart from affine type , where such an identity is known, but we need to set .
The matching of the corresponding root systems is suggested by Howe duality, and in fact the matched ranks are related to (for the -weight multiplicities) and (for the one-dimensional sums).
The general correspondence is more subtle than in type and, in some cases, it involves Kostka-Foulkes polynomials with unequal parameters.
Furthermore, we sometimes need to change the labeling of the 0-node in the affine Dynkin diagram;
although this operation does not change the affine root system up to isomorphism, it changes the one-dimensional sum considered.
2 illustrates the correspondence underlying the quantized duality results established in this paper.
Type of Kostka-Foulkes polynomial
Kostka-Foulkes parameter
Type of one-dimensional sum
, integer weights
, half-integer weights
, integer weights
, half-integer weights
Table 2. Matching types between Kostka-Foulkes polynomials and one-dimensional sums.
We discuss some computational applications of our results, while referring to Section 10 for additional ones. We can derive a combinatorial description of the classical Kostka-Foulkes polynomials in terms of the corresponding affine crystals, cf. 2. Indeed, while the definition of the energy function via local energies is impractical, it was shown in [30] that, on a tensor product of column shape Kirillov-Reshetikhin crystals, this function can be computed very explicitly in terms of a type-independent combinatorial model known as the quantum alcove model. This is based on a directed graph on the corresponding Weyl group known as the quantum Bruhat graph. Moreover, in [28, 29] it was shown that, in all classical types, the mentioned computations can be pushed to the corresponding (type-specific) tableau models (based on Kashiwara-Nakashima columns). In fact, in [28] it was also shown that, by applying the same procedure in type , one easily rederives the Lascoux-Schützenberger charge statistic on semistandard tableaux.
We will now compare the results obtained in the present paper and those in [5].
(1)
2 permits to equate, for any pair of dominant weights of a given classical root system
(partitions or half-integer partitions in orthogonal types), its associated Kostka-Foulkes polynomial with a one-dimensional sum. [5] covers the two types of classical Kostka-Foulkes polynomials mentioned above.
Our level of generality sometimes requires us to consider Kostka-Foulkes polynomials with unequal parameters, possibly negative. In fact, the -Kostka-Foulkes polynomials of type corresponding to a pair of half-integer partitions (spin weights) were already considered in [5], whereas we consider their specialization at .
(2)
Our dualities are direct ones, whereas those in [5] sometimes involve only a certain part of a one-dimensional sum, which is identified via subtle combinatorics.
(3)
The duality results in [5] hold for one-dimensional sums considered in large rank.
In our work, we match root systems of arbitrary finite ranks (as suggested by Howe duality), without any assumption on these ranks being large.
In order to understand the relationship between these two types of dualities, first recall from [27] that, for large enough,
the one-dimensional sums of type and (those appearing in [5])
coincide respectively with those of type and (appearing in the present paper).
When this happens, while increasing and keeping fixed in (1), we recover the results of [5] involving certain, but not all, Kostka-Foulkes polynomials of type and type (for spin weights and ).
(4)
We only need to consider one-dimensional sums associated to tensor products of column shape Kirillov-Reshetikhin-crystals. Tensor products of row shape Kirillov-Reshetikhin crystals are also considered in [5] in the stable case, in relation to so-called level-restricted -weight multiplicities.
(5)
The methods used in this paper are completely different from those in [5], which are based on the intricate tableau combinatorics in classical types and the Morris-type recurrence formulas for the Kostka-Foulkes polynomials in [24]. Our approach relies on properties of Macdonald-Koornwinder polynomials, which lead to more concise and conceptual proofs.
More precisely, our proofs are based on known Cauchy-type identities and connections between Macdonald polynomials specialized at and Kirillov-Reshetikhin crystals.
In particular, we rederive Nakayashiki and Yamada’s type result directly from the theory of Macdonald polynomials, without using any combinatorial description of the charge or the energy statistic.
The structure of the paper is as follows.
In Section1 we recall the background on root systems and the Weyl characters relevant for our purposes. Section2 is devoted to Koornwinder polynomials, the dual Cauchy formula they satisfy, as well as their connections with Macdonald polynomials, Hall-Littlewood polynomials, affine Demazure characters, and Weyl module characters. Then, in Section3, we explain the way in which the classical type identity equating Kostka-Foulkes polynomials and one-dimensional sums [35] can be recovered based on the usual Cauchy identities (for Schur functions, Hall-Littlewood polynomials, and Macdonald polynomials). This section is relatively independent of the others and should help the reader understand our general strategy. In Section4, we adapt the previous ideas in order to derive our main result in type . The case of Kostka-Foulkes polynomials of type parametrized by a pair of partitions is examined in Section5. In Section6, we use Kostka-Foulkes polynomials of type with unequal parameters indexed by a pair of half-integer partitions or a pair of partitions, and relate them to certain one-dimensional sums. Here the second case requires the use of a negative parameter. Finally, we study the case of type Kostka-Foulkes polynomials parametrized by pairs of half-integer partitions in Section7. All these identities require more work than in the type case, as we need to use a Cauchy identity at the level of Koornwinder polynomials and study specific “non-Macdonald” specializations. Furthermore, although the general strategy is the same, its realization depends on the type considered. Therefore, for the clarity of the exposition, we study each case separately. Section8 of the paper is devoted to the inverse problem of equating any one-dimensional sum associated with a tensor product of column Kirillov-Reshetikhin crystals of a given classical type with a Kostka-Foulkes polynomial. We show that this is indeed possible in type , but present some obstructions in the remaining untwisted classical types. Nevertheless, we believe that it is possible to equate the remaining one-dimensional sums of types and with generalizations of Kostka-Foulkes polynomials, and we are currently working on this problem. We present a worked example in Section 9, which is carried out in each affine type. Our final section outlines several directions for future research motivated by the results of this paper.
Acknowledgment
T. Gerber and C. Lecouvey were partially supported by the Agence Nationale de la Recherche funding ANR CORTIPOM 21-CE40-0019.
B. Ion was partially supported by the Simons Foundation grant 420882.
C. Lenart was partially supported by the NSF grant DMS-2401755.
1. Background on representation theory and root systems
1.1. Simple Lie algebras and finite root systems
In this section, we recall some classical results on root
systems and the representation theory of the Lie algebras over .
We refer the reader to [1, 8, 15] for a detailed
exposition. Consider such a finite-dimensional simple algebra with root system
of type , realized in the
Euclidean space .
When there is no risk of confusion, we will drop the superscript to simplify the
notation and simply write for example instead of
.
The Dynkin diagram of is indexed
by and we denote as usual by
•
and the subsets of positive and simple roots respectively,
•
the Weyl group with generators associated with the
simple roots ,
•
the length function on : for any in , is the
number of generators in any reduced expression of ,
•
the root lattice and the cone generated by the positive roots,
•
the weight lattice and the cone of dominant weights,
generated by the fundamental weights ,
•
,
the half-sum of positive roots,
•
the simple -module of highest weight
•
the dominance order on , defined by if and only
if .
We also recall the Weyl character formula. For each dominant weight in
, the character of is the polynomial verifying
We shall also use the notation for any . Then . The family of polynomials where
is another basis of the character ring . The generalized
Kostka numbers are the coefficients in the expansion of the Weyl characters on
this basis:
(2)
The generalized Kostka number is a nonnegative integer equal
to the dimension of the weight space of weight in the representation
.
We will be interested in the classical root systems of type and . We will assume the classical realization of these
root systems, namely
and
Also, it will be convenient to set in order to
identify the previous character ring with the ring of
symmetric polynomials for type in the indeterminates (where we will consider for simplicity the Lie algebra
rather than ) and with the ring of
symmetric Laurent polynomials for types , , or .
1.2. Affine Lie algebras and crystals
Recall here that the affine root systems were classified by Kac (see
[19]) in terms of their associated affine Dynkin diagram. Each such
Dynkin diagram of type is obtained by adding an affine node
(usually labelled by ) to one of the Dynkin diagrams associated with a
finite root system of rank .
Here again, in what follows, we will only use a
superscript when it will be required for the clarity of the
exposition. The root lattice so obtained is then
where is
the imaginary null root for any affine classical types but type where .
The affine weight lattice can then be described as
where is the weight lattice of the
finite root system with fundamental weights and
the fundamental affine weight associated with the -node.
We
will denote by the affine Weyl group associated with our
affine root system. It is generated by the affine reflections and contains the finite Weyl group as the subgroup
generated by the . In the rest of this paper, we will
assume that the affine root systems that we consider are of classical type,
that is their underlying finite root system is of type or .
Kac’s classification ensures that
is one of
, , , (untwisted types),
, , (twisted types).
In fact, we will also need the variations , , and of the
affine root systems , , and respectively, in which we relabel the nodes of the Dynkin diagrams by changing each label into .
This does not change the associated root system up to isomorphism but will change the
energy statistic.
2 and 4 contain the affine Dynkin diagrams that will be
used in this paper.
Figure 2. Affine Dynkin diagrams of untwisted classical types.
Figure 4. Affine Dynkin diagrams of twisted classical types.
Recall that crystal graphs can be regarded as combinatorial skeletons of
irreducible highest weight modules associated with any simple affine Lie
algebra , see [13, 2] for generalities.
More precisely, in the Kashiwara-Lusztig approach
of crystal theory, these objects are defined from representation theory of the quantum group
associated with .
The irreducible highest weight -modules
are parametrized by the dominant affine weights: write for
the module labeled by the dominant weight .
The crystal
is then an oriented graph with arrows , where
, equipped with a weight map
One can then compute the character of as the generating series
of the weight map, that is
This crystal has a unique source vertex of weight
and a natural grading: the degree of in
is the number of -arrows in any path connecting
to .
A remarkable property of crystals is its compatibility with the tensor product.
More precisely, the decomposition of a tensor product of
simple modules into irreducible components is obtained by looking at the
decomposition of the associated crystal into its connected components.
There is also a rich finite-dimensional representation theory of a
particular subalgebra .
The associated simple modules are no longer of highest
weight and the associated category is not semisimple.
In this article, we are
especially interested in some particular simple finite-dimensional such modules
called the Kirillov-Reshetikhin modules. These are
parametrized by pairs , and are denoted . In what follows, we will only consider these KR modules for , which are called
column KR modules since can be
interpreted as the height of a column-shaped Young diagram. The KR modules also have
associated crystal graphs with -arrows indexed by . These graphs are finite and connected but do not have a distinguished
source vertex (reflecting the fact the KR modules are finite-dimensional but
not of highest weight).
When , they admit a simple
combinatorial description in terms of column tableaux introduced by Kashiwara
and Nakashima [20], which depends on the classical affine type
considered, see [2] for more details.
Example 1.1.
In type , the vertices of can be identified with
the column tableaux of height on the alphabet . For
, there is an edge
if and only if there exists such that , and is the column obtained by replacing by
in ; there is an edge if ,
and is the column obtained by replacing
by in and by reordering the entries.
For instance, take and . The set of vertices in the column KR crystal
is
and the column KR crystal B(2,1)B^{(2,1)} is shown in 6.
Figure 6. The column KR crystal B(2,1)B^{(2,1)}.
The tensor products of KR modules are still irreducible,
thus the tensor product of column
KR crystals give finite-connected crystals.
These crystals do not remain
irreducible in general when one removes the 00-arrows. In fact, these
00-arrows permit to define a subtle statistic DD, called energy, on any
tensor product BB of KR crystals in such a way that DD is constant on the
classical components of BB (obtained by removing the 00-arrows). The
definition of DD is quite involved and also depends on a choice of normalization
(i.e. the choice of a particular classical component where DD is zero).
For the purpose of this paper, we can in fact bypass this definition by
exploiting the connection between our crystal BB and a well-chosen affine
Demazure crystal, which we will explain in Theorem2.6.
For the moment, let us denote by HW(B)\mathrm{HW}(B) the set of classical highest weight vertices in BB, that is the set of
vertices in bb with no incident ii-arrows but one 00-arrow. Each vertex bb
in HW(B)\mathrm{HW}(B) admits a classical dominant weight.
We can then collect
all the classical highest weight vertices in HW(B)\mathrm{HW}(B) with prescribed dominant weight λ\lambda.
The generating series associated with the energy
function DD over the subset HW(B)λ\mathrm{HW}(B)_{\lambda} of HW(B)\mathrm{HW}(B)
with dominant weight λ\lambda is called a one-dimensional sum (1-d sum for
short). In this paper we are particularly interested in the 1-d sums defined
from a partition μ\mu in the rectangular partition (mn)(m^{n}).
(whose Young diagram has nn rows and mm columns).
To such a partition, we can indeed associate the tensor product of
column KR crystals
2. Koornwinder polynomials and their Macdonald specializations
2.1. Basics on Koornwinder polynomials
In this paragraph, we recall the definition of the Koornwinder polynomials.
We refer the reader to [33] for a brief history and more details. Consider a formal parameter aa and recall the notation for the qq-Pochhammer symbol
In what follows q,t,a,b,c,dq,t,a,b,c,d are indeterminates and we set 𝕂=ℂ(q,t,a,b,c,d)\mathbb{K}=\mathbb{C}(q,t,a,b,c,d). Consider the ring 𝕂W[x1±1,…,xn±1]\mathbb{K}^{W}[x_{1}^{\pm 1},\ldots,x_{n}^{\pm 1}] of Laurent polynomials in the indeterminates x1,…,xnx_{1},\ldots,x_{n} invariant by the action of W,W, the Weyl group of type CnC_{n}. As mentioned in the previous section, this can be regarded as the character ring of type CnC_{n} over 𝕂\mathbb{K}. In particular 𝕂W[x1±1,…,xn±1]\mathbb{K}^{W}[x_{1}^{\pm 1},\ldots,x_{n}^{\pm 1}] admits various bases indexed by the set 𝒫n\mathcal{P}_{n} of partitions
with at most nn parts (which here can be identified with the set of
dominant weights of type CnC_{n}). We have a natural bar involution on 𝕂[x1±1,…,xn±1]\mathbb{K}[x_{1}^{\pm 1},\ldots,x_{n}^{\pm 1}] such that for any ff in 𝕂[x1±1,…,xn±1]\mathbb{K}[x_{1}^{\pm 1},\ldots,x_{n}^{\pm 1}], the polynomial f¯\overline{f} is obtained by replacing each xix_{i} by its inverse xi−1x_{i}^{-1}. We
write [f]1[f]_{1} for the constant term in ff. Now we can define a paring on
𝕂W[x1±1,…,xn±1]\mathbb{K}^{W}[x_{1}^{\pm 1},\ldots,x_{n}^{\pm 1}] by
The following proposition defines the basis of Koornwinder polynomials.
Proposition 2.1.
There exists a unique basis {Pλ(x,a,b,c,d,q,t)∣λ∈𝒫n}\{P_{\lambda}(x;a,b,c,d;q,t)\mid\lambda\in\mathcal{P}_{n}\} of 𝕂W[x1±1,…,xn±1]\mathbb{K}^{W}[x_{1}^{\pm 1},\ldots,x_{n}^{\pm 1}]
whose decomposition on the monomial basis {mλ(x)∣λ∈𝒫n}\{m_{\lambda}(x)\mid\lambda\in\mathcal{P}_{n}\} is unitriangular for the dominant order and such that
for any pair λ,μ∈𝒫n\lambda,\mu\in\mathcal{P}_{n} with that λ≠μ\lambda\neq\mu. The polynomials Pλ(x,a,b,c,d,q,t)P_{\lambda}(x;a,b,c,d;q,t), for λ∈𝒫n\lambda\in\mathcal{P}_{n}, are called the Koornwinder polynomials (of rank nn).
Remark 2.2.
The Koornwinder polynomials are invariant with respect to the permutation of the
indeterminates a,b,c,da,b,c,d which are called Askey-Wilson parameters. They can also be defined as the eigenfunctions of a
remarkable order one qq-difference operator acting on 𝕂W[x1±1,…,xn±1]\mathbb{K}^{W}[x_{1}^{\pm 1},\ldots,x_{n}^{\pm 1}].
2.2. Koornwinder polynomials and the dual Cauchy identity
Fix n,m∈ℤ≥1n,m\in\mathbb{Z}_{\geq 1}. We denote by (mn)(m^{n}) the rectangular
partition with nn rows and mm columns. For any partition λ⊆(mn)\lambda\subseteq(m^{n}), we set
Note that Pλ(x,a,b,c,d,q,t)P_{\lambda}(x;a,b,c,d;q,t) is a rank nn Koornwinder
(q,t)(q,t)-polynomial in x=x1,…,xnx=x_{1},\ldots,x_{n}, and Pλ^(y,a,b,c,d,t,q)P_{\widehat{\lambda}}(y;a,b,c,d;t,q) is a rank mm Koornwinder
(t,q)(t,q)-polynomial in y=y1,…,ymy=y_{1},\ldots,y_{m}, both with the same Askey-Wilson parameters
a,b,c,da,b,c,d.
2.3. Macdonald specializations
It is known that these Koornwinder polynomials recover Macdonald polynomials
by appropriate specialization of the Askey-Wilson parameters a,b,c,da,b,c,d. More precisely, we
recover Macdonald polynomials PλTN(a)(x,q,t,u)P_{\lambda}^{T_{N}^{(a)}}(x;q,t,u) of each
classical affine types TN(a)T_{N}^{(a)} by using the specializations in Table 4, see e.g. [6].
Table 4. Specializations of the Koornwinder polynomials yielding Macdonald
polynomials. Permutations of the parameters (a,b,c,d)(a,b,c,d) are allowed. The usual equal parameter
Macdonald polynomials are obtained for u=tu=t.
Observe that the Macdonald polynomials we consider are associated to non-simply laced affine root systems and we can consider the corresponding Macdonald
polynomials with unequal parameters (t,u)(t,u), with tt being associated to the roots of square length 22, and uu being associated to roots of square root length 11 (for Bn(1)B_{n}^{(1)}, Bn(1,†)B_{n}^{(1,\dagger)}, Dn+1(2)D_{n+1}^{(2)}), or 44 (for A2n−1(2)A_{2n-1}^{(2)}, A2n−1(2,†)A_{2n-1}^{(2,\dagger)}, Cn(1)C_{n}^{(1)}), or both (for A2n(2)A_{2n}^{(2)}). Note that A2(2)A_{2}^{(2)} has no roots of square length 22 and in this case the Macdonald polynomials do not involve the parameter tt. On the other hand, Dn(1)D_{n}^{(1)} has only roots of square length 22 and in this case the Macdonald polynomials do not involve the parameter uu. To streamline the notation we will keep both parameters t,ut,u in the notation even in the situations when the particular Macdonald polynomials depend only one of them.
The more typically used equal parameter Macdonald
polynomials PλTN(a)(x,q,t)P_{\lambda}^{T_{N}^{(a)}}(x;q,t) are obtained by setting u=tu=t, that
is PλTN(a)(x,q,t)=PλTN(a)(x,q,t,t)P_{\lambda}^{T_{N}^{(a)}}(x;q,t)=P_{\lambda}^{T_{N}^{(a)}}(x;q,t,t). The parameter uu will allow us to consider the Hall-Littlewood
polynomials with unequal parameters which will be considered starting with Section 6.
2.4. Hall-Littlewood polynomials and the q=0q=0 Macdonald
specialization
The Hall-Littlewood polynomials can be regarded as the q=0q=0
specializations of Macdonald polynomials. Observe first that by
Table 4, once a Macdonald specialization of type TN(a)T_{N}^{(a)}
is performed in a Koornwinder polynomial, the additional q=0q=0 specialization
only depends on the parabolic subsystem TnT_{n} of TN(a)T_{N}^{(a)} obtained by
removing its 00-node. For any dominant weight γ∈P+Tn\gamma\in P_{+}^{T_{n}}, we
can thus define the Hall-Littlewood polynomial PγTn(x,t,u)P_{\gamma}^{T_{n}}(x;t,u) by
where TN(a)T_{N}^{(a)} is any affine root system with underlying classical root
system TnT_{n}.
The previous Hall-Littlewood polynomials have a simpler definition independent of
Koornwinder-Macdonald polynomial theory. For each classical root system
Tn=BnT_{n}=B_{n}, CnC_{n}, or DnD_{n}, one can indeed establish that the family of
Hall-Littlewood polynomials {PγTn(x,u,t)∣γ∈P+Tn}\{P_{\gamma}^{T_{n}}(x;u,t)\mid\gamma\in P_{+}^{T_{n}}\} yields a basis of the character ring of type TnT_{n} such
that
sνTn(x)=∑γKν,γ(u,t)PγTn(x,u,t) for any ν∈P+Tn,s_{\nu}^{T_{n}}(x)=\sum_{\gamma}K_{\nu,\gamma}(u,t)\,P_{\gamma}^{T_{n}}(x;u,t)\text{ for any }\nu\in P_{+}^{T_{n}}\,,
where the polynomials Kν,γ(u,t)K_{\nu,\gamma}(u,t) are (u,t)(u,t)-deformations of the
generalized Kostka numbers Kν,γK_{\nu,\gamma} (see (2)). One can show
(see [34]) that they can be obtained from the (u,t)(u,t)-Kostant partition
function 𝒫u,tTn\mathcal{P}_{u,t}^{T_{n}} defined from the series expansion
Observe that such double deformations of the generalized Kostka numbers have
been already introduced and studied in [5] and [25]. We will
call them unequal-parameter Kostka-Foulkes polynomials. We will write for simplicity
Kν,γTn(t)=Kν,γTm(t,t).K_{\nu,\gamma}^{T_{n}}(t)=K_{\nu,\gamma}^{T_{m}}(t,t).\ These last
tt-deformations of the generalized Kostka numbers are also called Lusztig
tt-analogues of weight multiplicities in the literature. They are know to
admit nonnegative integer coefficients. Similarly, the polynomials PγTn(x,t)=PγTn(x,t,t)P_{\gamma}^{T_{n}}(x;t)=P_{\gamma}^{T_{n}}(x;t,t) are the usual (one-parameter)
Hall-Littlewood polynomials of type TnT_{n}.
Remark 2.3.
(1)
One can prove (see [34]) that the unequal-parameter Hall-Littlewood polynomials
of type BnB_{n} also satisfy
with I(w)={α∈R+Bn∣w(α)∈−R+Bn}I(w)=\{\alpha\in R_{+}^{B_{n}}\mid w(\alpha)\in-R_{+}^{B_{n}}\} and
vα=tv^{\alpha}=t (resp. vα=uv^{\alpha}=u) if α\alpha is a long (resp. short)
root. There are similar formulas in type CnC_{n} and DnD_{n}.
(2)
It is proved in [5] that the polynomials Kν,γBn(u,t)K_{\nu,\gamma}^{B_{n}}(u,t) have nonnegative integer coefficients when ν\nu and γ\gamma are
half-integer dominant weights. This is not true in general when ν\nu and
γ\gamma are partitions or in type CnC_{n}.
(3)
In the following sections, we will often need to consider the previous
Hall-Littlewood polynomials but for the root system of rank mm and the associated
character ring in the indeterminates y=(y1,…,ym)y=(y_{1},\ldots,y_{m}) with the
deformation parameter qq instead of tt. This swap will be a consequence of
the dual Cauchy formula for Koornwinder polynomials (3).
As explained in Remark 2.3, in the forthcoming sections we will need
to swap the parameters qq and tt and also the ranks nn and mm in the
Koornwinder specializations; and next to specialize t=0t=0 to get unequal parameter
Hall-Littlewood polynomials in (u,t)(u,t). Table 6 contains the mentioned specializations.
Table 6. Specializations of the Koornwinder polynomials yielding (u,q)(u,q)
Hall-Littlewood polynomials in rank mm after swapping the ranks nn and mm
and also the indeterminates tt and qq and putting t=0t=0.
2.5. Weyl module characters and the t=0t=0 Macdonald specialization
Fix an affine root system of type TN(a)T_{N}^{(a)} with underlying classical root
system of type TnT_{n}. The goal of this paragraph is to establish the
following theorem which is crucial for our purposes.
Theorem 2.4.
For any dominant weight μ\mu of type TnT_{n}, we have
In fact this theorem can be obtained by combining various results already appearing in the literature. We are going to proceed in three steps.
2.5.1. Step 1: the affine root system TN(a)T_{N}^{(a)} is untwisted with
no dagger
In this case our theorem is exactly Corollary 7.11 in [30] (up to a slight
change of convention).
2.5.2. Step 2: the affine root system TN(a)T_{N}^{(a)} is of twisted type
with no dagger
Here we need a detour and consider some affine Demazure characters. Recall
first that the Demazure characters are the characters of modules associated
with the positive part Uν+(𝔤^)U_{\nu}^{+}(\widehat{\mathfrak{g}}\mathfrak{)} of
Uν(𝔤^)U_{\nu}(\widehat{\mathfrak{g}}\mathfrak{)}. For any dominant weight
Λ\Lambda and any element ww in WaW_{\mathrm{a}}, we have a Demazure Uν+(𝔤^)U_{\nu}^{+}(\widehat{\mathfrak{g}}\mathfrak{)}-module Vw(Λ)V_{w}(\Lambda) contained in
V(Λ)V(\Lambda) as a vector space. It also admits a crystal Bw(Λ)B_{w}(\Lambda)
contained in B(Λ)B(\Lambda) as a subgraph, which thus inherits the underlying degree
d\mathrm{d}. The general theory of Macdonald polynomials of simply laced
types (An(1)A_{n}^{(1)} and Dn(1)D_{n}^{(1)}) and twisted affine types permits to
interpret their specialization at t=0t=0 as certain Demazure characters of
irreducible highest weight modules associated with the affine root system
considered. Roughly speaking, this is done by setting q=e−δq=e^{-\delta}, that is,
by interpreting the dependence of the Demazure character on δ\delta as a
qq-grading. This crucial fact was proved in [16], to which we refer for
a more complete presentation.
Theorem 2.5.
Assume TN(a)T_{N}^{(a)} is simply laced or of twisted type with
no dagger. For any dominant weight μ\mu in P+P_{+}, there exists an affine
dominant weight Λ\Lambda and an element ww in WaW_{\mathrm{a}} such that
This interaction between the t=0t=0 Macdonald specialization and the Demazure
characters theory also has a deeper interpretation in terms of crystal graphs.
In the cases we are considering here, there is indeed a strong connection
between a tensor product of column shape KR crystals and a certain Demazure crystal
inside a highest weight crystals of level 11, that is, for dominant weights
Λ\Lambda which are affine fundamental weights. Here again, we only give
below a simplified version of a more precise theorem established in [38]
(see Theorem 7.4). Before stating this theorem, we should mention that it only
holds in the cases when the considered column KR crystals are perfect. This
quite technical assumption (see Definition 2.4 in [38]) is
satisfied when TN(a)T_{N}^{(a)} is simply laced or of twisted type and, in
particular, even if TN(a)T_{N}^{(a)} is of type Bn(1,†)B_{n}^{(1,{\dagger})}, A2n−1(2,†)A_{2n-1}^{(2,{\dagger})}, or A2n(2,†)A_{2n}^{(2,{\dagger})} (see [9]).
Theorem 2.6.
Assume that TN(a)T_{N}^{(a)} is simply laced or of twisted
type. Then, each tensor product BμB_{\mu} of perfect column KR crystals
admits a classical embedding111By a classical embedding, we mean a
graph embedding compatible with the classical crystal structure obtained by
removing the 00-arrows. in a level 11 Demazure crystal which is also a
bijection on the associated sets of vertices. Moreover, the energy on BB can
be normalized in such a way it becomes equal to the grading d\mathrm{d}
via this embedding.
We then derive our Theorem 2.4 by combining Theorems 2.5
and 2.6. As discussed above, for the simply laced untwisted types, this approach works without using the results of [30].
2.5.3. Step 3: the affine root system TN(a)T_{N}^{(a)} is of type
Bn(1,†)B_{n}^{(1,{\dagger})}, A2n−1(2,†)A_{2n-1}^{(2,{\dagger})}, or A2n(2,†)A_{2n}^{(2,{\dagger})}
Here we proceed as in Step 2. As already observed, Theorem 2.6 also
holds in these cases. The parameter specializations of the Koornwinder polynomials that
correspond to these TN(a)T_{N}^{(a)} are not part of Theorem 2.5 as stated in [16].
Nevertheless, the technique of intertwiner operators for double affine Hecke algebras (on which Theorem 2.5 is based) is
available for the full parameter Koornwinder polynomials (see, for example, [17, §2.6]), and, in particular, for the specializations relevant here. As in [16], the recursion given by the application of the intertwiner operators allows the identification of the t=u=0t=u=0 limit of the relevant specialized Koornwinder polynomials with the graded character of the level 1 affine Demazure module specified by Theorem 2.6, for TN(a)T_{N}^{(a)} of the type considered here. This allows us to establish the validity of Theorem 2.5, and consequently of Theorem 2.4, for TN(a)T_{N}^{(a)} of type
Bn(1,†)B_{n}^{(1,{\dagger})}, A2n−1(2,†)A_{2n-1}^{(2,{\dagger})}, or A2n(2,†)A_{2n}^{(2,{\dagger})}.
2.5.4. Connection with Weyl modules
Theorem 2.5 connecting the t=0t=0 specialization in Macdonald
polynomials with the affine Demazure characters does not hold for a general
untwisted non-simply laced affine root system. In fact the relevant general
context permitting to interpret these specializations as graded characters is
that of Weyl modules for current algebras. More precisely, in their study of
the category of finite-dimensional representations of quantum affine Lie
algebras Uν(𝔤^)U_{\nu}(\widehat{\mathfrak{g}}), Chari and Pressley
[3] defined some universal highest weight objects in this
category, called (local) Weyl modules. The Weyl modules are cyclic
indecomposable modules that play the role of standard objects in the category.
Any finite-dimensional cyclic indecomposable module is a quotient of a Weyl
module. The theory of Weyl modules transfers to the classical limit
ν→1\nu\rightarrow 1, where it becomes the theory of Weyl modules for current
algebras; here, they play the role of standard objects in the category of
finite-dimensional graded representations of the current algebra. The
grading of the current algebra representations arises from the action of the
scaling (sometimes called loop rotation) element in 𝔤^\widehat{\mathfrak{g}}
(see §2.1-2.3 in [4]). At the level of characters, the grading is
thus captured by the imaginary root δ\delta: a 𝔤^\widehat{\mathfrak{g}}-character is seen as a graded 𝔤\mathfrak{g}-character by denoting
q=eδq=e^{\delta}. If TN(a)T_{N}^{(a)} is twisted or simply laced untwisted, the
current algebra Weyl modules are precisely the symmetric (i.e. 𝔤\mathfrak{g}-stable) Demazure modules of V(Λ)V(\Lambda), for Λ\Lambda an affine dominant
weight of level one. Under the same constraint on TN(a)T_{N}^{(a)}, the graded
characters of symmetric level-one Demazure modules were shown to be precisely
the t=0t=0 specialization of the symmetric Macdonald polynomials of type
TN(a)T_{N}^{(a)} [16]. What is true without any constraint on TN(a)T_{N}^{(a)}
is that the t=0t=0 specializations of the symmetric Macdonald polynomials of
type TN(a)T_{N}^{(a)} are the graded characters of the Weyl modules of the
current algebra of type TN(a)T_{N}^{(a)}, see Theorem 4.2 in [4]. A series of
results, culminating with the work of Lenart-Naito-Sagaki-Schilling-Shimozono [30], shows that the Weyl modules have a graded crystal basis whose crystal is the tensor product of column KR-crystals; the energy function can be normalized so that it is identified with the grading.
To facilitate the identification of Weyl module characters from Koornwinder specializations
in the forthcoming sections, we illustrate the specialization at t=u=0t=u=0 in Table 8.
Table 8. Specializations of the Koornwinder polynomials yielding Weyl module characters.
3. Dual Cauchy identity and the X=KX=K phenomenon in type An−1(1)A_{n-1}^{(1)}
In this Section, we reprove the equality between Kostka-Foulkes polynomials (in type
OPENAm−1)A_{m-1}) for a pair of dominant weights of level nn (i.e. a pair of
partitions contained in the rectangle (nm)(n^{m})) and 1-d sums corresponding to
tensor product of mm column KR crystals of affine type An−1(1)A_{n-1}^{(1)}. This
result was initially obtained by Nakayashiki and Yamada [35] in a purely
combinatorial way from the description of the Kostka-Foulkes polynomials in terms of
Lascoux-Schützenberger’s charge on semistandard tableaux [23] and that
of 1-d sums as generating functions for the energy statistic on finite affine
crystals. In contrast the proof we propose here is based on the dual Cauchy
formula for symmetric Macdonald polynomials. In particular, it will be simpler
to work with the ring of symmetric functions rather than in the character ring
of 𝔰𝔩n\mathfrak{sl}_{n}. We refer the reader to the classical book of Macdonald
[32] for more details on the notions introduced in this section. It is
written to be be read quite independently of the rest of the paper and we hope
it will help the reader to understand the main ideas which will be reinvested
in the study of the X=KX=K phenomenon beyond type AA.
3.1. Symmetric polynomials and Macdonald polynomials
Let Sym[x1,…,xn]\mathrm{Sym}[x_{1},\ldots,x_{n}] the ring of symmetric polynomials over
the rational functions in ℚ[q,t]\mathbb{Q}[q,t] where qq and tt are two
indeterminates. We denote by 𝔖n\mathfrak{S}_{n} the symmetric group on the
set {1,…,n}\{1,\ldots,n\}. It acts on ℤn=⨁i=1nℤεi\mathbb{Z}^{n}={\textstyle\bigoplus\limits_{i=1}^{n}}\mathbb{Z\varepsilon}_{i} by permutation of the coordinates. A partition
λ\lambda of length at most nn is a sequence λ=(λ1≥⋯≥λn≥0)\lambda=(\lambda_{1}\geq\cdots\geq\lambda_{n}\geq 0) and will be identified with its Young diagram.
The length of λ\lambda is the number of its nonzero parts λi\lambda_{i}. We
denote by 𝒫n\mathcal{P}_{n} the set of partitions with length at most nn. The
orbits of the action of 𝔖n\mathfrak{S}_{n} on ℤn\mathbb{Z}^{n} are labelled by
the partitions of length at most nn. For any such partition λ\lambda, we
define the monomial symmetric function by
where 𝔖n⋅λ\mathfrak{S}_{n}\cdot\lambda is the orbit of λ\lambda under the
action of 𝔖n\mathfrak{S}_{n} on ℤn\mathbb{Z}^{n} (which so extends to
ℤ[x1,…,xn]\mathbb{Z}[x_{1},\ldots,x_{n}]) and for any β=(β1,…,βn)\beta=(\beta_{1},\ldots,\beta_{n}) in ℤn\mathbb{Z}^{n}, we have xβ=x1β1⋯xnβnx^{\beta}=x_{1}^{\beta_{1}}\cdots x_{n}^{\beta_{n}}. The family {mλ(x),λ∈𝒫n}\{m_{\lambda}(x),\lambda\in\mathcal{P}_{n}\}
is a basis of Sym[x1,…,xn]\mathrm{Sym}[x_{1},\ldots,x_{n}].
Now put ∂=(n−1,…,2,1)\partial=(n-1,\ldots,2,1). For any β\beta set
where ℓ\ell is the length function of 𝔖n\mathfrak{S}_{n}, that is the number
of elementary reflections si=(i,i+1)s_{i}=(i,i+1) appearing in any minimal length
decomposition of the permutation σ\sigma. For any λ\lambda in
𝒫n\mathcal{P}_{n}, define the Schur polynomial by
Then, the family {𝗌λ(x),λ∈𝒫n}\{\mathsf{s}_{\lambda}(x),\lambda\in\mathcal{P}_{n}\} is
another basis of Sym[x1,…,xn]\mathrm{Sym}[x_{1},\ldots,x_{n}]. The Kostka numbers are
such that
The Kostka number Kλ,μK_{\lambda,\mu} is in fact a nonnegative integer equal to
the dimension of the weight space of weight μ\mu in the finite-dimensional
irreducible representation of the Lie algebra 𝔤𝔩n(ℂ)\mathfrak{gl}_{n}(\mathbb{C)}
with highest weight λ\lambda (see [8] for an introduction on the
representation theory of Lie algebras). We can endow Sym[x1,…,xn]\mathrm{Sym}[x_{1},\ldots,x_{n}] with a pairing ⟨⋅,⋅⟩\langle\cdot,\cdot\rangle such that
⟨𝗌λ(x),𝗌μ(x)⟩n=δλ,μ\langle\mathsf{s}_{\lambda}(x),\mathsf{s}_{\mu}(x)\rangle_{n}=\delta_{\lambda,\mu} for any pair of partitions (λ,μ)(\lambda,\mu) in 𝒫n2\mathcal{P}_{n}^{2}.
The Hall-Littlewood polynomials can be regarded as tt-interpolations between
the monomials and the Schur polynomials. They are defined by
where 𝔖λ(t)=∑σ∈𝔖ntℓ(σ).\mathfrak{S}_{\lambda}(t)=\sum_{\sigma\in\mathfrak{S}_{n}}t^{\ell(\sigma)}. We thus have Pλ(x,0)=𝗌λ(x)P_{\lambda}(x,0)=\mathsf{s}_{\lambda}(x) and
Pλ(x,1)=mλ(x)P_{\lambda}(x,1)=m_{\lambda}(x) and in particular Kλ,μ(1)=Kλ,μK_{\lambda,\mu}(1)=K_{\lambda,\mu} for any λ,μ\lambda,\mu in 𝒫n\mathcal{P}_{n}. Although
this is not obvious on their definition, they are indeed polynomials and their
coefficients belong to ℤ[t].\mathbb{Z}[t]. They also yield a basis {Pλ(x,t),λ∈𝒫n}\{P_{\lambda}(x;t),\lambda\in\mathcal{P}_{n}\} of Sym[x1,…,xn]\mathrm{Sym}[x_{1},\ldots,x_{n}].
This permits to define the tt-Kostka-Foulkes polynomials by setting
Observe that both decompositions (5) and (6) are
unitriangular for the dominant order on 𝒫n\mathcal{P}_{n}. This means that we
have Kλ,λ(t)=Kλ,λ=1K_{\lambda,\lambda}(t)=K_{\lambda,\lambda}=1 and Kλ,μ(t)=0K_{\lambda,\mu}(t)=0
unless λ≥μ,\lambda\geq\mu, that is unless λ−μ\lambda-\mu in a nonnegative integer
combination of the simple roots αi=εi−εi+1\alpha_{i}=\varepsilon_{i}-\varepsilon_{i+1}
corresponding to the root system of type An−1A_{n-1}. Since both families of
Schur and Hall-Littlewood polynomials have coefficients in ℤ[t]\mathbb{Z}[t], the Kostka
polynomials also belong to ℤ[t]\mathbb{Z}[t]. In fact they have nonnegative
coefficients and we will see that among the many ways to prove this
fundamental result, one of them is to equate each Kostka-Foulkes polynomial with a 1-d
sum having by definition nonnegative integer coefficients as the generating
series of some particular vertices in affine crystals for the energy statistic.
The definition of the Macdonald polynomials is more involved. They can be
regarded as qq-deformations Pλ(x,q,t)P_{\lambda}(x;q,t) of the Hall-Littlewood polynomials
Pλ(x,t)P_{\lambda}(x;t) with λ\lambda in 𝒫n\mathcal{P}_{n}. In fact they are
defined as the unique basis of Sym[x1,…,xn]\mathrm{Sym}[x_{1},\ldots,x_{n}]
unitriangular on the monomial basis {mλ(x),λ∈𝒫n}\{m_{\lambda}(x),\lambda\in\mathcal{P}_{n}\} and satisfying the orthogonality condition ⟨Pλ(x,q,t),Pμ(x,q,t)⟩q,t=δλ,μ\langle P_{\lambda}(x;q,t),P_{\mu}(x;q,t)\rangle_{q,t}=\delta_{\lambda,\mu} where
⟨⋅,⋅⟩q,t\langle\cdot,\cdot\rangle_{q,t} is a (q,t)(q,t)-deformation of the previous
scalar product ⟨⋅,⋅⟩\langle\cdot,\cdot\rangle making orthonormal the basis of
Schur functions. We do not really need the very definition of the symmetric
Macdonald polynomials in what follows but rather some of their crucial
properties. In particular, for any partition λ\lambda in
𝒫n\mathcal{P}_{n} we have
that is, the Hall-Littlewood polynomials are the q=0q=0 specializations of the Macdonald
polynomials.
3.2. The dual Cauchy identity for Hall-Littlewood polynomials
Observe that for any partition λ\lambda in the rectangle (mn)(m^{n}), its
conjugate partition is in the rectangle (nm)(n^{m}). We recall the theorem by
Nakayashiki and Yamada.
Theorem 3.1.
For all λ,μ\lambda,\mu two partitions in the rectangle
(mn)(m^{n}), we have
where Xλ,μ(q)X_{\lambda,\mu}(q) is the column 1-d sum of type An−1(1)A_{n-1}^{(1)}
determined by the columns of the partition μ\mu (see Definition 1.2)
and Kλ′,μ′(q)K_{\lambda^{\prime},\mu^{\prime}}(q) the Kostka-Foulkes polynomial of type
Am−1A_{m-1} associated with the pair of partitions (λ′,μ′)(\lambda^{\prime},\mu^{\prime}).
Then, as explained in [32, Chapter VI, (2.7)(2.7)], any pair of bases
((uλ(x))λ⊆(mn),(vλ′)λ⊆(mn))\left(\,(u_{\lambda}(x))_{\lambda\subseteq(m^{n})}\,,\,(v_{\lambda^{\prime}})_{\lambda\subseteq(m^{n})}\,\right) verifying
(8)
⟨uλ,vμ′⟩=δλ,μ for any (λ,μ)in (mn)×(mn)\left\langle u_{\lambda},v_{\mu^{\prime}}\right\rangle=\delta_{\lambda,\mu}\text{ for any }(\lambda,\mu)\ \text{in }(m^{n})\times(m^{n})
and conversely. We can thus introduce the basis {𝖰λ(x,q)∣λ⊆(mn)}\{\mathsf{Q}_{\lambda}(x;q)\mid\lambda\subseteq(m^{n})\} such that
(10)
⟨𝖰λ(x;q),Pμ′(y,q⟩=δλ,μ for any (λ,μ)⊆(mn)×(mn)\left\langle\mathsf{Q}_{\lambda}(x;q),P_{\mu^{\prime}}(y,q\right\rangle=\delta_{\lambda,\mu}\text{ for any }(\lambda,\mu)\subseteq(m^{n})\times(m^{n})
One can observe here that, with the notation of Macdonald’s book, we have
𝖰μ(x,q)=ω(Qμ′(x,q))\mathsf{Q}_{\mu}(x;q)=\omega\left(Q_{\mu^{\prime}}(x;q)\right), i.e. the
polynomial 𝖰μ(x,q)\mathsf{Q}_{\mu}(x;q) is the just the image of the modified
Hall-Littlewood polynomial Qμ′(x,q)Q_{\mu}^{\prime}(x;q) under the involution
ω\omega in the ring of symmetric functions.
Lemma 3.2.
We have for any partition μ⊆(mn)\mu\subseteq(m^{n})
Now, we let tt tends to 00 in the above expression. According to Theorem
2.5, the polynomial Pλ(x,q,t)P_{\lambda}(x;q,t) on the left specializes
to the Demazure character Pλ(x,q,0)P_{\lambda}(x,q,0), whereas the polynomial on the
right specializes to the Hall-Littlewood Pλ′(y,q)P_{\lambda^{\prime}}(y,q). We thus obtain
We can now use Lemma 3.2 and Theorem 2.4 to get the
X=KX=K equality of Theorem 3.1, namely
Xλ,μ(q)=Kλ′,μ′(q) for any (λ,μ) in (mn)×(mn).X_{\lambda,\mu}(q)=K_{\lambda^{\prime},\mu^{\prime}}(q)\text{ for any
}(\lambda,\mu)\text{ in }(m^{n})\times(m^{n}).
4. Dual Cauchy identity and the X=KX=K phenomenon in type A2n−1(2)A_{2n-1}^{(2)}
In this section, we prove that the 1-d sums of level
mm and type A2n−1(2)A_{2n-1}^{(2)} coincide with the Lusztig qq-analogues of type
CmC_{m} indexed by pairs of partitions in the rectangle (nm)(n^{m}).
4.1. Duality and main theorem
Let λ,μ⊆(mn)\lambda,\mu\subseteq(m^{n}). Recall the following notation.
•
Xλ,μA2n−1(2)(q)X_{\lambda,\mu}^{A_{2n-1}^{(2)}}(q) is the one-dimensional sum associated
with the dominant weight λ\lambda of the affine crystal B(μ1′,1)⊗⋯⊗B(μm′,1)B^{(\mu_{1}^{\prime},1)}\otimes\cdots\otimes B^{(\mu_{m}^{\prime},1)}. Here B(k,1)B^{(k,1)} denotes
the KR crystal of type A2n−1(2)A_{2n-1}^{(2)} and column shape of height kk. By
removing the 00-arrows in B(k,1)B^{(k,1)}, we get a type CnC_{n}-crystal
isomorphic to the sum
where B(ω0)=B(0)B(\omega_{0})=B(0) is the crystal of the trivial representation (one
vertex with no arrow).
•
Kλ^,μ^Cm(q)K_{\widehat{\lambda},\widehat{\mu}}^{C_{m}}(q) is the Kostka-Foulkes polynomial
of type CmC_{m} associated with the partitions λ^\widehat{\lambda} and μ^\widehat{\mu}.
The goal of this section is to establish the following theorem.
Theorem 4.1.
For all λ,μ⊆(mn)\lambda,\mu\subseteq(m^{n}), we have
This will be done by replacing the dual Cauchy identity on Macdonald
polynomial by a relevant specialization in the dual Cauchy identity for
Koornwinder polynomials. When q=1q=1, observe this is just the usual
Cn×CmC_{n}\times C_{m} Howe duality between multiplicities in tensor product of
kk-wedges product of ℂn\mathbb{C}^{n} and weight multiplicities in
irreducible representations of 𝔰𝔭2m\mathfrak{sp}_{2m}, see [14].
Remark 4.2.
As explained in [10], there is a simple duality between King tableaux of type CmC_{m} and tensor products of mm type CmC_{m} columns given highest weight vertices. From Theorem 4.1, it becomes then natural to define the symplectic charge of a King tableau as the energy of its associated tensor product of columns. This yields an analogue of Lascoux-Schützenberger’s description [23] of the usual Kostka-Foulkes polynomials in terms of semistandard tableaux.
4.2. The symplectic dual Cauchy identity
Recall that x=(x1,…,xn)x=(x_{1},\ldots,x_{n}) and y=(y1,…,ym)y=(y_{1},\ldots,y_{m}) are two sets
of indeterminates. Also sλCn(x)s_{\lambda}^{C_{n}}(x) is the Weyl character of type
CnC_{n} associated with the partition λ⊆(mn)\lambda\subseteq(m^{n}). There exists
a type CC analogue of the (dual) Cauchy identity, that can be found in
[22], namely
Let char≤mCn(x)\mathrm{char}_{\leq m}^{C_{n}}(x) and char≤nCm(y)\mathrm{char}_{\leq n}^{C_{m}}(y) be the subspaces of the character ring of type CnC_{n} and CmC_{m} with
basis {sλCn(x)∣λ⊆(mn)}\{s_{\lambda}^{C_{n}}(x)\mid\lambda\subseteq(m^{n})\} and {sλ^Cm(y)∣λ⊆(mn)}\{s_{\widehat{\lambda}}^{C_{m}}(y)\mid\lambda\subseteq(m^{n})\}, respectively. Denote by
⟨.,.⟩Cn×Cm\left\langle.,.\right\rangle_{C_{n}\times C_{m}} the pairing on
char≤mCn(x)×char≤nCm(y)\mathrm{char}_{\leq m}^{C_{n}}(x)\times\mathrm{char}_{\leq n}^{C_{m}}(y)
such that ⟨sλCn,sμ^Cm⟩Cn×Cm=δλ,μ\langle s_{\lambda}^{C_{n}},s_{\widehat{\mu}}^{C_{m}}\rangle_{C_{n}\times C_{m}}=\delta_{\lambda,\mu} for all λ,μ⊆(mn)\lambda,\mu\subseteq(m^{n}).
Similarly to (8), any pair of bases
4.3. Symplectic dual Cauchy identity for Hall-Littlewood polynomials
Let {𝖰μCn(x,q),μ⊆(mn)}\{\mathsf{Q}_{\mu}^{C_{n}}(x;q),\mu\subseteq(m^{n})\} be the dual basis of
the Hall-Littlewood basis {Pμ^Cm(y,q)∣μ⊆(mn)}\{P_{\widehat{\mu}}^{C_{m}}(y;q)\mid\mu\subseteq(m^{n})\} for the previous ⟨.,.⟩Cn×Cm\left\langle.,.\right\rangle_{C_{n}\times C_{m}}-pairing. By the previous arguments, we have
Now, in view of proving Theorem4.1, we specialize the parameters in
order to obtain a type A2n−1(2)A_{2n-1}^{(2)} Macdonald polynomial as the left
polynomial in (3). Recall that PμA2n−1(2)(x,q,t)P_{\mu}^{A_{2n-1}^{(2)}}(x;q,t) is the Macdonald polynomial of type A2n−1(2)A_{2n-1}^{(2)} (with u=tu=t),
we obtain the following relation by 4:
is a Demazure character of type A2n−1(2)A_{2n-1}^{(2)} by Theorem 2.5.
On the other hand, note that the polynomial on the right Pλ^(y,t12,−t12,q12,−q12,t,q)P_{\widehat{\lambda}}(y;t^{\frac{1}{2}},-t^{\frac{1}{2}},q^{\frac{1}{2}},-q^{\frac{1}{2}};t,q)
does not quite yield a Macdonald polynomial, but we have nevertheless
where Pμ^Cm(y,q)P_{\widehat{\mu}}^{C_{m}}(y;q) is the Hall-Littlewood polynomial of type
Cm.C_{m}. Therefore, taking the limit t→0t\rightarrow 0 in (15)
yields the identity
Indeed, the transfer matrix between the basis of Hall-Littlewood polynomials
Pμ^Cm(y,q)P_{\widehat{\mu}}^{C_{m}}(y;q) and that of the Weyl characters sλ^Cm(y)s_{\widehat{\lambda}}^{C_{m}}(y) is (Kλ^,μ^Cm(q))−1(K_{\widehat{\lambda},\widehat{\mu}}^{C_{m}}(q))^{-1}, the inverse of the
matrix whose coefficients are the Lusztig qq-analogues of type CmC_{m}. Since Kλ^,μ^Cm(q)≠0K_{\widehat{\lambda},\widehat{\mu}}^{C_{m}}(q)\neq 0 only when |λ^|=|μ^|mod2\left|\widehat{\lambda}\right|=\left|\widehat{\mu}\right|\operatorname{mod}2, the decomposition of each polynomial Pμ^Cm(y,q)P_{\widehat{\mu}}^{C_{m}}(y;q) in the
basis of Weyl characters makes appear nonzero coefficients only for the
sλ^Cm(y)s_{\widehat{\lambda}}^{C_{m}}(y)’s with |λ^|=|μ^|mod2\left|\widehat{\lambda}\right|=\left|\widehat{\mu}\right|\operatorname{mod}2. Now, we have for any
such character sλ^Cm(−y)=(−1)|λ^|sλ^Cm(−y)s_{\widehat{\lambda}}^{C_{m}}(-y)=(-1)^{\left|\widehat{\lambda}\right|}s_{\widehat{\lambda}}^{C_{m}}(-y) and therefore also Pμ^Cm(−y,q)=(−1)|λ^|Pμ^Cm(y,q)P_{\widehat{\mu}}^{C_{m}}(-y;q)=(-1)^{\left|\widehat{\lambda}\right|}P_{\widehat{\mu}}^{C_{m}}(y;q).
Remark 4.3.
Observe we will also have sλ^Dm(−y)=(−1)|λ^|sλ^Dm(−y)s_{\widehat{\lambda}}^{D_{m}}(-y)=(-1)^{\left|\widehat{\lambda}\right|}s_{\widehat{\lambda}}^{D_{m}}(-y) for the Weyl
characters of type DmD_{m} parametrized by a partition but a similar
identities does not hold in type BmB_{m}.
Comparing (15) and (18), we deduce the equality
𝖰μCn(x,q)=PμA2n−1(2)(x,q,0)\mathsf{Q}_{\mu}^{C_{n}}(x;q)=P_{\mu}^{A_{2n-1}^{(2)}}(x;q,0) for any
μ⊆(mn)\mu\subseteq(m^{n}). This concludes the proof of Theorem 4.1 by
using (16) and Theorem 2.4, since for any
μ⊆(mn)\mu\subseteq(m^{n}) we have
5. Dual Cauchy identity and the X=KX=K phenomenon in type A2n−1(2,†)A_{2n-1}^{(2,\dagger)}
We now prove that the 1-d sums of level mm and type A2n−1(2,†)A_{2n-1}^{(2,\dagger)}
coincide with the Lusztig qq-analogues of type DmD_{m} indexed by pairs of
partitions in the rectangle (nm)(n^{m}). Let λ,μ⊆(mn)\lambda,\mu\subseteq(m^{n}). Recall the following notation.
•
Xλ,μA2n−1(2,†)(q)X_{\lambda,\mu}^{A_{2n-1}^{(2,\dagger)}}(q) is the one-dimensional sum
associated with the dominant weight λ\lambda of the Kirillov-Reshetikhin
crystal B(μ1′,1)⊗⋯⊗B(μm′,1)B^{(\mu_{1}^{\prime},1)}\otimes\cdots\otimes B^{(\mu_{m}^{\prime},1)}. Here B(k,1)B^{(k,1)} denotes the KR crystal of type A2n−1(2,†)A_{2n-1}^{(2,\dagger)} and column shape of height kk. By removing the 00-arrows in B(k,1)B^{(k,1)},
we get a connected type DnD_{n}-crystal isomorphic to
{B(ωk) if 0≤k≤n−2B(ωn+ωn−1) if k=n−1B(2ωn) if k=n.\left\{\begin{array}[c]{l}B(\omega_{k})\text{ if }0\leq k\leq n-2\\
B(\omega_{n}+\omega_{n-1})\text{ if }k=n-1\\
B(2\omega_{n})\text{ if }k=n.\end{array}\right.
•
Kλ^,μ^Dm(q)K_{\widehat{\lambda},\widehat{\mu}}^{D_{m}}(q) is the Kostka-Foulkes polynomial
of type DmD_{m} associated with the partitions λ^\widehat{\lambda} and μ^\widehat{\mu}.
The goal of this section is to establish the following theorem.
Theorem 5.1.
For all λ,μ⊆(mn)\lambda,\mu\subseteq(m^{n}), we have
When q=1q=1, observe this is just the usual Dn×DmD_{n}\times D_{m} Howe duality
between multiplicities in tensor product of kk-wedges product of
ℂn\mathbb{C}^{n} and weight multiplicities in irreducible representations of
𝔬2m\mathfrak{o}_{2m}, see [14].
The proof follows essentially the same line as for the equality Xλ,μA2n−1(2)(q)=Kλ^,μ^Cm(q)X_{\lambda,\mu}^{A_{2n-1}^{(2)}}(q)=K_{\widehat{\lambda},\widehat{\mu}}^{C_{m}}(q) detailed in
the previous section. We have this time the dual Cauchy identity
for which we refer to Proposition 5 in [12]. Let char≤mDn(x)\mathrm{char}_{\leq m}^{D_{n}}(x) and char≤nDm(y)\mathrm{char}_{\leq n}^{D_{m}}(y) be the subspaces of the
character ring of type DnD_{n} and DmD_{m} with basis {sλDn(x)∣λ⊆(mn)}\{s_{\lambda}^{D_{n}}(x)\mid\lambda\subseteq(m^{n})\} and {sλ^Dm(y)∣λ⊆(mn)}\{s_{\widehat{\lambda}}^{D_{m}}(y)\mid\lambda\subseteq(m^{n})\}, respectively. Denote by ⟨.,.⟩Dn×Dm\left\langle.,.\right\rangle_{D_{n}\times D_{m}} the pairing on char≤mDn(x)×char≤nDm(y)\mathrm{char}_{\leq m}^{D_{n}}(x)\times\mathrm{char}_{\leq n}^{D_{m}}(y) such that ⟨sλDn,sμ^Dm⟩Dn×Dm=δλ,μ\langle s_{\lambda}^{D_{n}},s_{\widehat{\mu}}^{D_{m}}\rangle_{D_{n}\times D_{m}}=\delta_{\lambda,\mu} for all λ,μ⊆(mn)\lambda,\mu\subseteq(m^{n}).
Let {𝖰μDn(x,q),μ⊆(mn)}\{\mathsf{Q}_{\mu}^{D_{n}}(x,q),\mu\subseteq(m^{n})\} be the dual basis of
the Hall-Littlewood basis {Pμ^Dm(y,q)∣μ⊆(mn)}\{P_{\widehat{\mu}}^{D_{m}}(y,q)\mid\mu\subseteq(m^{n})\} for the previous ⟨.,.⟩Dn×Dm\left\langle.,.\right\rangle_{D_{n}\times D_{m}}-pairing. We get this time
We now specialize the parameters in order to obtain a type A2n−1(2,†)A_{2n-1}^{(2,\dagger)} Macdonald polynomial as the left polynomial in
(3). Recalling that PμA2n−1(2,†)(x,q,t)P_{\mu}^{A_{2n-1}^{(2,\dagger)}}(x;q,t) is
the Macdonald polynomial of type A2n−1(2,†)A_{2n-1}^{(2,\dagger)}, we obtain
is a Demazure character of type A2n−1(2,†)A_{2n-1}^{(2,\dagger)} by Theorem
2.5. For the polynomial Pμ^(y,1,−1,q12t12,−q12t12,t,q)P_{\widehat{\mu}}(y;1,-1,q^{\frac{1}{2}}t^{\frac{1}{2}},-q^{\frac{1}{2}}t^{\frac{1}{2}};t,q) we obtain
𝖰μDm(x;q)=PμA2n−1(2,†)(x;q,0) for any μ⊆(mn).\mathsf{Q}_{\mu}^{D_{m}}(x;q)=P_{\mu}^{A_{2n-1}^{(2,\dagger)}}(x;q,0)\text{
for any }\mu\subseteq(m^{n}).
As in the type A2n−1(2)A_{2n-1}^{(2)}-case, this concludes the proof of Theorem
5.1 by using (21) and Theorem 2.4.
6. Double deformation of weight multiplicities and the X=KX=K phenomenon
in types A2n(2)A_{2n}^{(2)} and Dn+1(2)D_{n+1}^{(2)}
6.1. Weyl characters of types BmB_{m} and CmC_{m}
Let us compare in this paragraph the Weyl characters of types BmB_{m} and
CmC_{m} respectively for half-integers and integer dominant weights. Recall
first that
By transforming sλ^Cm(y)s_{\widehat{\lambda}}^{C_{m}}(y) according to (22),
one obtains the following Cauchy identity for types Cn×BmC_{n}\times B_{m}
6.2. Type Cn×BmC_{n}\times B_{m} Cauchy identity for the unequal-parameter Hall-Littlewood polynomials
In order to equate more 1-d sums to deformations of weight multiplicities, we
need to use a two-parameter deformation of weight multiplicities of type
BmB_{m}, in uu (associated with the short roots εi,i=1,…,m\varepsilon_{i},i=1,\ldots,m) and qq (associated with the long roots εi±εj,1≤i<j≤n\varepsilon_{i}\pm\varepsilon_{j},1\leq i<j\leq n). Let us first start with a result
establish by Rains and Warnaar equating the unequal parameter Hall-Littlewood polynomials
to Koornwinder specializations (see Lemma 2.3 in [37]).
Proposition 6.1.
For any partition λ\lambda contained in the rectangle
(nm)(n^{m}), we have
One can observe that the second equality also follows from our specialization
Table 4 and the consideration exposed in § 2.4. Let char≤nBm,half(y)\mathrm{char}_{\leq n}^{B_{m},\mathrm{half}}(y) be the subspace of
the character ring of type BmB_{m} with basis {sλ^+ωm,λ⊆(mn)}\{s_{\widehat{\lambda}+\omega_{m}},\lambda\subseteq(m^{n})\}. We can introduce a paring on char≤mCn(x)×char≤nBm,half(y)\mathrm{char}_{\leq m}^{C_{n}}(x)\times\mathrm{char}_{\leq n}^{B_{m},\mathrm{half}}(y) such that
⟨sμCn,sλ^+ωmBm⟩Cn×Bm=δλ,μ\langle s_{\mu}^{C_{n}},s_{\widehat{\lambda}+\omega_{m}}^{B_{m}}\rangle_{C_{n}\times B_{m}}=\delta_{\lambda,\mu}. Let 𝖰~μCn(x,u,q)\mathsf{\tilde{Q}}_{\mu}^{C_{n}}(x,u,q) be the dual polynomial of the Hall-Littlewood polynomial
Pμ^+ωmBm(y,u,q)P_{\widehat{\mu}+\omega_{m}}^{B_{m}}(y,u,q) for this pairing. We then have
Then, set u=−p,u=-p,q=p2q=p^{2} and consider the specialization
(−x,a,b,c,d,q,t)=(−x,0,−p,0,0,0,p2,0)(-x;a,b,c,d;q,t)=(-x;0,-p,0,0,0;p^{2},0) in the previous equality. It makes
appear the polynomials
which, up to sign flip x↔−xx\leftrightarrow-x, are Demazure characters of type
A2n(2)A_{2n}^{(2)} by the specialization Table 4 in which we have
to replace q1/2q^{1/2} by pp, that is Demazure characters of type A2n(2)A_{2n}^{(2)} evaluated in p2p^{2} instead of qq. Since 𝖰~μCn(x,−p,p2)\mathsf{\tilde{Q}}_{\mu}^{C_{n}}(x;-p,p^{2}) is the dual polynomial of the Hall-Littlewood
polynomial Pμ^+ωmBm(y,−p,p2)P_{\widehat{\mu}+\omega_{m}}^{B_{m}}(y,-p,p^{2}) for the pairing
⟨⋅,⋅⟩Cn×Bm\langle\cdot,\cdot\rangle_{C_{n}\times B_{m}}, and we have
But since we have for any Weyl character of type CnC_{n} the identity
sλCn(−x)=(−1)|μ|sλCn(x)s_{\lambda}^{C_{n}}(-x)=(-1)^{\left|\mu\right|}s_{\lambda}^{C_{n}}(x), we can drop the signs in the set of variables xx and get
Then Theorem 2.5 tells us that (−1)|λ|+|μ|Kλ^+ωm,μ^+ωmBm(−p,p2)(-1)^{\left|\lambda\right|+\left|\mu\right|}K_{\widehat{\lambda}+\omega_{m},\widehat{\mu}+\omega_{m}}^{B_{m}}(-p,p^{2}) is a 1-d sum of type A2n(2)A_{2n}^{(2)} evaluated
in p2p^{2} instead of qq. At first glance, the signs seem problematic but in
fact they simplify as we will now explain.
Let us establish the lemma below
Lemma 6.2.
In the polynomials Kλ^+ωm,μ^+ωmBm(p,p2)K_{\widehat{\lambda}+\omega_{m},\widehat{\mu}+\omega_{m}}^{B_{m}}(p,p^{2}), all the powers pkp^{k} which appear are even (resp. odd) when
|λ^|−|μ^|\left|\widehat{\lambda}\right|-\left|\widehat{\mu}\right| is
even (resp. odd).
Proof.
Observe first that for the (p,p2)(p,p^{2})-partition function 𝒫p,p2Bn\mathcal{P}_{p,p^{2}}^{B_{n}}, the polynomial 𝒫p,p2Bn(β),β∈ℤn\mathcal{P}_{p,p^{2}}^{B_{n}}(\beta),\beta\in\mathbb{Z}^{n} has a partity equal to that of |β|=β1+⋯+βn\left|\beta\right|=\beta_{1}+\cdots+\beta_{n}. The lemma follows because for any element ww in the Weyl group of type BmB_{m}, the parity of the integer |w(λ^+ωm)−(μ^+ωm)|\left|w(\widehat{\lambda}+\omega_{m})-(\widehat{\mu}+\omega_{m})\right| is equal to that of |λ^−μ^|\left|\widehat{\lambda}-\widehat{\mu}\right|.
∎
This is eventually the modified Kostka-Foulkes polynomial Kλ^+ωm,μ^+ωmBm(p,p2)K_{\widehat{\lambda}+\omega_{m},\widehat{\mu}+\omega_{m}}^{B_{m}}(p,p^{2}), which is a 1-d sum of
type A2n(2)A_{2n}^{(2)} evaluated in p2p^{2}.
Let λ,μ⊆(mn)\lambda,\mu\subseteq(m^{n}). We denote by Xλ,μA2n(2)(q)X_{\lambda,\mu}^{A_{2n}^{(2)}}(q) the one-dimensional sum associated with the dominant weight
λ\lambda of the Kirillov-Reshetikhin crystal B(μ1′,1)⊗⋯⊗B(μm′,1)B^{(\mu_{1}^{\prime},1)}\otimes\cdots\otimes B^{(\mu_{m}^{\prime},1)}. Here B(k,1)B^{(k,1)} denotes the
KR crystal of type A2n−1(2)A_{2n-1}^{(2)} and column shape of height kk. By
removing the 00-arrows in B(k,1)B^{(k,1)}, we get a type CnC_{n}-crystal
isomorphic to the sum
One may observe here (and similarly in the other analogous results that will be obtained in the forthcoming sections), that when p=1p=1, we get a Howe-type duality between tensor product multiplicities of type CnC_{n} and weight multiplicities of type BmB_{m}
Example 6.5.
Assume n=m=3n=m=3 and put λ^+ωm=(5/2,3/2,1/2)\widehat{\lambda}+\omega_{m}=(5/2,3/2,1/2)μ^+ωm=(1/2,1/2,1/2)\widehat{\mu}+\omega_{m}=(1/2,1/2,1/2). We get
Then we have μ=(3,3,3)\mu=(3,3,3) and λ=(2,1,0)\lambda=(2,1,0). This polynomial is the
A6(2)A_{6}^{(2)} 1-d sum corresponding to the graded multiplicity of λ\lambda in
the tensor product of 33-KR column crystals of height 33.
is the Hall-Littlewood polynomial of type BmB_{m} associated with the half-integer weight
λ^+ωm\widehat{\lambda}+\omega_{m}. We can yet prove that we have
where the polynomials Kλ^+ωm,μ^+ωmBm(q)K_{\widehat{\lambda}+\omega_{m},\widehat{\mu}+\omega_{m}}^{B_{m}}(q) are the ordinary one-parameter Lusztig qq-analogues. But then,
the polynomial Pλ(−x,q,0,0,0,q,0)P_{\lambda}(-x;q,0,0,0;q,0) is not a Demazure character of
type A2n(2)A_{2n}^{(2)} since they come from the Koornwinder specialization
Hence we cannot claim that the 1-d sums of type A2n(2)A_{2n}^{(2)} coincide with
the one-parameter KF polynomials of type BmB_{m} and half weight (although
they do at q=1q=1). Also the polynomials (−1)|μ|+|λ|Kλ^+ωm,μ^+ωmBm(q)(-1)^{\left|\mu\right|+\left|\lambda\right|}K_{\widehat{\lambda}+\omega_{m},\widehat{\mu}+\omega_{m}}^{B_{m}}(q) have not nonnegative integer coefficients in general.
6.4. The X=KX=K phenomenon in type Dn+1(2)D_{n+1}^{(2)}
The ideas are quite similar as in the A2n(2)A_{2n}^{(2)} case. We will see that
the 1-d sum then equates to two-parameter KF polynomials of type BmB_{m} but
parametrized this time by partitions. There are nevertheless important
differences. We write the Mimachi formula (3) as follows:
and we use this time the specialization (x,a,b,c,d,q,t)=(x,u,−1,0,0,q,t)(x;a,b,c,d;q,t)=(x;u,-1,0,0;q,t),
which by Proposition 6.1 gives the two-parameter Hall-Littlewood polynomial of
type BmB_{m}
Let char≤nBm(y)\mathrm{char}_{\leq n}^{B_{m}}(y) (resp. Let char≤mBm(x)\mathrm{char}_{\leq m}^{B_{m}}(x)) be the subspace of the character ring of type BmB_{m} (resp.
BnB_{n}) with basis {sλ^(y),λ⊆(mn)}\{s_{\widehat{\lambda}}(y),\lambda\subseteq(m^{n})\} (resp.
{sλ(x),λ⊆(mn)}\{s_{\lambda}(x),\lambda\subseteq(m^{n})\}). We can consider the pairing on
char≤mBn(x)×char≤nBm(y)\mathrm{char}_{\leq m}^{B_{n}}(x)\times\mathrm{char}_{\leq n}^{B_{m}}(y)
such that ⟨sμBn,sλ^Bm⟩Bn×Bm=(−1)|λ|δλ,μ\langle s_{\mu}^{B_{n}},s_{\widehat{\lambda}}^{B_{m}}\rangle_{B_{n}\times B_{m}}=(-1)^{\left|\lambda\right|}\delta_{\lambda,\mu}. Observe we use here a pairing with the two sides of type BB. Let
𝖰~μBn(x,u,q)\mathsf{\tilde{Q}}_{\mu}^{B_{n}}(x;u,q) be the dual polynomial of the
Hall-Littlewood polynomial Pμ^Bm(y,u,q)P_{\widehat{\mu}}^{B_{m}}(y;u,q) for this pairing.
That is
Now according to our specialization Table 4, by setting u=−pu=-p
and q=p2q=p^{2} we get from (28) that that Pμ(x,−p,−1,0,0,p2,0)P_{\mu}(x,-p,-1,0,0;p^{2},0) is a Demazure character of type Dn+1(2)D_{n+1}^{(2)}.
Recall that Xλ,μDn+1(2)(q)X_{\lambda,\mu}^{D_{n+1}^{(2)}}(q) the one-dimensional sum of
type Dn+1(2)D_{n+1}^{(2)} associated with the tensor product of columns defined by
μ\mu (with mm columns) and the weight λ\lambda. Here the column KR crystals
B(k,1)B^{(k,1)} of type Dn+1(2)D_{n+1}^{(2)} have a classical structure (obtained by
removing the 00-arrows) of type BnB_{n} isomorphic to
In particular. the 1-d sums of type Dn+1(2)D_{n+1}^{(2)} are signed KF
polynomials for the unequal parameters −p-p and p2p^{2}.
Remark 6.8.
We cannot simplify the signs appearing in the expressions
(−1)|λ^|+|μ^|Kλ^,μ^Bm(−p,p2)(-1)^{\left|\widehat{\lambda}\right|+\left|\widehat{\mu}\right|}K_{\widehat{\lambda},\widehat{\mu}}^{B_{m}}(-p,p^{2}) to make appear the polynomials Kλ^,μ^Bm(p,p2)K_{\widehat{\lambda},\widehat{\mu}}^{B_{m}}(p,p^{2}). This is coherent with the fact that these last
polynomials do not have nonnegative coefficients in general for λ^,μ^\widehat{\lambda},\widehat{\mu} two partitions (this is nevertheless the case with half-integer
weights as explained previously).
7. The X=KX=K phenomenon in type A2n(2,†)A_{2n}^{(2,\dagger)} and type DmD_{m}
Kostka-Foulkes polynomials for half-integer weights
To connect the type DmD_{m} Lusztig qq-analogues of type DmD_{m} and half
integer weights with some 1-d sum, the idea is to consider the previous identity
Now when u=0u=0, 𝒫0,q=𝒫qDm\mathcal{P}_{0,q}=\mathcal{P}_{q}^{D_{m}} is the qq-Kostant
partition function of type DmD_{m}. Moreover we have WBm=WDm⨆WDmsεmW_{B_{m}}=W_{D_{m}}{\textstyle\bigsqcup}W_{D_{m}}s_{\varepsilon_{m}} where ι=sεm\iota=s_{\varepsilon_{m}} acts on
ℤm\mathbb{Z}^{m} by changing the sign of the last coordinate. Also for any
ww in WDm,W_{D_{m}}, one has (−1)ℓBm(w)=(−1)ℓDm(w)(-1)^{\ell_{B_{m}}(w)}=(-1)^{\ell_{D_{m}}(w)}. Finally ρBm=ρDm+(1/2)m\rho_{B_{m}}=\rho_{D_{m}}+(1/2)^{m}. This thus gives
where ι\iota is the involution of the weight lattice induced by the type
DmD_{m} Dynkin diagram automorphism permuting the nodes mm and m−1m-1 (it
changes the sign of the last coordinates of the weights). Alternatively, we
also have
because 𝒫Dm(β)=𝒫Dm(ι(β))\mathcal{P}^{D_{m}}(\beta)=\mathcal{P}^{D_{m}}(\iota(\beta)).
In fact this difference simplifies. To see this, recall that β∈ℤm\beta\in\mathbb{Z}^{m} belongs to the set Q+DmQ_{+}^{D_{m}} of nonnegative
combinations of positive roots of type DmD_{m} if and only if β1+⋯+βi≥0\beta_{1}+\cdots+\beta_{i}\geq 0 for any i=1,…,mi=1,\ldots,m and |β|=β1+⋯+βm\left|\beta\right|=\beta_{1}+\cdots+\beta_{m} is even. Assume Kλ^+(1/2)m,μ^+(1/2)mDm(q)≠0K_{\widehat{\lambda}+(1/2)^{m},\widehat{\mu}+(1/2)^{m}}^{D_{m}}(q)\neq 0. Then λ^+(1/2)m−(μ^+(1/2)m)\widehat{\lambda}+(1/2)^{m}-(\widehat{\mu}+(1/2)^{m}) belongs to Q+DmQ_{+}^{D_{m}} and therefore
|λ^|−|μ^|\left|\widehat{\lambda}\right|-\left|\widehat{\mu}\right| is
even. But now λ^+(1/2)m−ι(μ^+(1/2)m)=|λ^|−|μ^|+2μ^m+1\widehat{\lambda}+(1/2)^{m}-\iota(\widehat{\mu}+(1/2)^{m})=\left|\widehat{\lambda}\right|-\left|\widehat{\mu}\right|+2\widehat{\mu}_{m}+1 is odd
therefore Kλ^+(1/2)m,ι(μ^+(1/2)m)Dm(q)=0K_{\widehat{\lambda}+(1/2)^{m},\iota(\widehat{\mu}+(1/2)^{m})}^{D_{m}}(q)=0. Similarly, when Kλ^+(1/2)m,ι(μ^+(1/2)m)Dm(q)≠0K_{\widehat{\lambda}+(1/2)^{m},\iota(\widehat{\mu}+(1/2)^{m})}^{D_{m}}(q)\neq 0, then Kλ^+(1/2)m,μ^+(1/2)mDm(q)=0K_{\widehat{\lambda}+(1/2)^{m},\widehat{\mu}+(1/2)^{m}}^{D_{m}}(q)=0. Finally, we have
Kλ^,μ^Bm(0,q)={Kλ^+(1/2)m,μ^+(1/2)mDm(q) when |λ^|−|μ^| is even,−Kλ^+(1/2)m,ι(μ^+(1/2)m)Dm(q)when |λ^|−|μ^| is odd,K_{\widehat{\lambda},\widehat{\mu}}^{B_{m}}(0,q)=\left\{\begin{array}[c]{c}K_{\widehat{\lambda}+(1/2)^{m},\widehat{\mu}+(1/2)^{m}}^{D_{m}}(q)\text{ when
}\left|\widehat{\lambda}\right|-\left|\widehat{\mu}\right|\text{
is even,}\\
-K_{\widehat{\lambda}+(1/2)^{m},\iota(\widehat{\mu}+(1/2)^{m})}^{D_{m}}(q)\text{when
}\left|\widehat{\lambda}\right|-\left|\widehat{\mu}\right|\text{
is odd,}\end{array}\right.
so that
(−1)|λ|+|μ|Kλ^,μ^Bm(0,q)={Kλ^+(1/2)m,μ^+(1/2)mDm(q) when |λ^|−|μ^| is even,Kλ^+(1/2)m,ι(μ^+(1/2)m)Dm(q)when |λ^|−|μ^| is odd.(-1)^{\left|\lambda\right|+\left|\mu\right|}K_{\widehat{\lambda},\widehat{\mu}}^{B_{m}}(0,q)=\left\{\begin{array}[c]{c}K_{\widehat{\lambda}+(1/2)^{m},\widehat{\mu}+(1/2)^{m}}^{D_{m}}(q)\text{ when
}\left|\widehat{\lambda}\right|-\left|\widehat{\mu}\right|\text{
is even,}\\
K_{\widehat{\lambda}+(1/2)^{m},\iota(\widehat{\mu}+(1/2)^{m})}^{D_{m}}(q)\text{when
}\left|\widehat{\lambda}\right|-\left|\widehat{\mu}\right|\text{
is odd.}\end{array}\right.
According to our specialization table 4, the polynomial
Pμ(x,0,−1,0,0,0,0)P_{\mu}(x;0,-1,0,0;0,0) is an affine Demazure character of type
A2n(2,†)A_{2n}^{(2,\dagger)}. Observe here the difference compared to the case of half-integer weights in type BmB_{m}.
Denote by Xλ,μA2n(2,†)(q)X_{\lambda,\mu}^{A_{2n}^{(2,\dagger)}}(q) the one-dimensional sum
of type A2n(2,†)A_{2n}^{(2,\dagger)} associated with the tensor product of columns
defined by μ\mu (with mm columns) and the weight λ\lambda. Here the column
KR crystals B(k,1)B^{(k,1)} of type A2n(2,†)A_{2n}^{(2,\dagger)} have a classical
structure (obtained by removing the 00-arrows) of type BnB_{n} isomorphic to
the connected crystal B(ωk)B(\omega_{k}). We have proved the following theorem
Theorem 7.1.
For any pair of partitions λ,μ\lambda,\mu in the rectangle (nm)(n^{m}), we have
Xλ,μA2n(2,†)(q)={Kλ^+(1/2)m,μ^+(1/2)mDm(q) when |λ^|−|μ^| is even,Kλ^+(1/2)m,ι(μ^+(1/2)m)Dm(q) when |λ^|−|μ^| is odd.X_{\lambda,\mu}^{A_{2n}^{(2,\dagger)}}(q)=\left\{\begin{array}[c]{c}K_{\widehat{\lambda}+(1/2)^{m},\widehat{\mu}+(1/2)^{m}}^{D_{m}}(q)\text{ when
}\left|\widehat{\lambda}\right|-\left|\widehat{\mu}\right|\text{
is even,}\\
K_{\widehat{\lambda}+(1/2)^{m},\iota(\widehat{\mu}+(1/2)^{m})}^{D_{m}}(q)\text{ when
}\left|\widehat{\lambda}\right|-\left|\widehat{\mu}\right|\text{
is odd.}\end{array}\right.
8. Untwisted cases Bn(1),Bn(1,†),Cn(1),B_{n}^{(1)},\;B_{n}^{(1,\dagger)},\;C_{n}^{(1)}, and Dn(1)D_{n}^{(1)}
8.1. General considerations about the untwisted cases
Let us study whether we can obtain 1-d sums of untwisted types by similar
techniques as KF polynomials. First of all, we need to make appear
Hall-Littlewood polynomials thanks to specializations in the Koornwinder polynomials
Pμ^(y,a,b,c,d,t,q)P_{\widehat{\mu}}(y,a,b,c,d;t,q) (keep in mind the flip of (q,t)(q,t) into
(t,q)(t,q)). This can be done in several ways from Macdonald specializations at
t=0t=0 but which will eventually produce the same Hall-Littlewood polynomial at the end. For
example Hall-Littlewood polynomials of type CmC_{m} can be obtained from any affine root
system whose classical finite subroot system (obtained by removing the zero
node) is of type CmC_{m}, hence Cm(1)C_{m}^{(1)}, A2m−1(2)A_{2m-1}^{(2)}, and A2n(2)A_{2n}^{(2)}. We get the following table, where we use the parameter uu (a priori different from qq) related to the orbits of εn\varepsilon_{n} or
2εn2\varepsilon_{n}.
(29)
Type
(y,a,b,c,d,t,q)(y;a,b,c,d;t,q)
BmB_{m} integer weights
(y,u,−1,0,0,0,q)(y;u,-1,0,0;0,q)
BmB_{m} half-integer weights
(y,u,0,0,0,0,q)(y;u,0,0,0;0,q)
CmC_{m}
(y,u1/2,−u1/2,0,0,q)(y;u^{1/2},-u^{1/2},0;0,q)
DmD_{m}
(y,1,−1,0,0,0,q)(y;1,-1,0,0;0,q)
Now, if we want to make appear
1-d sums of untwisted affine types from Koornwinder polynomials beyond
type An−1(1)A_{n-1}^{(1)}, the specialization in the parameters (x,a,b,c,d,q,t)(x,a,b,c,d;q,t)
should be done according to the table below.
One immediately sees that the in the first (HL specialization) table, at most two
parameters (a,b,c,d)(a,b,c,d) are non-zero. Therefore, there is no chance that these
specializations can make appear 1-d sums of type Bn(1)B_{n}^{(1)}, Bn(1,†)B_{n}^{(1,\dagger)}, or Dn(1)D_{n}^{(1)}, where we need at least three nonzero
parameters. In contrast, we can make appear 1-d sums of type Cn(1)C_{n}^{(1)}
from type CmC_{m} two parameter HL specialization where we put u=0u=0. This
will be studied in the following paragraph.
8.2. Type Cn(1)C_{n}^{(1)} 1-d sums
We also start from (26),
and we use the specialization (x,a,b,c,d,q,t)=(x,0,0,0,0,q,0)(x;a,b,c,d;q,t)=(x;0,0,0,0;q,0), which gives
the two-parameter Hall-Littlewood polynomial of type CmC_{m}
but since the Pμ(x,0,0,0,0,q,0)P_{\mu}(x,0,0,0,0;q,0)’s are in the character ring of type
CnC_{n} (because this is a Demazure character of type Cn(1)C_{n}^{(1)}), we
obtain
We can consider yet the pairing on char≤mCn(x)×char≤nCm(y)\mathrm{char}_{\leq m}^{C_{n}}(x)\times\mathrm{char}_{\leq n}^{C_{m}}(y) such that ⟨sμCn,sλ^Cm)Cn×Cm=δλ,μ\langle s_{\mu}^{C_{n}},s_{\widehat{\lambda}}^{C_{m}})_{C_{n}\times C_{m}}=\delta_{\lambda,\mu}. Let
𝖰^μCn(x,0,q)\widehat{\mathsf{Q}}_{\mu}^{C_{n}}(x;0,q) be the dual polynomial of the
Hall-Littlewood polynomial Pμ^Cm(y,0,q)P_{\widehat{\mu}}^{C_{m}}(y;0,q) for this pairing.
That is
This should not be confused with the polynomial 𝖰μCn(x,q)\mathsf{Q}_{\mu}^{C_{n}}(x;q)
used in Section 4 which is the dual of the ordinary
(one-parameter) Hall-Littlewood polynomial of type CmC_{m}. We then have
Therefore the one-dimensional sums of type Cn(1)C_{n}^{(1)} associated with the
tensor product of columns defined by μ\mu (with mm columns) coincide with
the signed KF polynomials Kλ^,μ^Cm(0,q)K_{\widehat{\lambda},\widehat{\mu}}^{C_{m}}(0,q) of type
CmC_{m}. Let us now examine more precisely what are these polynomials
Kλ^,μ^Cm(0,q)K_{\widehat{\lambda},\widehat{\mu}}^{C_{m}}(0,q). We have
and the Kostant partition function 𝒫0,qCm\mathcal{P}_{0,q}^{C_{m}} is nothing but
the Kostant partition 𝒫0,qDm\mathcal{P}_{0,q}^{D_{m}} function for type DmD_{m}.
We also have ρCm=ρDm+(1)m\rho_{C_{m}}=\rho_{D_{m}}+(1)^{m} and WCm=WDm⨆WDmsεmW_{C_{m}}=W_{D_{m}}{\textstyle\bigsqcup}W_{D_{m}}s_{\varepsilon_{m}}. Therefore, we get
Observe that contrary to the previous case of the polynomials Kλ^,μ^Bm(0,q)K_{\widehat{\lambda},\widehat{\mu}}^{B_{m}}(0,q), we cannot conclude by saying that
Kλ^+(1)m,μ^+(1)mDm(q)K_{\widehat{\lambda}+(1)^{m},\widehat{\mu}+(1)^{m}}^{D_{m}}(q) and Kλ^+(1)m,ι(μ^+(1)m)Dm(q)K_{\widehat{\lambda}+(1)^{m},\iota(\widehat{\mu}+(1)^{m})}^{D_{m}}(q) cannot be simultaneously
nonzero polynomials.
Denote by Xλ,μCn(1)(q)X_{\lambda,\mu}^{C_{n}^{(1)}}(q) the one-dimensional sum of type
Cn(1)C_{n}^{(1)} associated with the tensor product of columns defined by μ\mu
(with mm columns) and the weight λ\lambda. Here the column KR crystals
B(k,1)B^{(k,1)} of type Cn(1)C_{n}^{(1)} have a classical structure (obtained by
removing the 00-arrows) of type CnC_{n} isomorphic to BCn(ωk)B^{C_{n}}(\omega_{k}). We have proved the following theorem.
Theorem 8.1.
For any pair of partitions λ,μ\lambda,\mu in the rectangle (nm)(n^{m}), we have
μ=(4,3,2,0)= so that μ^=(3,2,1,1)=.\mu=(4,3,2,0)=\hbox to52.3pt{\vbox to39.3pt{\pgfpicture\makeatletter\hbox{\hskip 0.15pt\lower-26.15pt\hbox to0.0pt{\lxSVG@begingroup@{_scopebegin=1} \lxSVG@begingroup@{stroke=#000000} \lxSVG@begingroup@{fill=#000000} \lxSVG@setlinewidth{\the\pgflinewidth}\lxSVG@begingroup@{stroke-width=0.4pt} \lx@inpgf@ignorespaces\nullfont\lxSVG@begingroup@{_scopebegin=1} \lxSVG@closescope \lxSVG@begingroup@{_scopebegin=1} \lxSVG@closescope \hbox to0.0pt{\lxSVG@begingroup@{_scopebegin=1} {{\lx@inpgf@ignorespaces}}{{\lx@inpgf@ignorespaces}}{{\lx@inpgf@ignorespaces}}{{\lx@inpgf@ignorespaces}{{}}{}
{{\lx@inpgf@ignorespaces}{}}{{}}{}{}{}{}{{}}{}\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lxSVG@setlinewidth{\the\pgflinewidth}\lxSVG@begingroup@{stroke-width=0.3pt} \lx@inpgf@ignorespaces\lxSVG@begingroup@{fill=#FFFFFF} \lxSVG@fill@opacity{1}\lxSVG@begingroup@{fill-opacity=1} {}\lxSVG@fillstroke\lxSVG@drawpath@unclipped{M 0 0 M 0 0 L 0 17.99 L 17.99 17.99 L 17.99 0 Z M 17.99 17.99}{} \lx@inpgf@ignorespaces
\lxSVG@closescope {{\lx@inpgf@ignorespaces}}\lx@inpgf@ignorespaces\hbox{\hbox{{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}{{}{}{{
{}{}}}{
{}{}}
{{}{{\lx@inpgf@ignorespaces}}}{{}{\lx@inpgf@ignorespaces}}{}{{}{\lx@inpgf@ignorespaces}}
{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lx@inpgf@ignorespaces
\lxSVG@closescope }{{{{\lx@inpgf@ignorespaces}}\lxSVG@begingroup@{_scopebegin=1} \lxSVG@transformcm{1.0}{0.0}{0.0}{1.0}{4.0pt}{6.5pt}\lxSVG@begingroup@{transform=matrix(1.0 0.0 0.0 1.0 5.53 8.99)} \pgfsys@hbox{58}\lxSVG@closescope }}}
\lxSVG@closescope }}}
{\lx@inpgf@ignorespaces}{{}}{}
{{\lx@inpgf@ignorespaces}{}}{{}}{}{}{}{}{{}}{}\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lxSVG@setlinewidth{\the\pgflinewidth}\lxSVG@begingroup@{stroke-width=0.3pt} \lx@inpgf@ignorespaces\lxSVG@begingroup@{fill=#FFFFFF} \lxSVG@fill@opacity{1}\lxSVG@begingroup@{fill-opacity=1} {}\lxSVG@fillstroke\lxSVG@drawpath@unclipped{M 17.99 0 M 17.99 0 L 17.99 17.99 L 35.98 17.99 L 35.98 0 Z M 35.98 17.99}{} \lx@inpgf@ignorespaces
\lxSVG@closescope {{\lx@inpgf@ignorespaces}}\lx@inpgf@ignorespaces\hbox{\hbox{{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}{{}{}{{
{}{}}}{
{}{}}
{{}{{\lx@inpgf@ignorespaces}}}{{}{\lx@inpgf@ignorespaces}}{}{{}{\lx@inpgf@ignorespaces}}
{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lx@inpgf@ignorespaces
\lxSVG@closescope }{{{{\lx@inpgf@ignorespaces}}\lxSVG@begingroup@{_scopebegin=1} \lxSVG@transformcm{1.0}{0.0}{0.0}{1.0}{17.0pt}{6.5pt}\lxSVG@begingroup@{transform=matrix(1.0 0.0 0.0 1.0 23.52 8.99)} \pgfsys@hbox{58}\lxSVG@closescope }}}
\lxSVG@closescope }}}
{\lx@inpgf@ignorespaces}{{}}{}
{{\lx@inpgf@ignorespaces}{}}{{}}{}{}{}{}{{}}{}\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lxSVG@setlinewidth{\the\pgflinewidth}\lxSVG@begingroup@{stroke-width=0.3pt} \lx@inpgf@ignorespaces\lxSVG@begingroup@{fill=#FFFFFF} \lxSVG@fill@opacity{1}\lxSVG@begingroup@{fill-opacity=1} {}\lxSVG@fillstroke\lxSVG@drawpath@unclipped{M 35.98 0 M 35.98 0 L 35.98 17.99 L 53.96 17.99 L 53.96 0 Z M 53.96 17.99}{} \lx@inpgf@ignorespaces
\lxSVG@closescope {{\lx@inpgf@ignorespaces}}\lx@inpgf@ignorespaces\hbox{\hbox{{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}{{}{}{{
{}{}}}{
{}{}}
{{}{{\lx@inpgf@ignorespaces}}}{{}{\lx@inpgf@ignorespaces}}{}{{}{\lx@inpgf@ignorespaces}}
{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lx@inpgf@ignorespaces
\lxSVG@closescope }{{{{\lx@inpgf@ignorespaces}}\lxSVG@begingroup@{_scopebegin=1} \lxSVG@transformcm{1.0}{0.0}{0.0}{1.0}{30.0pt}{6.5pt}\lxSVG@begingroup@{transform=matrix(1.0 0.0 0.0 1.0 41.51 8.99)} \pgfsys@hbox{58}\lxSVG@closescope }}}
\lxSVG@closescope }}}
{\lx@inpgf@ignorespaces}{{}}{}
{{\lx@inpgf@ignorespaces}{}}{{}}{}{}{}{}{{}}{}\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lxSVG@setlinewidth{\the\pgflinewidth}\lxSVG@begingroup@{stroke-width=0.3pt} \lx@inpgf@ignorespaces\lxSVG@begingroup@{fill=#FFFFFF} \lxSVG@fill@opacity{1}\lxSVG@begingroup@{fill-opacity=1} {}\lxSVG@fillstroke\lxSVG@drawpath@unclipped{M 53.96 0 M 53.96 0 L 53.96 17.99 L 71.95 17.99 L 71.95 0 Z M 71.95 17.99}{} \lx@inpgf@ignorespaces
\lxSVG@closescope {{\lx@inpgf@ignorespaces}}\lx@inpgf@ignorespaces\hbox{\hbox{{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}{{}{}{{
{}{}}}{
{}{}}
{{}{{\lx@inpgf@ignorespaces}}}{{}{\lx@inpgf@ignorespaces}}{}{{}{\lx@inpgf@ignorespaces}}
{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lx@inpgf@ignorespaces
\lxSVG@closescope }{{{{\lx@inpgf@ignorespaces}}\lxSVG@begingroup@{_scopebegin=1} \lxSVG@transformcm{1.0}{0.0}{0.0}{1.0}{43.0pt}{6.5pt}\lxSVG@begingroup@{transform=matrix(1.0 0.0 0.0 1.0 59.5 8.99)} \pgfsys@hbox{58}\lxSVG@closescope }}}
\lxSVG@closescope }}}
{\lx@inpgf@ignorespaces}{{}}{}
{{\lx@inpgf@ignorespaces}{}}{{}}{}{}{}{}{{}}{}\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lxSVG@setlinewidth{\the\pgflinewidth}\lxSVG@begingroup@{stroke-width=0.3pt} \lx@inpgf@ignorespaces\lxSVG@begingroup@{fill=#FFFFFF} \lxSVG@fill@opacity{1}\lxSVG@begingroup@{fill-opacity=1} {}\lxSVG@fillstroke\lxSVG@drawpath@unclipped{M 0 -17.99 M 0 -17.99 L 0 0 L 17.99 0 L 17.99 -17.99 Z M 17.99 0}{} \lx@inpgf@ignorespaces
\lxSVG@closescope {{\lx@inpgf@ignorespaces}}\lx@inpgf@ignorespaces\hbox{\hbox{{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}{{}{}{{
{}{}}}{
{}{}}
{{}{{\lx@inpgf@ignorespaces}}}{{}{\lx@inpgf@ignorespaces}}{}{{}{\lx@inpgf@ignorespaces}}
{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lx@inpgf@ignorespaces
\lxSVG@closescope }{{{{\lx@inpgf@ignorespaces}}\lxSVG@begingroup@{_scopebegin=1} \lxSVG@transformcm{1.0}{0.0}{0.0}{1.0}{4.0pt}{-6.5pt}\lxSVG@begingroup@{transform=matrix(1.0 0.0 0.0 1.0 5.53 -8.99)} \pgfsys@hbox{58}\lxSVG@closescope }}}
\lxSVG@closescope }}}
{\lx@inpgf@ignorespaces}{{}}{}
{{\lx@inpgf@ignorespaces}{}}{{}}{}{}{}{}{{}}{}\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lxSVG@setlinewidth{\the\pgflinewidth}\lxSVG@begingroup@{stroke-width=0.3pt} \lx@inpgf@ignorespaces\lxSVG@begingroup@{fill=#FFFFFF} \lxSVG@fill@opacity{1}\lxSVG@begingroup@{fill-opacity=1} {}\lxSVG@fillstroke\lxSVG@drawpath@unclipped{M 17.99 -17.99 M 17.99 -17.99 L 17.99 0 L 35.98 0 L 35.98 -17.99 Z M 35.98 0}{} \lx@inpgf@ignorespaces
\lxSVG@closescope {{\lx@inpgf@ignorespaces}}\lx@inpgf@ignorespaces\hbox{\hbox{{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}{{}{}{{
{}{}}}{
{}{}}
{{}{{\lx@inpgf@ignorespaces}}}{{}{\lx@inpgf@ignorespaces}}{}{{}{\lx@inpgf@ignorespaces}}
{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lx@inpgf@ignorespaces
\lxSVG@closescope }{{{{\lx@inpgf@ignorespaces}}\lxSVG@begingroup@{_scopebegin=1} \lxSVG@transformcm{1.0}{0.0}{0.0}{1.0}{17.0pt}{-6.5pt}\lxSVG@begingroup@{transform=matrix(1.0 0.0 0.0 1.0 23.52 -8.99)} \pgfsys@hbox{58}\lxSVG@closescope }}}
\lxSVG@closescope }}}
{\lx@inpgf@ignorespaces}{{}}{}
{{\lx@inpgf@ignorespaces}{}}{{}}{}{}{}{}{{}}{}\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lxSVG@setlinewidth{\the\pgflinewidth}\lxSVG@begingroup@{stroke-width=0.3pt} \lx@inpgf@ignorespaces\lxSVG@begingroup@{fill=#FFFFFF} \lxSVG@fill@opacity{1}\lxSVG@begingroup@{fill-opacity=1} {}\lxSVG@fillstroke\lxSVG@drawpath@unclipped{M 35.98 -17.99 M 35.98 -17.99 L 35.98 0 L 53.96 0 L 53.96 -17.99 Z M 53.96 0}{} \lx@inpgf@ignorespaces
\lxSVG@closescope {{\lx@inpgf@ignorespaces}}\lx@inpgf@ignorespaces\hbox{\hbox{{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}{{}{}{{
{}{}}}{
{}{}}
{{}{{\lx@inpgf@ignorespaces}}}{{}{\lx@inpgf@ignorespaces}}{}{{}{\lx@inpgf@ignorespaces}}
{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lx@inpgf@ignorespaces
\lxSVG@closescope }{{{{\lx@inpgf@ignorespaces}}\lxSVG@begingroup@{_scopebegin=1} \lxSVG@transformcm{1.0}{0.0}{0.0}{1.0}{30.0pt}{-6.5pt}\lxSVG@begingroup@{transform=matrix(1.0 0.0 0.0 1.0 41.51 -8.99)} \pgfsys@hbox{58}\lxSVG@closescope }}}
\lxSVG@closescope }}}
{\lx@inpgf@ignorespaces}{{}}{}
{{\lx@inpgf@ignorespaces}{}}{{}}{}{}{}{}{{}}{}\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lxSVG@setlinewidth{\the\pgflinewidth}\lxSVG@begingroup@{stroke-width=0.3pt} \lx@inpgf@ignorespaces\lxSVG@begingroup@{fill=#FFFFFF} \lxSVG@fill@opacity{1}\lxSVG@begingroup@{fill-opacity=1} {}\lxSVG@fillstroke\lxSVG@drawpath@unclipped{M 0 -35.98 M 0 -35.98 L 0 -17.99 L 17.99 -17.99 L 17.99 -35.98 Z M 17.99 -17.99}{} \lx@inpgf@ignorespaces
\lxSVG@closescope {{\lx@inpgf@ignorespaces}}\lx@inpgf@ignorespaces\hbox{\hbox{{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}{{}{}{{
{}{}}}{
{}{}}
{{}{{\lx@inpgf@ignorespaces}}}{{}{\lx@inpgf@ignorespaces}}{}{{}{\lx@inpgf@ignorespaces}}
{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lx@inpgf@ignorespaces
\lxSVG@closescope }{{{{\lx@inpgf@ignorespaces}}\lxSVG@begingroup@{_scopebegin=1} \lxSVG@transformcm{1.0}{0.0}{0.0}{1.0}{4.0pt}{-19.5pt}\lxSVG@begingroup@{transform=matrix(1.0 0.0 0.0 1.0 5.53 -26.98)} \pgfsys@hbox{58}\lxSVG@closescope }}}
\lxSVG@closescope }}}
{\lx@inpgf@ignorespaces}{{}}{}
{{\lx@inpgf@ignorespaces}{}}{{}}{}{}{}{}{{}}{}\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lxSVG@setlinewidth{\the\pgflinewidth}\lxSVG@begingroup@{stroke-width=0.3pt} \lx@inpgf@ignorespaces\lxSVG@begingroup@{fill=#FFFFFF} \lxSVG@fill@opacity{1}\lxSVG@begingroup@{fill-opacity=1} {}\lxSVG@fillstroke\lxSVG@drawpath@unclipped{M 17.99 -35.98 M 17.99 -35.98 L 17.99 -17.99 L 35.98 -17.99 L 35.98 -35.98 Z M 35.98 -17.99}{} \lx@inpgf@ignorespaces
\lxSVG@closescope {{\lx@inpgf@ignorespaces}}\lx@inpgf@ignorespaces\hbox{\hbox{{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}{{}{}{{
{}{}}}{
{}{}}
{{}{{\lx@inpgf@ignorespaces}}}{{}{\lx@inpgf@ignorespaces}}{}{{}{\lx@inpgf@ignorespaces}}
{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lx@inpgf@ignorespaces
\lxSVG@closescope }{{{{\lx@inpgf@ignorespaces}}\lxSVG@begingroup@{_scopebegin=1} \lxSVG@transformcm{1.0}{0.0}{0.0}{1.0}{17.0pt}{-19.5pt}\lxSVG@begingroup@{transform=matrix(1.0 0.0 0.0 1.0 23.52 -26.98)} \pgfsys@hbox{58}\lxSVG@closescope }}}
\lxSVG@closescope }}}
}
\lxSVG@closescope {\lx@inpgf@ignorespaces}{\lx@inpgf@ignorespaces}{\lx@inpgf@ignorespaces}\hss}\lxSVG@discardpath\lxSVG@closescope \hss}}\lxSVG@closescope\endpgfpicture}}\text{\quad so that \quad}\widehat{\mu}=(3,2,1,1)=\hbox to39.3pt{\vbox to52.3pt{\pgfpicture\makeatletter\hbox{\hskip 0.15pt\lower-39.15pt\hbox to0.0pt{\lxSVG@begingroup@{_scopebegin=1} \lxSVG@begingroup@{stroke=#000000} \lxSVG@begingroup@{fill=#000000} \lxSVG@setlinewidth{\the\pgflinewidth}\lxSVG@begingroup@{stroke-width=0.4pt} \lx@inpgf@ignorespaces\nullfont\lxSVG@begingroup@{_scopebegin=1} \lxSVG@closescope \lxSVG@begingroup@{_scopebegin=1} \lxSVG@closescope \hbox to0.0pt{\lxSVG@begingroup@{_scopebegin=1} {{\lx@inpgf@ignorespaces}}{{\lx@inpgf@ignorespaces}}{{\lx@inpgf@ignorespaces}}{{\lx@inpgf@ignorespaces}{{}}{}
{{\lx@inpgf@ignorespaces}{}}{{}}{}{}{}{}{{}}{}\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lxSVG@setlinewidth{\the\pgflinewidth}\lxSVG@begingroup@{stroke-width=0.3pt} \lx@inpgf@ignorespaces\lxSVG@begingroup@{fill=#FFFFFF} \lxSVG@fill@opacity{1}\lxSVG@begingroup@{fill-opacity=1} {}\lxSVG@fillstroke\lxSVG@drawpath@unclipped{M 0 0 M 0 0 L 0 17.99 L 17.99 17.99 L 17.99 0 Z M 17.99 17.99}{} \lx@inpgf@ignorespaces
\lxSVG@closescope {{\lx@inpgf@ignorespaces}}\lx@inpgf@ignorespaces\hbox{\hbox{{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}{{}{}{{
{}{}}}{
{}{}}
{{}{{\lx@inpgf@ignorespaces}}}{{}{\lx@inpgf@ignorespaces}}{}{{}{\lx@inpgf@ignorespaces}}
{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lx@inpgf@ignorespaces
\lxSVG@closescope }{{{{\lx@inpgf@ignorespaces}}\lxSVG@begingroup@{_scopebegin=1} \lxSVG@transformcm{1.0}{0.0}{0.0}{1.0}{4.0pt}{6.5pt}\lxSVG@begingroup@{transform=matrix(1.0 0.0 0.0 1.0 5.53 8.99)} \pgfsys@hbox{58}\lxSVG@closescope }}}
\lxSVG@closescope }}}
{\lx@inpgf@ignorespaces}{{}}{}
{{\lx@inpgf@ignorespaces}{}}{{}}{}{}{}{}{{}}{}\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lxSVG@setlinewidth{\the\pgflinewidth}\lxSVG@begingroup@{stroke-width=0.3pt} \lx@inpgf@ignorespaces\lxSVG@begingroup@{fill=#FFFFFF} \lxSVG@fill@opacity{1}\lxSVG@begingroup@{fill-opacity=1} {}\lxSVG@fillstroke\lxSVG@drawpath@unclipped{M 17.99 0 M 17.99 0 L 17.99 17.99 L 35.98 17.99 L 35.98 0 Z M 35.98 17.99}{} \lx@inpgf@ignorespaces
\lxSVG@closescope {{\lx@inpgf@ignorespaces}}\lx@inpgf@ignorespaces\hbox{\hbox{{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}{{}{}{{
{}{}}}{
{}{}}
{{}{{\lx@inpgf@ignorespaces}}}{{}{\lx@inpgf@ignorespaces}}{}{{}{\lx@inpgf@ignorespaces}}
{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lx@inpgf@ignorespaces
\lxSVG@closescope }{{{{\lx@inpgf@ignorespaces}}\lxSVG@begingroup@{_scopebegin=1} \lxSVG@transformcm{1.0}{0.0}{0.0}{1.0}{17.0pt}{6.5pt}\lxSVG@begingroup@{transform=matrix(1.0 0.0 0.0 1.0 23.52 8.99)} \pgfsys@hbox{58}\lxSVG@closescope }}}
\lxSVG@closescope }}}
{\lx@inpgf@ignorespaces}{{}}{}
{{\lx@inpgf@ignorespaces}{}}{{}}{}{}{}{}{{}}{}\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lxSVG@setlinewidth{\the\pgflinewidth}\lxSVG@begingroup@{stroke-width=0.3pt} \lx@inpgf@ignorespaces\lxSVG@begingroup@{fill=#FFFFFF} \lxSVG@fill@opacity{1}\lxSVG@begingroup@{fill-opacity=1} {}\lxSVG@fillstroke\lxSVG@drawpath@unclipped{M 35.98 0 M 35.98 0 L 35.98 17.99 L 53.96 17.99 L 53.96 0 Z M 53.96 17.99}{} \lx@inpgf@ignorespaces
\lxSVG@closescope {{\lx@inpgf@ignorespaces}}\lx@inpgf@ignorespaces\hbox{\hbox{{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}{{}{}{{
{}{}}}{
{}{}}
{{}{{\lx@inpgf@ignorespaces}}}{{}{\lx@inpgf@ignorespaces}}{}{{}{\lx@inpgf@ignorespaces}}
{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lx@inpgf@ignorespaces
\lxSVG@closescope }{{{{\lx@inpgf@ignorespaces}}\lxSVG@begingroup@{_scopebegin=1} \lxSVG@transformcm{1.0}{0.0}{0.0}{1.0}{30.0pt}{6.5pt}\lxSVG@begingroup@{transform=matrix(1.0 0.0 0.0 1.0 41.51 8.99)} \pgfsys@hbox{58}\lxSVG@closescope }}}
\lxSVG@closescope }}}
{\lx@inpgf@ignorespaces}{{}}{}
{{\lx@inpgf@ignorespaces}{}}{{}}{}{}{}{}{{}}{}\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lxSVG@setlinewidth{\the\pgflinewidth}\lxSVG@begingroup@{stroke-width=0.3pt} \lx@inpgf@ignorespaces\lxSVG@begingroup@{fill=#FFFFFF} \lxSVG@fill@opacity{1}\lxSVG@begingroup@{fill-opacity=1} {}\lxSVG@fillstroke\lxSVG@drawpath@unclipped{M 0 -17.99 M 0 -17.99 L 0 0 L 17.99 0 L 17.99 -17.99 Z M 17.99 0}{} \lx@inpgf@ignorespaces
\lxSVG@closescope {{\lx@inpgf@ignorespaces}}\lx@inpgf@ignorespaces\hbox{\hbox{{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}{{}{}{{
{}{}}}{
{}{}}
{{}{{\lx@inpgf@ignorespaces}}}{{}{\lx@inpgf@ignorespaces}}{}{{}{\lx@inpgf@ignorespaces}}
{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lx@inpgf@ignorespaces
\lxSVG@closescope }{{{{\lx@inpgf@ignorespaces}}\lxSVG@begingroup@{_scopebegin=1} \lxSVG@transformcm{1.0}{0.0}{0.0}{1.0}{4.0pt}{-6.5pt}\lxSVG@begingroup@{transform=matrix(1.0 0.0 0.0 1.0 5.53 -8.99)} \pgfsys@hbox{58}\lxSVG@closescope }}}
\lxSVG@closescope }}}
{\lx@inpgf@ignorespaces}{{}}{}
{{\lx@inpgf@ignorespaces}{}}{{}}{}{}{}{}{{}}{}\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lxSVG@setlinewidth{\the\pgflinewidth}\lxSVG@begingroup@{stroke-width=0.3pt} \lx@inpgf@ignorespaces\lxSVG@begingroup@{fill=#FFFFFF} \lxSVG@fill@opacity{1}\lxSVG@begingroup@{fill-opacity=1} {}\lxSVG@fillstroke\lxSVG@drawpath@unclipped{M 17.99 -17.99 M 17.99 -17.99 L 17.99 0 L 35.98 0 L 35.98 -17.99 Z M 35.98 0}{} \lx@inpgf@ignorespaces
\lxSVG@closescope {{\lx@inpgf@ignorespaces}}\lx@inpgf@ignorespaces\hbox{\hbox{{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}{{}{}{{
{}{}}}{
{}{}}
{{}{{\lx@inpgf@ignorespaces}}}{{}{\lx@inpgf@ignorespaces}}{}{{}{\lx@inpgf@ignorespaces}}
{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lx@inpgf@ignorespaces
\lxSVG@closescope }{{{{\lx@inpgf@ignorespaces}}\lxSVG@begingroup@{_scopebegin=1} \lxSVG@transformcm{1.0}{0.0}{0.0}{1.0}{17.0pt}{-6.5pt}\lxSVG@begingroup@{transform=matrix(1.0 0.0 0.0 1.0 23.52 -8.99)} \pgfsys@hbox{58}\lxSVG@closescope }}}
\lxSVG@closescope }}}
{\lx@inpgf@ignorespaces}{{}}{}
{{\lx@inpgf@ignorespaces}{}}{{}}{}{}{}{}{{}}{}\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lxSVG@setlinewidth{\the\pgflinewidth}\lxSVG@begingroup@{stroke-width=0.3pt} \lx@inpgf@ignorespaces\lxSVG@begingroup@{fill=#FFFFFF} \lxSVG@fill@opacity{1}\lxSVG@begingroup@{fill-opacity=1} {}\lxSVG@fillstroke\lxSVG@drawpath@unclipped{M 0 -35.98 M 0 -35.98 L 0 -17.99 L 17.99 -17.99 L 17.99 -35.98 Z M 17.99 -17.99}{} \lx@inpgf@ignorespaces
\lxSVG@closescope {{\lx@inpgf@ignorespaces}}\lx@inpgf@ignorespaces\hbox{\hbox{{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}{{}{}{{
{}{}}}{
{}{}}
{{}{{\lx@inpgf@ignorespaces}}}{{}{\lx@inpgf@ignorespaces}}{}{{}{\lx@inpgf@ignorespaces}}
{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lx@inpgf@ignorespaces
\lxSVG@closescope }{{{{\lx@inpgf@ignorespaces}}\lxSVG@begingroup@{_scopebegin=1} \lxSVG@transformcm{1.0}{0.0}{0.0}{1.0}{4.0pt}{-19.5pt}\lxSVG@begingroup@{transform=matrix(1.0 0.0 0.0 1.0 5.53 -26.98)} \pgfsys@hbox{58}\lxSVG@closescope }}}
\lxSVG@closescope }}}
{\lx@inpgf@ignorespaces}{{}}{}
{{\lx@inpgf@ignorespaces}{}}{{}}{}{}{}{}{{}}{}\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lxSVG@setlinewidth{\the\pgflinewidth}\lxSVG@begingroup@{stroke-width=0.3pt} \lx@inpgf@ignorespaces\lxSVG@begingroup@{fill=#FFFFFF} \lxSVG@fill@opacity{1}\lxSVG@begingroup@{fill-opacity=1} {}\lxSVG@fillstroke\lxSVG@drawpath@unclipped{M 0 -53.96 M 0 -53.96 L 0 -35.98 L 17.99 -35.98 L 17.99 -53.96 Z M 17.99 -35.98}{} \lx@inpgf@ignorespaces
\lxSVG@closescope {{\lx@inpgf@ignorespaces}}\lx@inpgf@ignorespaces\hbox{\hbox{{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}{{}{}{{
{}{}}}{
{}{}}
{{}{{\lx@inpgf@ignorespaces}}}{{}{\lx@inpgf@ignorespaces}}{}{{}{\lx@inpgf@ignorespaces}}
{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lx@inpgf@ignorespaces
\lxSVG@closescope }{{{{\lx@inpgf@ignorespaces}}\lxSVG@begingroup@{_scopebegin=1} \lxSVG@transformcm{1.0}{0.0}{0.0}{1.0}{4.0pt}{-32.5pt}\lxSVG@begingroup@{transform=matrix(1.0 0.0 0.0 1.0 5.53 -44.97)} \pgfsys@hbox{58}\lxSVG@closescope }}}
\lxSVG@closescope }}}
}
\lxSVG@closescope {\lx@inpgf@ignorespaces}{\lx@inpgf@ignorespaces}{\lx@inpgf@ignorespaces}\hss}\lxSVG@discardpath\lxSVG@closescope \hss}}\lxSVG@closescope\endpgfpicture}}.
Choose
λ=(1,0,0,0)= so that λ^=(4,4,4,3)=.\lambda=(1,0,0,0)=\hbox to13.3pt{\vbox to13.3pt{\pgfpicture\makeatletter\hbox{\hskip 0.15pt\lower-0.15pt\hbox to0.0pt{\lxSVG@begingroup@{_scopebegin=1} \lxSVG@begingroup@{stroke=#000000} \lxSVG@begingroup@{fill=#000000} \lxSVG@setlinewidth{\the\pgflinewidth}\lxSVG@begingroup@{stroke-width=0.4pt} \lx@inpgf@ignorespaces\nullfont\lxSVG@begingroup@{_scopebegin=1} \lxSVG@closescope \lxSVG@begingroup@{_scopebegin=1} \lxSVG@closescope \hbox to0.0pt{\lxSVG@begingroup@{_scopebegin=1} {{\lx@inpgf@ignorespaces}}{{\lx@inpgf@ignorespaces}}{{\lx@inpgf@ignorespaces}}{{\lx@inpgf@ignorespaces}{{}}{}
{{\lx@inpgf@ignorespaces}{}}{{}}{}{}{}{}{{}}{}\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lxSVG@setlinewidth{\the\pgflinewidth}\lxSVG@begingroup@{stroke-width=0.3pt} \lx@inpgf@ignorespaces\lxSVG@begingroup@{fill=#FFFFFF} \lxSVG@fill@opacity{1}\lxSVG@begingroup@{fill-opacity=1} {}\lxSVG@fillstroke\lxSVG@drawpath@unclipped{M 0 0 M 0 0 L 0 17.99 L 17.99 17.99 L 17.99 0 Z M 17.99 17.99}{} \lx@inpgf@ignorespaces
\lxSVG@closescope {{\lx@inpgf@ignorespaces}}\lx@inpgf@ignorespaces\hbox{\hbox{{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}{{}{}{{
{}{}}}{
{}{}}
{{}{{\lx@inpgf@ignorespaces}}}{{}{\lx@inpgf@ignorespaces}}{}{{}{\lx@inpgf@ignorespaces}}
{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lx@inpgf@ignorespaces
\lxSVG@closescope }{{{{\lx@inpgf@ignorespaces}}\lxSVG@begingroup@{_scopebegin=1} \lxSVG@transformcm{1.0}{0.0}{0.0}{1.0}{4.0pt}{6.5pt}\lxSVG@begingroup@{transform=matrix(1.0 0.0 0.0 1.0 5.53 8.99)} \pgfsys@hbox{58}\lxSVG@closescope }}}
\lxSVG@closescope }}}
}
\lxSVG@closescope {\lx@inpgf@ignorespaces}{\lx@inpgf@ignorespaces}{\lx@inpgf@ignorespaces}\hss}\lxSVG@discardpath\lxSVG@closescope \hss}}\lxSVG@closescope\endpgfpicture}}\text{\quad so that \quad}\widehat{\lambda}=(4,4,4,3)=\hbox to52.3pt{\vbox to52.3pt{\pgfpicture\makeatletter\hbox{\hskip 0.15pt\lower-39.15pt\hbox to0.0pt{\lxSVG@begingroup@{_scopebegin=1} \lxSVG@begingroup@{stroke=#000000} \lxSVG@begingroup@{fill=#000000} \lxSVG@setlinewidth{\the\pgflinewidth}\lxSVG@begingroup@{stroke-width=0.4pt} \lx@inpgf@ignorespaces\nullfont\lxSVG@begingroup@{_scopebegin=1} \lxSVG@closescope \lxSVG@begingroup@{_scopebegin=1} \lxSVG@closescope \hbox to0.0pt{\lxSVG@begingroup@{_scopebegin=1} {{\lx@inpgf@ignorespaces}}{{\lx@inpgf@ignorespaces}}{{\lx@inpgf@ignorespaces}}{{\lx@inpgf@ignorespaces}{{}}{}
{{\lx@inpgf@ignorespaces}{}}{{}}{}{}{}{}{{}}{}\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lxSVG@setlinewidth{\the\pgflinewidth}\lxSVG@begingroup@{stroke-width=0.3pt} \lx@inpgf@ignorespaces\lxSVG@begingroup@{fill=#FFFFFF} \lxSVG@fill@opacity{1}\lxSVG@begingroup@{fill-opacity=1} {}\lxSVG@fillstroke\lxSVG@drawpath@unclipped{M 0 0 M 0 0 L 0 17.99 L 17.99 17.99 L 17.99 0 Z M 17.99 17.99}{} \lx@inpgf@ignorespaces
\lxSVG@closescope {{\lx@inpgf@ignorespaces}}\lx@inpgf@ignorespaces\hbox{\hbox{{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}{{}{}{{
{}{}}}{
{}{}}
{{}{{\lx@inpgf@ignorespaces}}}{{}{\lx@inpgf@ignorespaces}}{}{{}{\lx@inpgf@ignorespaces}}
{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lx@inpgf@ignorespaces
\lxSVG@closescope }{{{{\lx@inpgf@ignorespaces}}\lxSVG@begingroup@{_scopebegin=1} \lxSVG@transformcm{1.0}{0.0}{0.0}{1.0}{4.0pt}{6.5pt}\lxSVG@begingroup@{transform=matrix(1.0 0.0 0.0 1.0 5.53 8.99)} \pgfsys@hbox{58}\lxSVG@closescope }}}
\lxSVG@closescope }}}
{\lx@inpgf@ignorespaces}{{}}{}
{{\lx@inpgf@ignorespaces}{}}{{}}{}{}{}{}{{}}{}\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lxSVG@setlinewidth{\the\pgflinewidth}\lxSVG@begingroup@{stroke-width=0.3pt} \lx@inpgf@ignorespaces\lxSVG@begingroup@{fill=#FFFFFF} \lxSVG@fill@opacity{1}\lxSVG@begingroup@{fill-opacity=1} {}\lxSVG@fillstroke\lxSVG@drawpath@unclipped{M 17.99 0 M 17.99 0 L 17.99 17.99 L 35.98 17.99 L 35.98 0 Z M 35.98 17.99}{} \lx@inpgf@ignorespaces
\lxSVG@closescope {{\lx@inpgf@ignorespaces}}\lx@inpgf@ignorespaces\hbox{\hbox{{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}{{}{}{{
{}{}}}{
{}{}}
{{}{{\lx@inpgf@ignorespaces}}}{{}{\lx@inpgf@ignorespaces}}{}{{}{\lx@inpgf@ignorespaces}}
{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lx@inpgf@ignorespaces
\lxSVG@closescope }{{{{\lx@inpgf@ignorespaces}}\lxSVG@begingroup@{_scopebegin=1} \lxSVG@transformcm{1.0}{0.0}{0.0}{1.0}{17.0pt}{6.5pt}\lxSVG@begingroup@{transform=matrix(1.0 0.0 0.0 1.0 23.52 8.99)} \pgfsys@hbox{58}\lxSVG@closescope }}}
\lxSVG@closescope }}}
{\lx@inpgf@ignorespaces}{{}}{}
{{\lx@inpgf@ignorespaces}{}}{{}}{}{}{}{}{{}}{}\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lxSVG@setlinewidth{\the\pgflinewidth}\lxSVG@begingroup@{stroke-width=0.3pt} \lx@inpgf@ignorespaces\lxSVG@begingroup@{fill=#FFFFFF} \lxSVG@fill@opacity{1}\lxSVG@begingroup@{fill-opacity=1} {}\lxSVG@fillstroke\lxSVG@drawpath@unclipped{M 35.98 0 M 35.98 0 L 35.98 17.99 L 53.96 17.99 L 53.96 0 Z M 53.96 17.99}{} \lx@inpgf@ignorespaces
\lxSVG@closescope {{\lx@inpgf@ignorespaces}}\lx@inpgf@ignorespaces\hbox{\hbox{{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}{{}{}{{
{}{}}}{
{}{}}
{{}{{\lx@inpgf@ignorespaces}}}{{}{\lx@inpgf@ignorespaces}}{}{{}{\lx@inpgf@ignorespaces}}
{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lx@inpgf@ignorespaces
\lxSVG@closescope }{{{{\lx@inpgf@ignorespaces}}\lxSVG@begingroup@{_scopebegin=1} \lxSVG@transformcm{1.0}{0.0}{0.0}{1.0}{30.0pt}{6.5pt}\lxSVG@begingroup@{transform=matrix(1.0 0.0 0.0 1.0 41.51 8.99)} \pgfsys@hbox{58}\lxSVG@closescope }}}
\lxSVG@closescope }}}
{\lx@inpgf@ignorespaces}{{}}{}
{{\lx@inpgf@ignorespaces}{}}{{}}{}{}{}{}{{}}{}\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lxSVG@setlinewidth{\the\pgflinewidth}\lxSVG@begingroup@{stroke-width=0.3pt} \lx@inpgf@ignorespaces\lxSVG@begingroup@{fill=#FFFFFF} \lxSVG@fill@opacity{1}\lxSVG@begingroup@{fill-opacity=1} {}\lxSVG@fillstroke\lxSVG@drawpath@unclipped{M 53.96 0 M 53.96 0 L 53.96 17.99 L 71.95 17.99 L 71.95 0 Z M 71.95 17.99}{} \lx@inpgf@ignorespaces
\lxSVG@closescope {{\lx@inpgf@ignorespaces}}\lx@inpgf@ignorespaces\hbox{\hbox{{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}{{}{}{{
{}{}}}{
{}{}}
{{}{{\lx@inpgf@ignorespaces}}}{{}{\lx@inpgf@ignorespaces}}{}{{}{\lx@inpgf@ignorespaces}}
{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lx@inpgf@ignorespaces
\lxSVG@closescope }{{{{\lx@inpgf@ignorespaces}}\lxSVG@begingroup@{_scopebegin=1} \lxSVG@transformcm{1.0}{0.0}{0.0}{1.0}{43.0pt}{6.5pt}\lxSVG@begingroup@{transform=matrix(1.0 0.0 0.0 1.0 59.5 8.99)} \pgfsys@hbox{58}\lxSVG@closescope }}}
\lxSVG@closescope }}}
{\lx@inpgf@ignorespaces}{{}}{}
{{\lx@inpgf@ignorespaces}{}}{{}}{}{}{}{}{{}}{}\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lxSVG@setlinewidth{\the\pgflinewidth}\lxSVG@begingroup@{stroke-width=0.3pt} \lx@inpgf@ignorespaces\lxSVG@begingroup@{fill=#FFFFFF} \lxSVG@fill@opacity{1}\lxSVG@begingroup@{fill-opacity=1} {}\lxSVG@fillstroke\lxSVG@drawpath@unclipped{M 0 -17.99 M 0 -17.99 L 0 0 L 17.99 0 L 17.99 -17.99 Z M 17.99 0}{} \lx@inpgf@ignorespaces
\lxSVG@closescope {{\lx@inpgf@ignorespaces}}\lx@inpgf@ignorespaces\hbox{\hbox{{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}{{}{}{{
{}{}}}{
{}{}}
{{}{{\lx@inpgf@ignorespaces}}}{{}{\lx@inpgf@ignorespaces}}{}{{}{\lx@inpgf@ignorespaces}}
{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lx@inpgf@ignorespaces
\lxSVG@closescope }{{{{\lx@inpgf@ignorespaces}}\lxSVG@begingroup@{_scopebegin=1} \lxSVG@transformcm{1.0}{0.0}{0.0}{1.0}{4.0pt}{-6.5pt}\lxSVG@begingroup@{transform=matrix(1.0 0.0 0.0 1.0 5.53 -8.99)} \pgfsys@hbox{58}\lxSVG@closescope }}}
\lxSVG@closescope }}}
{\lx@inpgf@ignorespaces}{{}}{}
{{\lx@inpgf@ignorespaces}{}}{{}}{}{}{}{}{{}}{}\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lxSVG@setlinewidth{\the\pgflinewidth}\lxSVG@begingroup@{stroke-width=0.3pt} \lx@inpgf@ignorespaces\lxSVG@begingroup@{fill=#FFFFFF} \lxSVG@fill@opacity{1}\lxSVG@begingroup@{fill-opacity=1} {}\lxSVG@fillstroke\lxSVG@drawpath@unclipped{M 17.99 -17.99 M 17.99 -17.99 L 17.99 0 L 35.98 0 L 35.98 -17.99 Z M 35.98 0}{} \lx@inpgf@ignorespaces
\lxSVG@closescope {{\lx@inpgf@ignorespaces}}\lx@inpgf@ignorespaces\hbox{\hbox{{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}{{}{}{{
{}{}}}{
{}{}}
{{}{{\lx@inpgf@ignorespaces}}}{{}{\lx@inpgf@ignorespaces}}{}{{}{\lx@inpgf@ignorespaces}}
{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lx@inpgf@ignorespaces
\lxSVG@closescope }{{{{\lx@inpgf@ignorespaces}}\lxSVG@begingroup@{_scopebegin=1} \lxSVG@transformcm{1.0}{0.0}{0.0}{1.0}{17.0pt}{-6.5pt}\lxSVG@begingroup@{transform=matrix(1.0 0.0 0.0 1.0 23.52 -8.99)} \pgfsys@hbox{58}\lxSVG@closescope }}}
\lxSVG@closescope }}}
{\lx@inpgf@ignorespaces}{{}}{}
{{\lx@inpgf@ignorespaces}{}}{{}}{}{}{}{}{{}}{}\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lxSVG@setlinewidth{\the\pgflinewidth}\lxSVG@begingroup@{stroke-width=0.3pt} \lx@inpgf@ignorespaces\lxSVG@begingroup@{fill=#FFFFFF} \lxSVG@fill@opacity{1}\lxSVG@begingroup@{fill-opacity=1} {}\lxSVG@fillstroke\lxSVG@drawpath@unclipped{M 35.98 -17.99 M 35.98 -17.99 L 35.98 0 L 53.96 0 L 53.96 -17.99 Z M 53.96 0}{} \lx@inpgf@ignorespaces
\lxSVG@closescope {{\lx@inpgf@ignorespaces}}\lx@inpgf@ignorespaces\hbox{\hbox{{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}{{}{}{{
{}{}}}{
{}{}}
{{}{{\lx@inpgf@ignorespaces}}}{{}{\lx@inpgf@ignorespaces}}{}{{}{\lx@inpgf@ignorespaces}}
{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lx@inpgf@ignorespaces
\lxSVG@closescope }{{{{\lx@inpgf@ignorespaces}}\lxSVG@begingroup@{_scopebegin=1} \lxSVG@transformcm{1.0}{0.0}{0.0}{1.0}{30.0pt}{-6.5pt}\lxSVG@begingroup@{transform=matrix(1.0 0.0 0.0 1.0 41.51 -8.99)} \pgfsys@hbox{58}\lxSVG@closescope }}}
\lxSVG@closescope }}}
{\lx@inpgf@ignorespaces}{{}}{}
{{\lx@inpgf@ignorespaces}{}}{{}}{}{}{}{}{{}}{}\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lxSVG@setlinewidth{\the\pgflinewidth}\lxSVG@begingroup@{stroke-width=0.3pt} \lx@inpgf@ignorespaces\lxSVG@begingroup@{fill=#FFFFFF} \lxSVG@fill@opacity{1}\lxSVG@begingroup@{fill-opacity=1} {}\lxSVG@fillstroke\lxSVG@drawpath@unclipped{M 53.96 -17.99 M 53.96 -17.99 L 53.96 0 L 71.95 0 L 71.95 -17.99 Z M 71.95 0}{} \lx@inpgf@ignorespaces
\lxSVG@closescope {{\lx@inpgf@ignorespaces}}\lx@inpgf@ignorespaces\hbox{\hbox{{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}{{}{}{{
{}{}}}{
{}{}}
{{}{{\lx@inpgf@ignorespaces}}}{{}{\lx@inpgf@ignorespaces}}{}{{}{\lx@inpgf@ignorespaces}}
{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lx@inpgf@ignorespaces
\lxSVG@closescope }{{{{\lx@inpgf@ignorespaces}}\lxSVG@begingroup@{_scopebegin=1} \lxSVG@transformcm{1.0}{0.0}{0.0}{1.0}{43.0pt}{-6.5pt}\lxSVG@begingroup@{transform=matrix(1.0 0.0 0.0 1.0 59.5 -8.99)} \pgfsys@hbox{58}\lxSVG@closescope }}}
\lxSVG@closescope }}}
{\lx@inpgf@ignorespaces}{{}}{}
{{\lx@inpgf@ignorespaces}{}}{{}}{}{}{}{}{{}}{}\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lxSVG@setlinewidth{\the\pgflinewidth}\lxSVG@begingroup@{stroke-width=0.3pt} \lx@inpgf@ignorespaces\lxSVG@begingroup@{fill=#FFFFFF} \lxSVG@fill@opacity{1}\lxSVG@begingroup@{fill-opacity=1} {}\lxSVG@fillstroke\lxSVG@drawpath@unclipped{M 0 -35.98 M 0 -35.98 L 0 -17.99 L 17.99 -17.99 L 17.99 -35.98 Z M 17.99 -17.99}{} \lx@inpgf@ignorespaces
\lxSVG@closescope {{\lx@inpgf@ignorespaces}}\lx@inpgf@ignorespaces\hbox{\hbox{{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}{{}{}{{
{}{}}}{
{}{}}
{{}{{\lx@inpgf@ignorespaces}}}{{}{\lx@inpgf@ignorespaces}}{}{{}{\lx@inpgf@ignorespaces}}
{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lx@inpgf@ignorespaces
\lxSVG@closescope }{{{{\lx@inpgf@ignorespaces}}\lxSVG@begingroup@{_scopebegin=1} \lxSVG@transformcm{1.0}{0.0}{0.0}{1.0}{4.0pt}{-19.5pt}\lxSVG@begingroup@{transform=matrix(1.0 0.0 0.0 1.0 5.53 -26.98)} \pgfsys@hbox{58}\lxSVG@closescope }}}
\lxSVG@closescope }}}
{\lx@inpgf@ignorespaces}{{}}{}
{{\lx@inpgf@ignorespaces}{}}{{}}{}{}{}{}{{}}{}\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lxSVG@setlinewidth{\the\pgflinewidth}\lxSVG@begingroup@{stroke-width=0.3pt} \lx@inpgf@ignorespaces\lxSVG@begingroup@{fill=#FFFFFF} \lxSVG@fill@opacity{1}\lxSVG@begingroup@{fill-opacity=1} {}\lxSVG@fillstroke\lxSVG@drawpath@unclipped{M 17.99 -35.98 M 17.99 -35.98 L 17.99 -17.99 L 35.98 -17.99 L 35.98 -35.98 Z M 35.98 -17.99}{} \lx@inpgf@ignorespaces
\lxSVG@closescope {{\lx@inpgf@ignorespaces}}\lx@inpgf@ignorespaces\hbox{\hbox{{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}{{}{}{{
{}{}}}{
{}{}}
{{}{{\lx@inpgf@ignorespaces}}}{{}{\lx@inpgf@ignorespaces}}{}{{}{\lx@inpgf@ignorespaces}}
{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lx@inpgf@ignorespaces
\lxSVG@closescope }{{{{\lx@inpgf@ignorespaces}}\lxSVG@begingroup@{_scopebegin=1} \lxSVG@transformcm{1.0}{0.0}{0.0}{1.0}{17.0pt}{-19.5pt}\lxSVG@begingroup@{transform=matrix(1.0 0.0 0.0 1.0 23.52 -26.98)} \pgfsys@hbox{58}\lxSVG@closescope }}}
\lxSVG@closescope }}}
{\lx@inpgf@ignorespaces}{{}}{}
{{\lx@inpgf@ignorespaces}{}}{{}}{}{}{}{}{{}}{}\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lxSVG@setlinewidth{\the\pgflinewidth}\lxSVG@begingroup@{stroke-width=0.3pt} \lx@inpgf@ignorespaces\lxSVG@begingroup@{fill=#FFFFFF} \lxSVG@fill@opacity{1}\lxSVG@begingroup@{fill-opacity=1} {}\lxSVG@fillstroke\lxSVG@drawpath@unclipped{M 35.98 -35.98 M 35.98 -35.98 L 35.98 -17.99 L 53.96 -17.99 L 53.96 -35.98 Z M 53.96 -17.99}{} \lx@inpgf@ignorespaces
\lxSVG@closescope {{\lx@inpgf@ignorespaces}}\lx@inpgf@ignorespaces\hbox{\hbox{{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}{{}{}{{
{}{}}}{
{}{}}
{{}{{\lx@inpgf@ignorespaces}}}{{}{\lx@inpgf@ignorespaces}}{}{{}{\lx@inpgf@ignorespaces}}
{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lx@inpgf@ignorespaces
\lxSVG@closescope }{{{{\lx@inpgf@ignorespaces}}\lxSVG@begingroup@{_scopebegin=1} \lxSVG@transformcm{1.0}{0.0}{0.0}{1.0}{30.0pt}{-19.5pt}\lxSVG@begingroup@{transform=matrix(1.0 0.0 0.0 1.0 41.51 -26.98)} \pgfsys@hbox{58}\lxSVG@closescope }}}
\lxSVG@closescope }}}
{\lx@inpgf@ignorespaces}{{}}{}
{{\lx@inpgf@ignorespaces}{}}{{}}{}{}{}{}{{}}{}\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lxSVG@setlinewidth{\the\pgflinewidth}\lxSVG@begingroup@{stroke-width=0.3pt} \lx@inpgf@ignorespaces\lxSVG@begingroup@{fill=#FFFFFF} \lxSVG@fill@opacity{1}\lxSVG@begingroup@{fill-opacity=1} {}\lxSVG@fillstroke\lxSVG@drawpath@unclipped{M 53.96 -35.98 M 53.96 -35.98 L 53.96 -17.99 L 71.95 -17.99 L 71.95 -35.98 Z M 71.95 -17.99}{} \lx@inpgf@ignorespaces
\lxSVG@closescope {{\lx@inpgf@ignorespaces}}\lx@inpgf@ignorespaces\hbox{\hbox{{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}{{}{}{{
{}{}}}{
{}{}}
{{}{{\lx@inpgf@ignorespaces}}}{{}{\lx@inpgf@ignorespaces}}{}{{}{\lx@inpgf@ignorespaces}}
{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lx@inpgf@ignorespaces
\lxSVG@closescope }{{{{\lx@inpgf@ignorespaces}}\lxSVG@begingroup@{_scopebegin=1} \lxSVG@transformcm{1.0}{0.0}{0.0}{1.0}{43.0pt}{-19.5pt}\lxSVG@begingroup@{transform=matrix(1.0 0.0 0.0 1.0 59.5 -26.98)} \pgfsys@hbox{58}\lxSVG@closescope }}}
\lxSVG@closescope }}}
{\lx@inpgf@ignorespaces}{{}}{}
{{\lx@inpgf@ignorespaces}{}}{{}}{}{}{}{}{{}}{}\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lxSVG@setlinewidth{\the\pgflinewidth}\lxSVG@begingroup@{stroke-width=0.3pt} \lx@inpgf@ignorespaces\lxSVG@begingroup@{fill=#FFFFFF} \lxSVG@fill@opacity{1}\lxSVG@begingroup@{fill-opacity=1} {}\lxSVG@fillstroke\lxSVG@drawpath@unclipped{M 0 -53.96 M 0 -53.96 L 0 -35.98 L 17.99 -35.98 L 17.99 -53.96 Z M 17.99 -35.98}{} \lx@inpgf@ignorespaces
\lxSVG@closescope {{\lx@inpgf@ignorespaces}}\lx@inpgf@ignorespaces\hbox{\hbox{{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}{{}{}{{
{}{}}}{
{}{}}
{{}{{\lx@inpgf@ignorespaces}}}{{}{\lx@inpgf@ignorespaces}}{}{{}{\lx@inpgf@ignorespaces}}
{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lx@inpgf@ignorespaces
\lxSVG@closescope }{{{{\lx@inpgf@ignorespaces}}\lxSVG@begingroup@{_scopebegin=1} \lxSVG@transformcm{1.0}{0.0}{0.0}{1.0}{4.0pt}{-32.5pt}\lxSVG@begingroup@{transform=matrix(1.0 0.0 0.0 1.0 5.53 -44.97)} \pgfsys@hbox{58}\lxSVG@closescope }}}
\lxSVG@closescope }}}
{\lx@inpgf@ignorespaces}{{}}{}
{{\lx@inpgf@ignorespaces}{}}{{}}{}{}{}{}{{}}{}\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lxSVG@setlinewidth{\the\pgflinewidth}\lxSVG@begingroup@{stroke-width=0.3pt} \lx@inpgf@ignorespaces\lxSVG@begingroup@{fill=#FFFFFF} \lxSVG@fill@opacity{1}\lxSVG@begingroup@{fill-opacity=1} {}\lxSVG@fillstroke\lxSVG@drawpath@unclipped{M 17.99 -53.96 M 17.99 -53.96 L 17.99 -35.98 L 35.98 -35.98 L 35.98 -53.96 Z M 35.98 -35.98}{} \lx@inpgf@ignorespaces
\lxSVG@closescope {{\lx@inpgf@ignorespaces}}\lx@inpgf@ignorespaces\hbox{\hbox{{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}{{}{}{{
{}{}}}{
{}{}}
{{}{{\lx@inpgf@ignorespaces}}}{{}{\lx@inpgf@ignorespaces}}{}{{}{\lx@inpgf@ignorespaces}}
{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lx@inpgf@ignorespaces
\lxSVG@closescope }{{{{\lx@inpgf@ignorespaces}}\lxSVG@begingroup@{_scopebegin=1} \lxSVG@transformcm{1.0}{0.0}{0.0}{1.0}{17.0pt}{-32.5pt}\lxSVG@begingroup@{transform=matrix(1.0 0.0 0.0 1.0 23.52 -44.97)} \pgfsys@hbox{58}\lxSVG@closescope }}}
\lxSVG@closescope }}}
{\lx@inpgf@ignorespaces}{{}}{}
{{\lx@inpgf@ignorespaces}{}}{{}}{}{}{}{}{{}}{}\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lxSVG@setlinewidth{\the\pgflinewidth}\lxSVG@begingroup@{stroke-width=0.3pt} \lx@inpgf@ignorespaces\lxSVG@begingroup@{fill=#FFFFFF} \lxSVG@fill@opacity{1}\lxSVG@begingroup@{fill-opacity=1} {}\lxSVG@fillstroke\lxSVG@drawpath@unclipped{M 35.98 -53.96 M 35.98 -53.96 L 35.98 -35.98 L 53.96 -35.98 L 53.96 -53.96 Z M 53.96 -35.98}{} \lx@inpgf@ignorespaces
\lxSVG@closescope {{\lx@inpgf@ignorespaces}}\lx@inpgf@ignorespaces\hbox{\hbox{{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}{{}{}{{
{}{}}}{
{}{}}
{{}{{\lx@inpgf@ignorespaces}}}{{}{\lx@inpgf@ignorespaces}}{}{{}{\lx@inpgf@ignorespaces}}
{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lx@inpgf@ignorespaces
\lxSVG@closescope }{{{{\lx@inpgf@ignorespaces}}\lxSVG@begingroup@{_scopebegin=1} \lxSVG@transformcm{1.0}{0.0}{0.0}{1.0}{30.0pt}{-32.5pt}\lxSVG@begingroup@{transform=matrix(1.0 0.0 0.0 1.0 41.51 -44.97)} \pgfsys@hbox{58}\lxSVG@closescope }}}
\lxSVG@closescope }}}
}
\lxSVG@closescope {\lx@inpgf@ignorespaces}{\lx@inpgf@ignorespaces}{\lx@inpgf@ignorespaces}\hss}\lxSVG@discardpath\lxSVG@closescope \hss}}\lxSVG@closescope\endpgfpicture}}.
The one-dimensional sums are computed using B(3,1)⊗B(3,1)⊗B(2,1)⊗B(1,1)B^{(3,1)}\otimes B^{(3,1)}\otimes B^{(2,1)}\otimes B^{(1,1)},
the tensor product of column Kirillov-Reshetikhin crystals of shape
μ′=(3,3,2,1)\mu^{\prime}=(3,3,2,1), that is
⊗⊗⊗.{\hbox to13.3pt{\vbox to39.3pt{\pgfpicture\makeatletter\hbox{\hskip 0.15pt\lower-26.15pt\hbox to0.0pt{\lxSVG@begingroup@{_scopebegin=1} \lxSVG@begingroup@{stroke=#000000} \lxSVG@begingroup@{fill=#000000} \lxSVG@setlinewidth{\the\pgflinewidth}\lxSVG@begingroup@{stroke-width=0.4pt} \lx@inpgf@ignorespaces\nullfont\lxSVG@begingroup@{_scopebegin=1} \lxSVG@closescope \lxSVG@begingroup@{_scopebegin=1} \lxSVG@closescope \hbox to0.0pt{\lxSVG@begingroup@{_scopebegin=1} {{\lx@inpgf@ignorespaces}}{{\lx@inpgf@ignorespaces}}{{\lx@inpgf@ignorespaces}}{{\lx@inpgf@ignorespaces}{{}}{}
{{\lx@inpgf@ignorespaces}{}}{{}}{}{}{}{}{{}}{}\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lxSVG@setlinewidth{\the\pgflinewidth}\lxSVG@begingroup@{stroke-width=0.3pt} \lx@inpgf@ignorespaces\lxSVG@begingroup@{fill=#FFFFFF} \lxSVG@fill@opacity{1}\lxSVG@begingroup@{fill-opacity=1} {}\lxSVG@fillstroke\lxSVG@drawpath@unclipped{M 0 0 M 0 0 L 0 17.99 L 17.99 17.99 L 17.99 0 Z M 17.99 17.99}{} \lx@inpgf@ignorespaces
\lxSVG@closescope {{\lx@inpgf@ignorespaces}}\lx@inpgf@ignorespaces\hbox{\hbox{{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}{{}{}{{
{}{}}}{
{}{}}
{{}{{\lx@inpgf@ignorespaces}}}{{}{\lx@inpgf@ignorespaces}}{}{{}{\lx@inpgf@ignorespaces}}
{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lx@inpgf@ignorespaces
\lxSVG@closescope }{{{{\lx@inpgf@ignorespaces}}\lxSVG@begingroup@{_scopebegin=1} \lxSVG@transformcm{1.0}{0.0}{0.0}{1.0}{4.0pt}{6.5pt}\lxSVG@begingroup@{transform=matrix(1.0 0.0 0.0 1.0 5.53 8.99)} \pgfsys@hbox{58}\lxSVG@closescope }}}
\lxSVG@closescope }}}
{\lx@inpgf@ignorespaces}{{}}{}
{{\lx@inpgf@ignorespaces}{}}{{}}{}{}{}{}{{}}{}\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lxSVG@setlinewidth{\the\pgflinewidth}\lxSVG@begingroup@{stroke-width=0.3pt} \lx@inpgf@ignorespaces\lxSVG@begingroup@{fill=#FFFFFF} \lxSVG@fill@opacity{1}\lxSVG@begingroup@{fill-opacity=1} {}\lxSVG@fillstroke\lxSVG@drawpath@unclipped{M 0 -17.99 M 0 -17.99 L 0 0 L 17.99 0 L 17.99 -17.99 Z M 17.99 0}{} \lx@inpgf@ignorespaces
\lxSVG@closescope {{\lx@inpgf@ignorespaces}}\lx@inpgf@ignorespaces\hbox{\hbox{{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}{{}{}{{
{}{}}}{
{}{}}
{{}{{\lx@inpgf@ignorespaces}}}{{}{\lx@inpgf@ignorespaces}}{}{{}{\lx@inpgf@ignorespaces}}
{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lx@inpgf@ignorespaces
\lxSVG@closescope }{{{{\lx@inpgf@ignorespaces}}\lxSVG@begingroup@{_scopebegin=1} \lxSVG@transformcm{1.0}{0.0}{0.0}{1.0}{4.0pt}{-6.5pt}\lxSVG@begingroup@{transform=matrix(1.0 0.0 0.0 1.0 5.53 -8.99)} \pgfsys@hbox{58}\lxSVG@closescope }}}
\lxSVG@closescope }}}
{\lx@inpgf@ignorespaces}{{}}{}
{{\lx@inpgf@ignorespaces}{}}{{}}{}{}{}{}{{}}{}\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lxSVG@setlinewidth{\the\pgflinewidth}\lxSVG@begingroup@{stroke-width=0.3pt} \lx@inpgf@ignorespaces\lxSVG@begingroup@{fill=#FFFFFF} \lxSVG@fill@opacity{1}\lxSVG@begingroup@{fill-opacity=1} {}\lxSVG@fillstroke\lxSVG@drawpath@unclipped{M 0 -35.98 M 0 -35.98 L 0 -17.99 L 17.99 -17.99 L 17.99 -35.98 Z M 17.99 -17.99}{} \lx@inpgf@ignorespaces
\lxSVG@closescope {{\lx@inpgf@ignorespaces}}\lx@inpgf@ignorespaces\hbox{\hbox{{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}{{}{}{{
{}{}}}{
{}{}}
{{}{{\lx@inpgf@ignorespaces}}}{{}{\lx@inpgf@ignorespaces}}{}{{}{\lx@inpgf@ignorespaces}}
{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lx@inpgf@ignorespaces
\lxSVG@closescope }{{{{\lx@inpgf@ignorespaces}}\lxSVG@begingroup@{_scopebegin=1} \lxSVG@transformcm{1.0}{0.0}{0.0}{1.0}{4.0pt}{-19.5pt}\lxSVG@begingroup@{transform=matrix(1.0 0.0 0.0 1.0 5.53 -26.98)} \pgfsys@hbox{58}\lxSVG@closescope }}}
\lxSVG@closescope }}}
}
\lxSVG@closescope {\lx@inpgf@ignorespaces}{\lx@inpgf@ignorespaces}{\lx@inpgf@ignorespaces}\hss}\lxSVG@discardpath\lxSVG@closescope \hss}}\lxSVG@closescope\endpgfpicture}}\otimes\hbox to13.3pt{\vbox to39.3pt{\pgfpicture\makeatletter\hbox{\hskip 0.15pt\lower-26.15pt\hbox to0.0pt{\lxSVG@begingroup@{_scopebegin=1} \lxSVG@begingroup@{stroke=#000000} \lxSVG@begingroup@{fill=#000000} \lxSVG@setlinewidth{\the\pgflinewidth}\lxSVG@begingroup@{stroke-width=0.4pt} \lx@inpgf@ignorespaces\nullfont\lxSVG@begingroup@{_scopebegin=1} \lxSVG@closescope \lxSVG@begingroup@{_scopebegin=1} \lxSVG@closescope \hbox to0.0pt{\lxSVG@begingroup@{_scopebegin=1} {{\lx@inpgf@ignorespaces}}{{\lx@inpgf@ignorespaces}}{{\lx@inpgf@ignorespaces}}{{\lx@inpgf@ignorespaces}{{}}{}
{{\lx@inpgf@ignorespaces}{}}{{}}{}{}{}{}{{}}{}\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lxSVG@setlinewidth{\the\pgflinewidth}\lxSVG@begingroup@{stroke-width=0.3pt} \lx@inpgf@ignorespaces\lxSVG@begingroup@{fill=#FFFFFF} \lxSVG@fill@opacity{1}\lxSVG@begingroup@{fill-opacity=1} {}\lxSVG@fillstroke\lxSVG@drawpath@unclipped{M 0 0 M 0 0 L 0 17.99 L 17.99 17.99 L 17.99 0 Z M 17.99 17.99}{} \lx@inpgf@ignorespaces
\lxSVG@closescope {{\lx@inpgf@ignorespaces}}\lx@inpgf@ignorespaces\hbox{\hbox{{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}{{}{}{{
{}{}}}{
{}{}}
{{}{{\lx@inpgf@ignorespaces}}}{{}{\lx@inpgf@ignorespaces}}{}{{}{\lx@inpgf@ignorespaces}}
{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lx@inpgf@ignorespaces
\lxSVG@closescope }{{{{\lx@inpgf@ignorespaces}}\lxSVG@begingroup@{_scopebegin=1} \lxSVG@transformcm{1.0}{0.0}{0.0}{1.0}{4.0pt}{6.5pt}\lxSVG@begingroup@{transform=matrix(1.0 0.0 0.0 1.0 5.53 8.99)} \pgfsys@hbox{58}\lxSVG@closescope }}}
\lxSVG@closescope }}}
{\lx@inpgf@ignorespaces}{{}}{}
{{\lx@inpgf@ignorespaces}{}}{{}}{}{}{}{}{{}}{}\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lxSVG@setlinewidth{\the\pgflinewidth}\lxSVG@begingroup@{stroke-width=0.3pt} \lx@inpgf@ignorespaces\lxSVG@begingroup@{fill=#FFFFFF} \lxSVG@fill@opacity{1}\lxSVG@begingroup@{fill-opacity=1} {}\lxSVG@fillstroke\lxSVG@drawpath@unclipped{M 0 -17.99 M 0 -17.99 L 0 0 L 17.99 0 L 17.99 -17.99 Z M 17.99 0}{} \lx@inpgf@ignorespaces
\lxSVG@closescope {{\lx@inpgf@ignorespaces}}\lx@inpgf@ignorespaces\hbox{\hbox{{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}{{}{}{{
{}{}}}{
{}{}}
{{}{{\lx@inpgf@ignorespaces}}}{{}{\lx@inpgf@ignorespaces}}{}{{}{\lx@inpgf@ignorespaces}}
{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lx@inpgf@ignorespaces
\lxSVG@closescope }{{{{\lx@inpgf@ignorespaces}}\lxSVG@begingroup@{_scopebegin=1} \lxSVG@transformcm{1.0}{0.0}{0.0}{1.0}{4.0pt}{-6.5pt}\lxSVG@begingroup@{transform=matrix(1.0 0.0 0.0 1.0 5.53 -8.99)} \pgfsys@hbox{58}\lxSVG@closescope }}}
\lxSVG@closescope }}}
{\lx@inpgf@ignorespaces}{{}}{}
{{\lx@inpgf@ignorespaces}{}}{{}}{}{}{}{}{{}}{}\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lxSVG@setlinewidth{\the\pgflinewidth}\lxSVG@begingroup@{stroke-width=0.3pt} \lx@inpgf@ignorespaces\lxSVG@begingroup@{fill=#FFFFFF} \lxSVG@fill@opacity{1}\lxSVG@begingroup@{fill-opacity=1} {}\lxSVG@fillstroke\lxSVG@drawpath@unclipped{M 0 -35.98 M 0 -35.98 L 0 -17.99 L 17.99 -17.99 L 17.99 -35.98 Z M 17.99 -17.99}{} \lx@inpgf@ignorespaces
\lxSVG@closescope {{\lx@inpgf@ignorespaces}}\lx@inpgf@ignorespaces\hbox{\hbox{{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}{{}{}{{
{}{}}}{
{}{}}
{{}{{\lx@inpgf@ignorespaces}}}{{}{\lx@inpgf@ignorespaces}}{}{{}{\lx@inpgf@ignorespaces}}
{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lx@inpgf@ignorespaces
\lxSVG@closescope }{{{{\lx@inpgf@ignorespaces}}\lxSVG@begingroup@{_scopebegin=1} \lxSVG@transformcm{1.0}{0.0}{0.0}{1.0}{4.0pt}{-19.5pt}\lxSVG@begingroup@{transform=matrix(1.0 0.0 0.0 1.0 5.53 -26.98)} \pgfsys@hbox{58}\lxSVG@closescope }}}
\lxSVG@closescope }}}
}
\lxSVG@closescope {\lx@inpgf@ignorespaces}{\lx@inpgf@ignorespaces}{\lx@inpgf@ignorespaces}\hss}\lxSVG@discardpath\lxSVG@closescope \hss}}\lxSVG@closescope\endpgfpicture}}\otimes\hbox to13.3pt{\vbox to26.3pt{\pgfpicture\makeatletter\hbox{\hskip 0.15pt\lower-13.15pt\hbox to0.0pt{\lxSVG@begingroup@{_scopebegin=1} \lxSVG@begingroup@{stroke=#000000} \lxSVG@begingroup@{fill=#000000} \lxSVG@setlinewidth{\the\pgflinewidth}\lxSVG@begingroup@{stroke-width=0.4pt} \lx@inpgf@ignorespaces\nullfont\lxSVG@begingroup@{_scopebegin=1} \lxSVG@closescope \lxSVG@begingroup@{_scopebegin=1} \lxSVG@closescope \hbox to0.0pt{\lxSVG@begingroup@{_scopebegin=1} {{\lx@inpgf@ignorespaces}}{{\lx@inpgf@ignorespaces}}{{\lx@inpgf@ignorespaces}}{{\lx@inpgf@ignorespaces}{{}}{}
{{\lx@inpgf@ignorespaces}{}}{{}}{}{}{}{}{{}}{}\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lxSVG@setlinewidth{\the\pgflinewidth}\lxSVG@begingroup@{stroke-width=0.3pt} \lx@inpgf@ignorespaces\lxSVG@begingroup@{fill=#FFFFFF} \lxSVG@fill@opacity{1}\lxSVG@begingroup@{fill-opacity=1} {}\lxSVG@fillstroke\lxSVG@drawpath@unclipped{M 0 0 M 0 0 L 0 17.99 L 17.99 17.99 L 17.99 0 Z M 17.99 17.99}{} \lx@inpgf@ignorespaces
\lxSVG@closescope {{\lx@inpgf@ignorespaces}}\lx@inpgf@ignorespaces\hbox{\hbox{{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}{{}{}{{
{}{}}}{
{}{}}
{{}{{\lx@inpgf@ignorespaces}}}{{}{\lx@inpgf@ignorespaces}}{}{{}{\lx@inpgf@ignorespaces}}
{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lx@inpgf@ignorespaces
\lxSVG@closescope }{{{{\lx@inpgf@ignorespaces}}\lxSVG@begingroup@{_scopebegin=1} \lxSVG@transformcm{1.0}{0.0}{0.0}{1.0}{4.0pt}{6.5pt}\lxSVG@begingroup@{transform=matrix(1.0 0.0 0.0 1.0 5.53 8.99)} \pgfsys@hbox{58}\lxSVG@closescope }}}
\lxSVG@closescope }}}
{\lx@inpgf@ignorespaces}{{}}{}
{{\lx@inpgf@ignorespaces}{}}{{}}{}{}{}{}{{}}{}\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lxSVG@setlinewidth{\the\pgflinewidth}\lxSVG@begingroup@{stroke-width=0.3pt} \lx@inpgf@ignorespaces\lxSVG@begingroup@{fill=#FFFFFF} \lxSVG@fill@opacity{1}\lxSVG@begingroup@{fill-opacity=1} {}\lxSVG@fillstroke\lxSVG@drawpath@unclipped{M 0 -17.99 M 0 -17.99 L 0 0 L 17.99 0 L 17.99 -17.99 Z M 17.99 0}{} \lx@inpgf@ignorespaces
\lxSVG@closescope {{\lx@inpgf@ignorespaces}}\lx@inpgf@ignorespaces\hbox{\hbox{{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}{{}{}{{
{}{}}}{
{}{}}
{{}{{\lx@inpgf@ignorespaces}}}{{}{\lx@inpgf@ignorespaces}}{}{{}{\lx@inpgf@ignorespaces}}
{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lx@inpgf@ignorespaces
\lxSVG@closescope }{{{{\lx@inpgf@ignorespaces}}\lxSVG@begingroup@{_scopebegin=1} \lxSVG@transformcm{1.0}{0.0}{0.0}{1.0}{4.0pt}{-6.5pt}\lxSVG@begingroup@{transform=matrix(1.0 0.0 0.0 1.0 5.53 -8.99)} \pgfsys@hbox{58}\lxSVG@closescope }}}
\lxSVG@closescope }}}
}
\lxSVG@closescope {\lx@inpgf@ignorespaces}{\lx@inpgf@ignorespaces}{\lx@inpgf@ignorespaces}\hss}\lxSVG@discardpath\lxSVG@closescope \hss}}\lxSVG@closescope\endpgfpicture}}\otimes\hbox to13.3pt{\vbox to13.3pt{\pgfpicture\makeatletter\hbox{\hskip 0.15pt\lower-0.15pt\hbox to0.0pt{\lxSVG@begingroup@{_scopebegin=1} \lxSVG@begingroup@{stroke=#000000} \lxSVG@begingroup@{fill=#000000} \lxSVG@setlinewidth{\the\pgflinewidth}\lxSVG@begingroup@{stroke-width=0.4pt} \lx@inpgf@ignorespaces\nullfont\lxSVG@begingroup@{_scopebegin=1} \lxSVG@closescope \lxSVG@begingroup@{_scopebegin=1} \lxSVG@closescope \hbox to0.0pt{\lxSVG@begingroup@{_scopebegin=1} {{\lx@inpgf@ignorespaces}}{{\lx@inpgf@ignorespaces}}{{\lx@inpgf@ignorespaces}}{{\lx@inpgf@ignorespaces}{{}}{}
{{\lx@inpgf@ignorespaces}{}}{{}}{}{}{}{}{{}}{}\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lxSVG@setlinewidth{\the\pgflinewidth}\lxSVG@begingroup@{stroke-width=0.3pt} \lx@inpgf@ignorespaces\lxSVG@begingroup@{fill=#FFFFFF} \lxSVG@fill@opacity{1}\lxSVG@begingroup@{fill-opacity=1} {}\lxSVG@fillstroke\lxSVG@drawpath@unclipped{M 0 0 M 0 0 L 0 17.99 L 17.99 17.99 L 17.99 0 Z M 17.99 17.99}{} \lx@inpgf@ignorespaces
\lxSVG@closescope {{\lx@inpgf@ignorespaces}}\lx@inpgf@ignorespaces\hbox{\hbox{{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}{{}{}{{
{}{}}}{
{}{}}
{{}{{\lx@inpgf@ignorespaces}}}{{}{\lx@inpgf@ignorespaces}}{}{{}{\lx@inpgf@ignorespaces}}
{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lx@inpgf@ignorespaces
\lxSVG@closescope }{{{{\lx@inpgf@ignorespaces}}\lxSVG@begingroup@{_scopebegin=1} \lxSVG@transformcm{1.0}{0.0}{0.0}{1.0}{4.0pt}{6.5pt}\lxSVG@begingroup@{transform=matrix(1.0 0.0 0.0 1.0 5.53 8.99)} \pgfsys@hbox{58}\lxSVG@closescope }}}
\lxSVG@closescope }}}
}
\lxSVG@closescope {\lx@inpgf@ignorespaces}{\lx@inpgf@ignorespaces}{\lx@inpgf@ignorespaces}\hss}\lxSVG@discardpath\lxSVG@closescope \hss}}\lxSVG@closescope\endpgfpicture}}}.
9.1. Type An−1(1)A_{n-1}^{(1)}
This is the classical setting of [35], which does not require μ^\widehat{\mu} nor λ^\widehat{\lambda},
but μ′\mu^{\prime} and λ′\lambda^{\prime} instead.
Let us first compute the one-dimensional sum Xλ,μ(q)X_{\lambda,\mu}(q), which can be done for instance in Sage.
We get the following three highest weight vertices with corresponding energy function:
Highest weight vertexEnergy⊗⊗⊗4⊗⊗⊗2⊗⊗⊗3\begin{array}[]{ll}\hline\cr\text{Highest weight vertex}&\text{Energy}\\
\hline\cr{\scriptsize\hbox to13.3pt{\vbox to39.3pt{\pgfpicture\makeatletter\hbox{\hskip 0.15pt\lower-26.15pt\hbox to0.0pt{\lxSVG@begingroup@{_scopebegin=1} \lxSVG@begingroup@{stroke=#000000} \lxSVG@begingroup@{fill=#000000} \lxSVG@setlinewidth{\the\pgflinewidth}\lxSVG@begingroup@{stroke-width=0.4pt} \lx@inpgf@ignorespaces\nullfont\lxSVG@begingroup@{_scopebegin=1} \lxSVG@closescope \lxSVG@begingroup@{_scopebegin=1} \lxSVG@closescope \hbox to0.0pt{\lxSVG@begingroup@{_scopebegin=1} {{\lx@inpgf@ignorespaces}}{{\lx@inpgf@ignorespaces}}{{\lx@inpgf@ignorespaces}}{{\lx@inpgf@ignorespaces}{{}}{}
{{\lx@inpgf@ignorespaces}{}}{{}}{}{}{}{}{{}}{}\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lxSVG@setlinewidth{\the\pgflinewidth}\lxSVG@begingroup@{stroke-width=0.3pt} \lx@inpgf@ignorespaces\lxSVG@begingroup@{fill=#FFFFFF} \lxSVG@fill@opacity{1}\lxSVG@begingroup@{fill-opacity=1} {}\lxSVG@fillstroke\lxSVG@drawpath@unclipped{M 0 0 M 0 0 L 0 17.99 L 17.99 17.99 L 17.99 0 Z M 17.99 17.99}{} \lx@inpgf@ignorespaces
\lxSVG@closescope {{\lx@inpgf@ignorespaces}}\lx@inpgf@ignorespaces\hbox{\hbox{{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}{{}{}{{
{}{}}}{
{}{}}
{{}{{\lx@inpgf@ignorespaces}}}{{}{\lx@inpgf@ignorespaces}}{}{{}{\lx@inpgf@ignorespaces}}
{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lx@inpgf@ignorespaces
\lxSVG@closescope }{{{{\lx@inpgf@ignorespaces}}\lxSVG@begingroup@{_scopebegin=1} \lxSVG@transformcm{1.0}{0.0}{0.0}{1.0}{2.51387pt}{4.24445pt}\lxSVG@begingroup@{transform=matrix(1.0 0.0 0.0 1.0 3.48 5.87)} \pgfsys@hbox{58}\lxSVG@closescope }}}
\lxSVG@closescope }}}
{\lx@inpgf@ignorespaces}{{}}{}
{{\lx@inpgf@ignorespaces}{}}{{}}{}{}{}{}{{}}{}\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lxSVG@setlinewidth{\the\pgflinewidth}\lxSVG@begingroup@{stroke-width=0.3pt} \lx@inpgf@ignorespaces\lxSVG@begingroup@{fill=#FFFFFF} \lxSVG@fill@opacity{1}\lxSVG@begingroup@{fill-opacity=1} {}\lxSVG@fillstroke\lxSVG@drawpath@unclipped{M 0 -17.99 M 0 -17.99 L 0 0 L 17.99 0 L 17.99 -17.99 Z M 17.99 0}{} \lx@inpgf@ignorespaces
\lxSVG@closescope {{\lx@inpgf@ignorespaces}}\lx@inpgf@ignorespaces\hbox{\hbox{{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}{{}{}{{
{}{}}}{
{}{}}
{{}{{\lx@inpgf@ignorespaces}}}{{}{\lx@inpgf@ignorespaces}}{}{{}{\lx@inpgf@ignorespaces}}
{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lx@inpgf@ignorespaces
\lxSVG@closescope }{{{{\lx@inpgf@ignorespaces}}\lxSVG@begingroup@{_scopebegin=1} \lxSVG@transformcm{1.0}{0.0}{0.0}{1.0}{2.51387pt}{-8.75555pt}\lxSVG@begingroup@{transform=matrix(1.0 0.0 0.0 1.0 3.48 -12.12)} \pgfsys@hbox{58}\lxSVG@closescope }}}
\lxSVG@closescope }}}
{\lx@inpgf@ignorespaces}{{}}{}
{{\lx@inpgf@ignorespaces}{}}{{}}{}{}{}{}{{}}{}\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lxSVG@setlinewidth{\the\pgflinewidth}\lxSVG@begingroup@{stroke-width=0.3pt} \lx@inpgf@ignorespaces\lxSVG@begingroup@{fill=#FFFFFF} \lxSVG@fill@opacity{1}\lxSVG@begingroup@{fill-opacity=1} {}\lxSVG@fillstroke\lxSVG@drawpath@unclipped{M 0 -35.98 M 0 -35.98 L 0 -17.99 L 17.99 -17.99 L 17.99 -35.98 Z M 17.99 -17.99}{} \lx@inpgf@ignorespaces
\lxSVG@closescope {{\lx@inpgf@ignorespaces}}\lx@inpgf@ignorespaces\hbox{\hbox{{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}{{}{}{{
{}{}}}{
{}{}}
{{}{{\lx@inpgf@ignorespaces}}}{{}{\lx@inpgf@ignorespaces}}{}{{}{\lx@inpgf@ignorespaces}}
{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lx@inpgf@ignorespaces
\lxSVG@closescope }{{{{\lx@inpgf@ignorespaces}}\lxSVG@begingroup@{_scopebegin=1} \lxSVG@transformcm{1.0}{0.0}{0.0}{1.0}{2.51387pt}{-21.75555pt}\lxSVG@begingroup@{transform=matrix(1.0 0.0 0.0 1.0 3.48 -30.1)} \pgfsys@hbox{58}\lxSVG@closescope }}}
\lxSVG@closescope }}}
}
\lxSVG@closescope {\lx@inpgf@ignorespaces}{\lx@inpgf@ignorespaces}{\lx@inpgf@ignorespaces}\hss}\lxSVG@discardpath\lxSVG@closescope \hss}}\lxSVG@closescope\endpgfpicture}}\otimes\hbox to13.3pt{\vbox to39.3pt{\pgfpicture\makeatletter\hbox{\hskip 0.15pt\lower-26.15pt\hbox to0.0pt{\lxSVG@begingroup@{_scopebegin=1} \lxSVG@begingroup@{stroke=#000000} \lxSVG@begingroup@{fill=#000000} \lxSVG@setlinewidth{\the\pgflinewidth}\lxSVG@begingroup@{stroke-width=0.4pt} \lx@inpgf@ignorespaces\nullfont\lxSVG@begingroup@{_scopebegin=1} \lxSVG@closescope \lxSVG@begingroup@{_scopebegin=1} \lxSVG@closescope \hbox to0.0pt{\lxSVG@begingroup@{_scopebegin=1} {{\lx@inpgf@ignorespaces}}{{\lx@inpgf@ignorespaces}}{{\lx@inpgf@ignorespaces}}{{\lx@inpgf@ignorespaces}{{}}{}
{{\lx@inpgf@ignorespaces}{}}{{}}{}{}{}{}{{}}{}\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lxSVG@setlinewidth{\the\pgflinewidth}\lxSVG@begingroup@{stroke-width=0.3pt} \lx@inpgf@ignorespaces\lxSVG@begingroup@{fill=#FFFFFF} \lxSVG@fill@opacity{1}\lxSVG@begingroup@{fill-opacity=1} {}\lxSVG@fillstroke\lxSVG@drawpath@unclipped{M 0 0 M 0 0 L 0 17.99 L 17.99 17.99 L 17.99 0 Z M 17.99 17.99}{} \lx@inpgf@ignorespaces
\lxSVG@closescope {{\lx@inpgf@ignorespaces}}\lx@inpgf@ignorespaces\hbox{\hbox{{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}{{}{}{{
{}{}}}{
{}{}}
{{}{{\lx@inpgf@ignorespaces}}}{{}{\lx@inpgf@ignorespaces}}{}{{}{\lx@inpgf@ignorespaces}}
{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lx@inpgf@ignorespaces
\lxSVG@closescope }{{{{\lx@inpgf@ignorespaces}}\lxSVG@begingroup@{_scopebegin=1} \lxSVG@transformcm{1.0}{0.0}{0.0}{1.0}{2.51387pt}{4.24445pt}\lxSVG@begingroup@{transform=matrix(1.0 0.0 0.0 1.0 3.48 5.87)} \pgfsys@hbox{58}\lxSVG@closescope }}}
\lxSVG@closescope }}}
{\lx@inpgf@ignorespaces}{{}}{}
{{\lx@inpgf@ignorespaces}{}}{{}}{}{}{}{}{{}}{}\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lxSVG@setlinewidth{\the\pgflinewidth}\lxSVG@begingroup@{stroke-width=0.3pt} \lx@inpgf@ignorespaces\lxSVG@begingroup@{fill=#FFFFFF} \lxSVG@fill@opacity{1}\lxSVG@begingroup@{fill-opacity=1} {}\lxSVG@fillstroke\lxSVG@drawpath@unclipped{M 0 -17.99 M 0 -17.99 L 0 0 L 17.99 0 L 17.99 -17.99 Z M 17.99 0}{} \lx@inpgf@ignorespaces
\lxSVG@closescope {{\lx@inpgf@ignorespaces}}\lx@inpgf@ignorespaces\hbox{\hbox{{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}{{}{}{{
{}{}}}{
{}{}}
{{}{{\lx@inpgf@ignorespaces}}}{{}{\lx@inpgf@ignorespaces}}{}{{}{\lx@inpgf@ignorespaces}}
{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lx@inpgf@ignorespaces
\lxSVG@closescope }{{{{\lx@inpgf@ignorespaces}}\lxSVG@begingroup@{_scopebegin=1} \lxSVG@transformcm{1.0}{0.0}{0.0}{1.0}{2.51387pt}{-8.75555pt}\lxSVG@begingroup@{transform=matrix(1.0 0.0 0.0 1.0 3.48 -12.12)} \pgfsys@hbox{58}\lxSVG@closescope }}}
\lxSVG@closescope }}}
{\lx@inpgf@ignorespaces}{{}}{}
{{\lx@inpgf@ignorespaces}{}}{{}}{}{}{}{}{{}}{}\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lxSVG@setlinewidth{\the\pgflinewidth}\lxSVG@begingroup@{stroke-width=0.3pt} \lx@inpgf@ignorespaces\lxSVG@begingroup@{fill=#FFFFFF} \lxSVG@fill@opacity{1}\lxSVG@begingroup@{fill-opacity=1} {}\lxSVG@fillstroke\lxSVG@drawpath@unclipped{M 0 -35.98 M 0 -35.98 L 0 -17.99 L 17.99 -17.99 L 17.99 -35.98 Z M 17.99 -17.99}{} \lx@inpgf@ignorespaces
\lxSVG@closescope {{\lx@inpgf@ignorespaces}}\lx@inpgf@ignorespaces\hbox{\hbox{{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}{{}{}{{
{}{}}}{
{}{}}
{{}{{\lx@inpgf@ignorespaces}}}{{}{\lx@inpgf@ignorespaces}}{}{{}{\lx@inpgf@ignorespaces}}
{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lx@inpgf@ignorespaces
\lxSVG@closescope }{{{{\lx@inpgf@ignorespaces}}\lxSVG@begingroup@{_scopebegin=1} \lxSVG@transformcm{1.0}{0.0}{0.0}{1.0}{2.51387pt}{-21.75555pt}\lxSVG@begingroup@{transform=matrix(1.0 0.0 0.0 1.0 3.48 -30.1)} \pgfsys@hbox{58}\lxSVG@closescope }}}
\lxSVG@closescope }}}
}
\lxSVG@closescope {\lx@inpgf@ignorespaces}{\lx@inpgf@ignorespaces}{\lx@inpgf@ignorespaces}\hss}\lxSVG@discardpath\lxSVG@closescope \hss}}\lxSVG@closescope\endpgfpicture}}\otimes\hbox to13.3pt{\vbox to26.3pt{\pgfpicture\makeatletter\hbox{\hskip 0.15pt\lower-13.15pt\hbox to0.0pt{\lxSVG@begingroup@{_scopebegin=1} \lxSVG@begingroup@{stroke=#000000} \lxSVG@begingroup@{fill=#000000} \lxSVG@setlinewidth{\the\pgflinewidth}\lxSVG@begingroup@{stroke-width=0.4pt} \lx@inpgf@ignorespaces\nullfont\lxSVG@begingroup@{_scopebegin=1} \lxSVG@closescope \lxSVG@begingroup@{_scopebegin=1} \lxSVG@closescope \hbox to0.0pt{\lxSVG@begingroup@{_scopebegin=1} {{\lx@inpgf@ignorespaces}}{{\lx@inpgf@ignorespaces}}{{\lx@inpgf@ignorespaces}}{{\lx@inpgf@ignorespaces}{{}}{}
{{\lx@inpgf@ignorespaces}{}}{{}}{}{}{}{}{{}}{}\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lxSVG@setlinewidth{\the\pgflinewidth}\lxSVG@begingroup@{stroke-width=0.3pt} \lx@inpgf@ignorespaces\lxSVG@begingroup@{fill=#FFFFFF} \lxSVG@fill@opacity{1}\lxSVG@begingroup@{fill-opacity=1} {}\lxSVG@fillstroke\lxSVG@drawpath@unclipped{M 0 0 M 0 0 L 0 17.99 L 17.99 17.99 L 17.99 0 Z M 17.99 17.99}{} \lx@inpgf@ignorespaces
\lxSVG@closescope {{\lx@inpgf@ignorespaces}}\lx@inpgf@ignorespaces\hbox{\hbox{{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}{{}{}{{
{}{}}}{
{}{}}
{{}{{\lx@inpgf@ignorespaces}}}{{}{\lx@inpgf@ignorespaces}}{}{{}{\lx@inpgf@ignorespaces}}
{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lx@inpgf@ignorespaces
\lxSVG@closescope }{{{{\lx@inpgf@ignorespaces}}\lxSVG@begingroup@{_scopebegin=1} \lxSVG@transformcm{1.0}{0.0}{0.0}{1.0}{2.51387pt}{4.24445pt}\lxSVG@begingroup@{transform=matrix(1.0 0.0 0.0 1.0 3.48 5.87)} \pgfsys@hbox{58}\lxSVG@closescope }}}
\lxSVG@closescope }}}
{\lx@inpgf@ignorespaces}{{}}{}
{{\lx@inpgf@ignorespaces}{}}{{}}{}{}{}{}{{}}{}\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lxSVG@setlinewidth{\the\pgflinewidth}\lxSVG@begingroup@{stroke-width=0.3pt} \lx@inpgf@ignorespaces\lxSVG@begingroup@{fill=#FFFFFF} \lxSVG@fill@opacity{1}\lxSVG@begingroup@{fill-opacity=1} {}\lxSVG@fillstroke\lxSVG@drawpath@unclipped{M 0 -17.99 M 0 -17.99 L 0 0 L 17.99 0 L 17.99 -17.99 Z M 17.99 0}{} \lx@inpgf@ignorespaces
\lxSVG@closescope {{\lx@inpgf@ignorespaces}}\lx@inpgf@ignorespaces\hbox{\hbox{{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}{{}{}{{
{}{}}}{
{}{}}
{{}{{\lx@inpgf@ignorespaces}}}{{}{\lx@inpgf@ignorespaces}}{}{{}{\lx@inpgf@ignorespaces}}
{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lx@inpgf@ignorespaces
\lxSVG@closescope }{{{{\lx@inpgf@ignorespaces}}\lxSVG@begingroup@{_scopebegin=1} \lxSVG@transformcm{1.0}{0.0}{0.0}{1.0}{2.51387pt}{-8.75555pt}\lxSVG@begingroup@{transform=matrix(1.0 0.0 0.0 1.0 3.48 -12.12)} \pgfsys@hbox{58}\lxSVG@closescope }}}
\lxSVG@closescope }}}
}
\lxSVG@closescope {\lx@inpgf@ignorespaces}{\lx@inpgf@ignorespaces}{\lx@inpgf@ignorespaces}\hss}\lxSVG@discardpath\lxSVG@closescope \hss}}\lxSVG@closescope\endpgfpicture}}\otimes\hbox to13.3pt{\vbox to13.3pt{\pgfpicture\makeatletter\hbox{\hskip 0.15pt\lower-0.15pt\hbox to0.0pt{\lxSVG@begingroup@{_scopebegin=1} \lxSVG@begingroup@{stroke=#000000} \lxSVG@begingroup@{fill=#000000} \lxSVG@setlinewidth{\the\pgflinewidth}\lxSVG@begingroup@{stroke-width=0.4pt} \lx@inpgf@ignorespaces\nullfont\lxSVG@begingroup@{_scopebegin=1} \lxSVG@closescope \lxSVG@begingroup@{_scopebegin=1} \lxSVG@closescope \hbox to0.0pt{\lxSVG@begingroup@{_scopebegin=1} {{\lx@inpgf@ignorespaces}}{{\lx@inpgf@ignorespaces}}{{\lx@inpgf@ignorespaces}}{{\lx@inpgf@ignorespaces}{{}}{}
{{\lx@inpgf@ignorespaces}{}}{{}}{}{}{}{}{{}}{}\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lxSVG@setlinewidth{\the\pgflinewidth}\lxSVG@begingroup@{stroke-width=0.3pt} \lx@inpgf@ignorespaces\lxSVG@begingroup@{fill=#FFFFFF} \lxSVG@fill@opacity{1}\lxSVG@begingroup@{fill-opacity=1} {}\lxSVG@fillstroke\lxSVG@drawpath@unclipped{M 0 0 M 0 0 L 0 17.99 L 17.99 17.99 L 17.99 0 Z M 17.99 17.99}{} \lx@inpgf@ignorespaces
\lxSVG@closescope {{\lx@inpgf@ignorespaces}}\lx@inpgf@ignorespaces\hbox{\hbox{{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}{{}{}{{
{}{}}}{
{}{}}
{{}{{\lx@inpgf@ignorespaces}}}{{}{\lx@inpgf@ignorespaces}}{}{{}{\lx@inpgf@ignorespaces}}
{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lx@inpgf@ignorespaces
\lxSVG@closescope }{{{{\lx@inpgf@ignorespaces}}\lxSVG@begingroup@{_scopebegin=1} \lxSVG@transformcm{1.0}{0.0}{0.0}{1.0}{2.51387pt}{4.24445pt}\lxSVG@begingroup@{transform=matrix(1.0 0.0 0.0 1.0 3.48 5.87)} \pgfsys@hbox{58}\lxSVG@closescope }}}
\lxSVG@closescope }}}
}
\lxSVG@closescope {\lx@inpgf@ignorespaces}{\lx@inpgf@ignorespaces}{\lx@inpgf@ignorespaces}\hss}\lxSVG@discardpath\lxSVG@closescope \hss}}\lxSVG@closescope\endpgfpicture}}}\par&4\\
{\scriptsize\hbox to13.3pt{\vbox to39.3pt{\pgfpicture\makeatletter\hbox{\hskip 0.15pt\lower-26.15pt\hbox to0.0pt{\lxSVG@begingroup@{_scopebegin=1} \lxSVG@begingroup@{stroke=#000000} \lxSVG@begingroup@{fill=#000000} \lxSVG@setlinewidth{\the\pgflinewidth}\lxSVG@begingroup@{stroke-width=0.4pt} \lx@inpgf@ignorespaces\nullfont\lxSVG@begingroup@{_scopebegin=1} \lxSVG@closescope \lxSVG@begingroup@{_scopebegin=1} \lxSVG@closescope \hbox to0.0pt{\lxSVG@begingroup@{_scopebegin=1} {{\lx@inpgf@ignorespaces}}{{\lx@inpgf@ignorespaces}}{{\lx@inpgf@ignorespaces}}{{\lx@inpgf@ignorespaces}{{}}{}
{{\lx@inpgf@ignorespaces}{}}{{}}{}{}{}{}{{}}{}\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lxSVG@setlinewidth{\the\pgflinewidth}\lxSVG@begingroup@{stroke-width=0.3pt} \lx@inpgf@ignorespaces\lxSVG@begingroup@{fill=#FFFFFF} \lxSVG@fill@opacity{1}\lxSVG@begingroup@{fill-opacity=1} {}\lxSVG@fillstroke\lxSVG@drawpath@unclipped{M 0 0 M 0 0 L 0 17.99 L 17.99 17.99 L 17.99 0 Z M 17.99 17.99}{} \lx@inpgf@ignorespaces
\lxSVG@closescope {{\lx@inpgf@ignorespaces}}\lx@inpgf@ignorespaces\hbox{\hbox{{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}{{}{}{{
{}{}}}{
{}{}}
{{}{{\lx@inpgf@ignorespaces}}}{{}{\lx@inpgf@ignorespaces}}{}{{}{\lx@inpgf@ignorespaces}}
{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lx@inpgf@ignorespaces
\lxSVG@closescope }{{{{\lx@inpgf@ignorespaces}}\lxSVG@begingroup@{_scopebegin=1} \lxSVG@transformcm{1.0}{0.0}{0.0}{1.0}{2.51387pt}{4.24445pt}\lxSVG@begingroup@{transform=matrix(1.0 0.0 0.0 1.0 3.48 5.87)} \pgfsys@hbox{58}\lxSVG@closescope }}}
\lxSVG@closescope }}}
{\lx@inpgf@ignorespaces}{{}}{}
{{\lx@inpgf@ignorespaces}{}}{{}}{}{}{}{}{{}}{}\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lxSVG@setlinewidth{\the\pgflinewidth}\lxSVG@begingroup@{stroke-width=0.3pt} \lx@inpgf@ignorespaces\lxSVG@begingroup@{fill=#FFFFFF} \lxSVG@fill@opacity{1}\lxSVG@begingroup@{fill-opacity=1} {}\lxSVG@fillstroke\lxSVG@drawpath@unclipped{M 0 -17.99 M 0 -17.99 L 0 0 L 17.99 0 L 17.99 -17.99 Z M 17.99 0}{} \lx@inpgf@ignorespaces
\lxSVG@closescope {{\lx@inpgf@ignorespaces}}\lx@inpgf@ignorespaces\hbox{\hbox{{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}{{}{}{{
{}{}}}{
{}{}}
{{}{{\lx@inpgf@ignorespaces}}}{{}{\lx@inpgf@ignorespaces}}{}{{}{\lx@inpgf@ignorespaces}}
{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lx@inpgf@ignorespaces
\lxSVG@closescope }{{{{\lx@inpgf@ignorespaces}}\lxSVG@begingroup@{_scopebegin=1} \lxSVG@transformcm{1.0}{0.0}{0.0}{1.0}{2.51387pt}{-8.75555pt}\lxSVG@begingroup@{transform=matrix(1.0 0.0 0.0 1.0 3.48 -12.12)} \pgfsys@hbox{58}\lxSVG@closescope }}}
\lxSVG@closescope }}}
{\lx@inpgf@ignorespaces}{{}}{}
{{\lx@inpgf@ignorespaces}{}}{{}}{}{}{}{}{{}}{}\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lxSVG@setlinewidth{\the\pgflinewidth}\lxSVG@begingroup@{stroke-width=0.3pt} \lx@inpgf@ignorespaces\lxSVG@begingroup@{fill=#FFFFFF} \lxSVG@fill@opacity{1}\lxSVG@begingroup@{fill-opacity=1} {}\lxSVG@fillstroke\lxSVG@drawpath@unclipped{M 0 -35.98 M 0 -35.98 L 0 -17.99 L 17.99 -17.99 L 17.99 -35.98 Z M 17.99 -17.99}{} \lx@inpgf@ignorespaces
\lxSVG@closescope {{\lx@inpgf@ignorespaces}}\lx@inpgf@ignorespaces\hbox{\hbox{{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}{{}{}{{
{}{}}}{
{}{}}
{{}{{\lx@inpgf@ignorespaces}}}{{}{\lx@inpgf@ignorespaces}}{}{{}{\lx@inpgf@ignorespaces}}
{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lx@inpgf@ignorespaces
\lxSVG@closescope }{{{{\lx@inpgf@ignorespaces}}\lxSVG@begingroup@{_scopebegin=1} \lxSVG@transformcm{1.0}{0.0}{0.0}{1.0}{2.51387pt}{-21.75555pt}\lxSVG@begingroup@{transform=matrix(1.0 0.0 0.0 1.0 3.48 -30.1)} \pgfsys@hbox{58}\lxSVG@closescope }}}
\lxSVG@closescope }}}
}
\lxSVG@closescope {\lx@inpgf@ignorespaces}{\lx@inpgf@ignorespaces}{\lx@inpgf@ignorespaces}\hss}\lxSVG@discardpath\lxSVG@closescope \hss}}\lxSVG@closescope\endpgfpicture}}\otimes\hbox to13.3pt{\vbox to39.3pt{\pgfpicture\makeatletter\hbox{\hskip 0.15pt\lower-26.15pt\hbox to0.0pt{\lxSVG@begingroup@{_scopebegin=1} \lxSVG@begingroup@{stroke=#000000} \lxSVG@begingroup@{fill=#000000} \lxSVG@setlinewidth{\the\pgflinewidth}\lxSVG@begingroup@{stroke-width=0.4pt} \lx@inpgf@ignorespaces\nullfont\lxSVG@begingroup@{_scopebegin=1} \lxSVG@closescope \lxSVG@begingroup@{_scopebegin=1} \lxSVG@closescope \hbox to0.0pt{\lxSVG@begingroup@{_scopebegin=1} {{\lx@inpgf@ignorespaces}}{{\lx@inpgf@ignorespaces}}{{\lx@inpgf@ignorespaces}}{{\lx@inpgf@ignorespaces}{{}}{}
{{\lx@inpgf@ignorespaces}{}}{{}}{}{}{}{}{{}}{}\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lxSVG@setlinewidth{\the\pgflinewidth}\lxSVG@begingroup@{stroke-width=0.3pt} \lx@inpgf@ignorespaces\lxSVG@begingroup@{fill=#FFFFFF} \lxSVG@fill@opacity{1}\lxSVG@begingroup@{fill-opacity=1} {}\lxSVG@fillstroke\lxSVG@drawpath@unclipped{M 0 0 M 0 0 L 0 17.99 L 17.99 17.99 L 17.99 0 Z M 17.99 17.99}{} \lx@inpgf@ignorespaces
\lxSVG@closescope {{\lx@inpgf@ignorespaces}}\lx@inpgf@ignorespaces\hbox{\hbox{{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}{{}{}{{
{}{}}}{
{}{}}
{{}{{\lx@inpgf@ignorespaces}}}{{}{\lx@inpgf@ignorespaces}}{}{{}{\lx@inpgf@ignorespaces}}
{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lx@inpgf@ignorespaces
\lxSVG@closescope }{{{{\lx@inpgf@ignorespaces}}\lxSVG@begingroup@{_scopebegin=1} \lxSVG@transformcm{1.0}{0.0}{0.0}{1.0}{2.51387pt}{4.24445pt}\lxSVG@begingroup@{transform=matrix(1.0 0.0 0.0 1.0 3.48 5.87)} \pgfsys@hbox{58}\lxSVG@closescope }}}
\lxSVG@closescope }}}
{\lx@inpgf@ignorespaces}{{}}{}
{{\lx@inpgf@ignorespaces}{}}{{}}{}{}{}{}{{}}{}\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lxSVG@setlinewidth{\the\pgflinewidth}\lxSVG@begingroup@{stroke-width=0.3pt} \lx@inpgf@ignorespaces\lxSVG@begingroup@{fill=#FFFFFF} \lxSVG@fill@opacity{1}\lxSVG@begingroup@{fill-opacity=1} {}\lxSVG@fillstroke\lxSVG@drawpath@unclipped{M 0 -17.99 M 0 -17.99 L 0 0 L 17.99 0 L 17.99 -17.99 Z M 17.99 0}{} \lx@inpgf@ignorespaces
\lxSVG@closescope {{\lx@inpgf@ignorespaces}}\lx@inpgf@ignorespaces\hbox{\hbox{{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}{{}{}{{
{}{}}}{
{}{}}
{{}{{\lx@inpgf@ignorespaces}}}{{}{\lx@inpgf@ignorespaces}}{}{{}{\lx@inpgf@ignorespaces}}
{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lx@inpgf@ignorespaces
\lxSVG@closescope }{{{{\lx@inpgf@ignorespaces}}\lxSVG@begingroup@{_scopebegin=1} \lxSVG@transformcm{1.0}{0.0}{0.0}{1.0}{2.51387pt}{-8.75555pt}\lxSVG@begingroup@{transform=matrix(1.0 0.0 0.0 1.0 3.48 -12.12)} \pgfsys@hbox{58}\lxSVG@closescope }}}
\lxSVG@closescope }}}
{\lx@inpgf@ignorespaces}{{}}{}
{{\lx@inpgf@ignorespaces}{}}{{}}{}{}{}{}{{}}{}\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lxSVG@setlinewidth{\the\pgflinewidth}\lxSVG@begingroup@{stroke-width=0.3pt} \lx@inpgf@ignorespaces\lxSVG@begingroup@{fill=#FFFFFF} \lxSVG@fill@opacity{1}\lxSVG@begingroup@{fill-opacity=1} {}\lxSVG@fillstroke\lxSVG@drawpath@unclipped{M 0 -35.98 M 0 -35.98 L 0 -17.99 L 17.99 -17.99 L 17.99 -35.98 Z M 17.99 -17.99}{} \lx@inpgf@ignorespaces
\lxSVG@closescope {{\lx@inpgf@ignorespaces}}\lx@inpgf@ignorespaces\hbox{\hbox{{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}{{}{}{{
{}{}}}{
{}{}}
{{}{{\lx@inpgf@ignorespaces}}}{{}{\lx@inpgf@ignorespaces}}{}{{}{\lx@inpgf@ignorespaces}}
{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lx@inpgf@ignorespaces
\lxSVG@closescope }{{{{\lx@inpgf@ignorespaces}}\lxSVG@begingroup@{_scopebegin=1} \lxSVG@transformcm{1.0}{0.0}{0.0}{1.0}{2.51387pt}{-21.75555pt}\lxSVG@begingroup@{transform=matrix(1.0 0.0 0.0 1.0 3.48 -30.1)} \pgfsys@hbox{58}\lxSVG@closescope }}}
\lxSVG@closescope }}}
}
\lxSVG@closescope {\lx@inpgf@ignorespaces}{\lx@inpgf@ignorespaces}{\lx@inpgf@ignorespaces}\hss}\lxSVG@discardpath\lxSVG@closescope \hss}}\lxSVG@closescope\endpgfpicture}}\otimes\hbox to13.3pt{\vbox to26.3pt{\pgfpicture\makeatletter\hbox{\hskip 0.15pt\lower-13.15pt\hbox to0.0pt{\lxSVG@begingroup@{_scopebegin=1} \lxSVG@begingroup@{stroke=#000000} \lxSVG@begingroup@{fill=#000000} \lxSVG@setlinewidth{\the\pgflinewidth}\lxSVG@begingroup@{stroke-width=0.4pt} \lx@inpgf@ignorespaces\nullfont\lxSVG@begingroup@{_scopebegin=1} \lxSVG@closescope \lxSVG@begingroup@{_scopebegin=1} \lxSVG@closescope \hbox to0.0pt{\lxSVG@begingroup@{_scopebegin=1} {{\lx@inpgf@ignorespaces}}{{\lx@inpgf@ignorespaces}}{{\lx@inpgf@ignorespaces}}{{\lx@inpgf@ignorespaces}{{}}{}
{{\lx@inpgf@ignorespaces}{}}{{}}{}{}{}{}{{}}{}\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lxSVG@setlinewidth{\the\pgflinewidth}\lxSVG@begingroup@{stroke-width=0.3pt} \lx@inpgf@ignorespaces\lxSVG@begingroup@{fill=#FFFFFF} \lxSVG@fill@opacity{1}\lxSVG@begingroup@{fill-opacity=1} {}\lxSVG@fillstroke\lxSVG@drawpath@unclipped{M 0 0 M 0 0 L 0 17.99 L 17.99 17.99 L 17.99 0 Z M 17.99 17.99}{} \lx@inpgf@ignorespaces
\lxSVG@closescope {{\lx@inpgf@ignorespaces}}\lx@inpgf@ignorespaces\hbox{\hbox{{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}{{}{}{{
{}{}}}{
{}{}}
{{}{{\lx@inpgf@ignorespaces}}}{{}{\lx@inpgf@ignorespaces}}{}{{}{\lx@inpgf@ignorespaces}}
{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lx@inpgf@ignorespaces
\lxSVG@closescope }{{{{\lx@inpgf@ignorespaces}}\lxSVG@begingroup@{_scopebegin=1} \lxSVG@transformcm{1.0}{0.0}{0.0}{1.0}{2.51387pt}{4.24445pt}\lxSVG@begingroup@{transform=matrix(1.0 0.0 0.0 1.0 3.48 5.87)} \pgfsys@hbox{58}\lxSVG@closescope }}}
\lxSVG@closescope }}}
{\lx@inpgf@ignorespaces}{{}}{}
{{\lx@inpgf@ignorespaces}{}}{{}}{}{}{}{}{{}}{}\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lxSVG@setlinewidth{\the\pgflinewidth}\lxSVG@begingroup@{stroke-width=0.3pt} \lx@inpgf@ignorespaces\lxSVG@begingroup@{fill=#FFFFFF} \lxSVG@fill@opacity{1}\lxSVG@begingroup@{fill-opacity=1} {}\lxSVG@fillstroke\lxSVG@drawpath@unclipped{M 0 -17.99 M 0 -17.99 L 0 0 L 17.99 0 L 17.99 -17.99 Z M 17.99 0}{} \lx@inpgf@ignorespaces
\lxSVG@closescope {{\lx@inpgf@ignorespaces}}\lx@inpgf@ignorespaces\hbox{\hbox{{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}{{}{}{{
{}{}}}{
{}{}}
{{}{{\lx@inpgf@ignorespaces}}}{{}{\lx@inpgf@ignorespaces}}{}{{}{\lx@inpgf@ignorespaces}}
{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lx@inpgf@ignorespaces
\lxSVG@closescope }{{{{\lx@inpgf@ignorespaces}}\lxSVG@begingroup@{_scopebegin=1} \lxSVG@transformcm{1.0}{0.0}{0.0}{1.0}{2.51387pt}{-8.75555pt}\lxSVG@begingroup@{transform=matrix(1.0 0.0 0.0 1.0 3.48 -12.12)} \pgfsys@hbox{58}\lxSVG@closescope }}}
\lxSVG@closescope }}}
}
\lxSVG@closescope {\lx@inpgf@ignorespaces}{\lx@inpgf@ignorespaces}{\lx@inpgf@ignorespaces}\hss}\lxSVG@discardpath\lxSVG@closescope \hss}}\lxSVG@closescope\endpgfpicture}}\otimes\hbox to13.3pt{\vbox to13.3pt{\pgfpicture\makeatletter\hbox{\hskip 0.15pt\lower-0.15pt\hbox to0.0pt{\lxSVG@begingroup@{_scopebegin=1} \lxSVG@begingroup@{stroke=#000000} \lxSVG@begingroup@{fill=#000000} \lxSVG@setlinewidth{\the\pgflinewidth}\lxSVG@begingroup@{stroke-width=0.4pt} \lx@inpgf@ignorespaces\nullfont\lxSVG@begingroup@{_scopebegin=1} \lxSVG@closescope \lxSVG@begingroup@{_scopebegin=1} \lxSVG@closescope \hbox to0.0pt{\lxSVG@begingroup@{_scopebegin=1} {{\lx@inpgf@ignorespaces}}{{\lx@inpgf@ignorespaces}}{{\lx@inpgf@ignorespaces}}{{\lx@inpgf@ignorespaces}{{}}{}
{{\lx@inpgf@ignorespaces}{}}{{}}{}{}{}{}{{}}{}\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lxSVG@setlinewidth{\the\pgflinewidth}\lxSVG@begingroup@{stroke-width=0.3pt} \lx@inpgf@ignorespaces\lxSVG@begingroup@{fill=#FFFFFF} \lxSVG@fill@opacity{1}\lxSVG@begingroup@{fill-opacity=1} {}\lxSVG@fillstroke\lxSVG@drawpath@unclipped{M 0 0 M 0 0 L 0 17.99 L 17.99 17.99 L 17.99 0 Z M 17.99 17.99}{} \lx@inpgf@ignorespaces
\lxSVG@closescope {{\lx@inpgf@ignorespaces}}\lx@inpgf@ignorespaces\hbox{\hbox{{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}{{}{}{{
{}{}}}{
{}{}}
{{}{{\lx@inpgf@ignorespaces}}}{{}{\lx@inpgf@ignorespaces}}{}{{}{\lx@inpgf@ignorespaces}}
{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lx@inpgf@ignorespaces
\lxSVG@closescope }{{{{\lx@inpgf@ignorespaces}}\lxSVG@begingroup@{_scopebegin=1} \lxSVG@transformcm{1.0}{0.0}{0.0}{1.0}{2.51387pt}{4.24445pt}\lxSVG@begingroup@{transform=matrix(1.0 0.0 0.0 1.0 3.48 5.87)} \pgfsys@hbox{58}\lxSVG@closescope }}}
\lxSVG@closescope }}}
}
\lxSVG@closescope {\lx@inpgf@ignorespaces}{\lx@inpgf@ignorespaces}{\lx@inpgf@ignorespaces}\hss}\lxSVG@discardpath\lxSVG@closescope \hss}}\lxSVG@closescope\endpgfpicture}}}&2\\
{\scriptsize\hbox to13.3pt{\vbox to39.3pt{\pgfpicture\makeatletter\hbox{\hskip 0.15pt\lower-26.15pt\hbox to0.0pt{\lxSVG@begingroup@{_scopebegin=1} \lxSVG@begingroup@{stroke=#000000} \lxSVG@begingroup@{fill=#000000} \lxSVG@setlinewidth{\the\pgflinewidth}\lxSVG@begingroup@{stroke-width=0.4pt} \lx@inpgf@ignorespaces\nullfont\lxSVG@begingroup@{_scopebegin=1} \lxSVG@closescope \lxSVG@begingroup@{_scopebegin=1} \lxSVG@closescope \hbox to0.0pt{\lxSVG@begingroup@{_scopebegin=1} {{\lx@inpgf@ignorespaces}}{{\lx@inpgf@ignorespaces}}{{\lx@inpgf@ignorespaces}}{{\lx@inpgf@ignorespaces}{{}}{}
{{\lx@inpgf@ignorespaces}{}}{{}}{}{}{}{}{{}}{}\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lxSVG@setlinewidth{\the\pgflinewidth}\lxSVG@begingroup@{stroke-width=0.3pt} \lx@inpgf@ignorespaces\lxSVG@begingroup@{fill=#FFFFFF} \lxSVG@fill@opacity{1}\lxSVG@begingroup@{fill-opacity=1} {}\lxSVG@fillstroke\lxSVG@drawpath@unclipped{M 0 0 M 0 0 L 0 17.99 L 17.99 17.99 L 17.99 0 Z M 17.99 17.99}{} \lx@inpgf@ignorespaces
\lxSVG@closescope {{\lx@inpgf@ignorespaces}}\lx@inpgf@ignorespaces\hbox{\hbox{{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}{{}{}{{
{}{}}}{
{}{}}
{{}{{\lx@inpgf@ignorespaces}}}{{}{\lx@inpgf@ignorespaces}}{}{{}{\lx@inpgf@ignorespaces}}
{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lx@inpgf@ignorespaces
\lxSVG@closescope }{{{{\lx@inpgf@ignorespaces}}\lxSVG@begingroup@{_scopebegin=1} \lxSVG@transformcm{1.0}{0.0}{0.0}{1.0}{2.51387pt}{4.24445pt}\lxSVG@begingroup@{transform=matrix(1.0 0.0 0.0 1.0 3.48 5.87)} \pgfsys@hbox{58}\lxSVG@closescope }}}
\lxSVG@closescope }}}
{\lx@inpgf@ignorespaces}{{}}{}
{{\lx@inpgf@ignorespaces}{}}{{}}{}{}{}{}{{}}{}\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lxSVG@setlinewidth{\the\pgflinewidth}\lxSVG@begingroup@{stroke-width=0.3pt} \lx@inpgf@ignorespaces\lxSVG@begingroup@{fill=#FFFFFF} \lxSVG@fill@opacity{1}\lxSVG@begingroup@{fill-opacity=1} {}\lxSVG@fillstroke\lxSVG@drawpath@unclipped{M 0 -17.99 M 0 -17.99 L 0 0 L 17.99 0 L 17.99 -17.99 Z M 17.99 0}{} \lx@inpgf@ignorespaces
\lxSVG@closescope {{\lx@inpgf@ignorespaces}}\lx@inpgf@ignorespaces\hbox{\hbox{{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}{{}{}{{
{}{}}}{
{}{}}
{{}{{\lx@inpgf@ignorespaces}}}{{}{\lx@inpgf@ignorespaces}}{}{{}{\lx@inpgf@ignorespaces}}
{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lx@inpgf@ignorespaces
\lxSVG@closescope }{{{{\lx@inpgf@ignorespaces}}\lxSVG@begingroup@{_scopebegin=1} \lxSVG@transformcm{1.0}{0.0}{0.0}{1.0}{2.51387pt}{-8.75555pt}\lxSVG@begingroup@{transform=matrix(1.0 0.0 0.0 1.0 3.48 -12.12)} \pgfsys@hbox{58}\lxSVG@closescope }}}
\lxSVG@closescope }}}
{\lx@inpgf@ignorespaces}{{}}{}
{{\lx@inpgf@ignorespaces}{}}{{}}{}{}{}{}{{}}{}\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lxSVG@setlinewidth{\the\pgflinewidth}\lxSVG@begingroup@{stroke-width=0.3pt} \lx@inpgf@ignorespaces\lxSVG@begingroup@{fill=#FFFFFF} \lxSVG@fill@opacity{1}\lxSVG@begingroup@{fill-opacity=1} {}\lxSVG@fillstroke\lxSVG@drawpath@unclipped{M 0 -35.98 M 0 -35.98 L 0 -17.99 L 17.99 -17.99 L 17.99 -35.98 Z M 17.99 -17.99}{} \lx@inpgf@ignorespaces
\lxSVG@closescope {{\lx@inpgf@ignorespaces}}\lx@inpgf@ignorespaces\hbox{\hbox{{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}{{}{}{{
{}{}}}{
{}{}}
{{}{{\lx@inpgf@ignorespaces}}}{{}{\lx@inpgf@ignorespaces}}{}{{}{\lx@inpgf@ignorespaces}}
{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lx@inpgf@ignorespaces
\lxSVG@closescope }{{{{\lx@inpgf@ignorespaces}}\lxSVG@begingroup@{_scopebegin=1} \lxSVG@transformcm{1.0}{0.0}{0.0}{1.0}{2.51387pt}{-21.75555pt}\lxSVG@begingroup@{transform=matrix(1.0 0.0 0.0 1.0 3.48 -30.1)} \pgfsys@hbox{58}\lxSVG@closescope }}}
\lxSVG@closescope }}}
}
\lxSVG@closescope {\lx@inpgf@ignorespaces}{\lx@inpgf@ignorespaces}{\lx@inpgf@ignorespaces}\hss}\lxSVG@discardpath\lxSVG@closescope \hss}}\lxSVG@closescope\endpgfpicture}}\otimes\hbox to13.3pt{\vbox to39.3pt{\pgfpicture\makeatletter\hbox{\hskip 0.15pt\lower-26.15pt\hbox to0.0pt{\lxSVG@begingroup@{_scopebegin=1} \lxSVG@begingroup@{stroke=#000000} \lxSVG@begingroup@{fill=#000000} \lxSVG@setlinewidth{\the\pgflinewidth}\lxSVG@begingroup@{stroke-width=0.4pt} \lx@inpgf@ignorespaces\nullfont\lxSVG@begingroup@{_scopebegin=1} \lxSVG@closescope \lxSVG@begingroup@{_scopebegin=1} \lxSVG@closescope \hbox to0.0pt{\lxSVG@begingroup@{_scopebegin=1} {{\lx@inpgf@ignorespaces}}{{\lx@inpgf@ignorespaces}}{{\lx@inpgf@ignorespaces}}{{\lx@inpgf@ignorespaces}{{}}{}
{{\lx@inpgf@ignorespaces}{}}{{}}{}{}{}{}{{}}{}\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lxSVG@setlinewidth{\the\pgflinewidth}\lxSVG@begingroup@{stroke-width=0.3pt} \lx@inpgf@ignorespaces\lxSVG@begingroup@{fill=#FFFFFF} \lxSVG@fill@opacity{1}\lxSVG@begingroup@{fill-opacity=1} {}\lxSVG@fillstroke\lxSVG@drawpath@unclipped{M 0 0 M 0 0 L 0 17.99 L 17.99 17.99 L 17.99 0 Z M 17.99 17.99}{} \lx@inpgf@ignorespaces
\lxSVG@closescope {{\lx@inpgf@ignorespaces}}\lx@inpgf@ignorespaces\hbox{\hbox{{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}{{}{}{{
{}{}}}{
{}{}}
{{}{{\lx@inpgf@ignorespaces}}}{{}{\lx@inpgf@ignorespaces}}{}{{}{\lx@inpgf@ignorespaces}}
{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lx@inpgf@ignorespaces
\lxSVG@closescope }{{{{\lx@inpgf@ignorespaces}}\lxSVG@begingroup@{_scopebegin=1} \lxSVG@transformcm{1.0}{0.0}{0.0}{1.0}{2.51387pt}{4.24445pt}\lxSVG@begingroup@{transform=matrix(1.0 0.0 0.0 1.0 3.48 5.87)} \pgfsys@hbox{58}\lxSVG@closescope }}}
\lxSVG@closescope }}}
{\lx@inpgf@ignorespaces}{{}}{}
{{\lx@inpgf@ignorespaces}{}}{{}}{}{}{}{}{{}}{}\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lxSVG@setlinewidth{\the\pgflinewidth}\lxSVG@begingroup@{stroke-width=0.3pt} \lx@inpgf@ignorespaces\lxSVG@begingroup@{fill=#FFFFFF} \lxSVG@fill@opacity{1}\lxSVG@begingroup@{fill-opacity=1} {}\lxSVG@fillstroke\lxSVG@drawpath@unclipped{M 0 -17.99 M 0 -17.99 L 0 0 L 17.99 0 L 17.99 -17.99 Z M 17.99 0}{} \lx@inpgf@ignorespaces
\lxSVG@closescope {{\lx@inpgf@ignorespaces}}\lx@inpgf@ignorespaces\hbox{\hbox{{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}{{}{}{{
{}{}}}{
{}{}}
{{}{{\lx@inpgf@ignorespaces}}}{{}{\lx@inpgf@ignorespaces}}{}{{}{\lx@inpgf@ignorespaces}}
{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lx@inpgf@ignorespaces
\lxSVG@closescope }{{{{\lx@inpgf@ignorespaces}}\lxSVG@begingroup@{_scopebegin=1} \lxSVG@transformcm{1.0}{0.0}{0.0}{1.0}{2.51387pt}{-8.75555pt}\lxSVG@begingroup@{transform=matrix(1.0 0.0 0.0 1.0 3.48 -12.12)} \pgfsys@hbox{58}\lxSVG@closescope }}}
\lxSVG@closescope }}}
{\lx@inpgf@ignorespaces}{{}}{}
{{\lx@inpgf@ignorespaces}{}}{{}}{}{}{}{}{{}}{}\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lxSVG@setlinewidth{\the\pgflinewidth}\lxSVG@begingroup@{stroke-width=0.3pt} \lx@inpgf@ignorespaces\lxSVG@begingroup@{fill=#FFFFFF} \lxSVG@fill@opacity{1}\lxSVG@begingroup@{fill-opacity=1} {}\lxSVG@fillstroke\lxSVG@drawpath@unclipped{M 0 -35.98 M 0 -35.98 L 0 -17.99 L 17.99 -17.99 L 17.99 -35.98 Z M 17.99 -17.99}{} \lx@inpgf@ignorespaces
\lxSVG@closescope {{\lx@inpgf@ignorespaces}}\lx@inpgf@ignorespaces\hbox{\hbox{{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}{{}{}{{
{}{}}}{
{}{}}
{{}{{\lx@inpgf@ignorespaces}}}{{}{\lx@inpgf@ignorespaces}}{}{{}{\lx@inpgf@ignorespaces}}
{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lx@inpgf@ignorespaces
\lxSVG@closescope }{{{{\lx@inpgf@ignorespaces}}\lxSVG@begingroup@{_scopebegin=1} \lxSVG@transformcm{1.0}{0.0}{0.0}{1.0}{2.51387pt}{-21.75555pt}\lxSVG@begingroup@{transform=matrix(1.0 0.0 0.0 1.0 3.48 -30.1)} \pgfsys@hbox{58}\lxSVG@closescope }}}
\lxSVG@closescope }}}
}
\lxSVG@closescope {\lx@inpgf@ignorespaces}{\lx@inpgf@ignorespaces}{\lx@inpgf@ignorespaces}\hss}\lxSVG@discardpath\lxSVG@closescope \hss}}\lxSVG@closescope\endpgfpicture}}\otimes\hbox to13.3pt{\vbox to26.3pt{\pgfpicture\makeatletter\hbox{\hskip 0.15pt\lower-13.15pt\hbox to0.0pt{\lxSVG@begingroup@{_scopebegin=1} \lxSVG@begingroup@{stroke=#000000} \lxSVG@begingroup@{fill=#000000} \lxSVG@setlinewidth{\the\pgflinewidth}\lxSVG@begingroup@{stroke-width=0.4pt} \lx@inpgf@ignorespaces\nullfont\lxSVG@begingroup@{_scopebegin=1} \lxSVG@closescope \lxSVG@begingroup@{_scopebegin=1} \lxSVG@closescope \hbox to0.0pt{\lxSVG@begingroup@{_scopebegin=1} {{\lx@inpgf@ignorespaces}}{{\lx@inpgf@ignorespaces}}{{\lx@inpgf@ignorespaces}}{{\lx@inpgf@ignorespaces}{{}}{}
{{\lx@inpgf@ignorespaces}{}}{{}}{}{}{}{}{{}}{}\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lxSVG@setlinewidth{\the\pgflinewidth}\lxSVG@begingroup@{stroke-width=0.3pt} \lx@inpgf@ignorespaces\lxSVG@begingroup@{fill=#FFFFFF} \lxSVG@fill@opacity{1}\lxSVG@begingroup@{fill-opacity=1} {}\lxSVG@fillstroke\lxSVG@drawpath@unclipped{M 0 0 M 0 0 L 0 17.99 L 17.99 17.99 L 17.99 0 Z M 17.99 17.99}{} \lx@inpgf@ignorespaces
\lxSVG@closescope {{\lx@inpgf@ignorespaces}}\lx@inpgf@ignorespaces\hbox{\hbox{{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}{{}{}{{
{}{}}}{
{}{}}
{{}{{\lx@inpgf@ignorespaces}}}{{}{\lx@inpgf@ignorespaces}}{}{{}{\lx@inpgf@ignorespaces}}
{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lx@inpgf@ignorespaces
\lxSVG@closescope }{{{{\lx@inpgf@ignorespaces}}\lxSVG@begingroup@{_scopebegin=1} \lxSVG@transformcm{1.0}{0.0}{0.0}{1.0}{2.51387pt}{4.24445pt}\lxSVG@begingroup@{transform=matrix(1.0 0.0 0.0 1.0 3.48 5.87)} \pgfsys@hbox{58}\lxSVG@closescope }}}
\lxSVG@closescope }}}
{\lx@inpgf@ignorespaces}{{}}{}
{{\lx@inpgf@ignorespaces}{}}{{}}{}{}{}{}{{}}{}\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lxSVG@setlinewidth{\the\pgflinewidth}\lxSVG@begingroup@{stroke-width=0.3pt} \lx@inpgf@ignorespaces\lxSVG@begingroup@{fill=#FFFFFF} \lxSVG@fill@opacity{1}\lxSVG@begingroup@{fill-opacity=1} {}\lxSVG@fillstroke\lxSVG@drawpath@unclipped{M 0 -17.99 M 0 -17.99 L 0 0 L 17.99 0 L 17.99 -17.99 Z M 17.99 0}{} \lx@inpgf@ignorespaces
\lxSVG@closescope {{\lx@inpgf@ignorespaces}}\lx@inpgf@ignorespaces\hbox{\hbox{{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}{{}{}{{
{}{}}}{
{}{}}
{{}{{\lx@inpgf@ignorespaces}}}{{}{\lx@inpgf@ignorespaces}}{}{{}{\lx@inpgf@ignorespaces}}
{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lx@inpgf@ignorespaces
\lxSVG@closescope }{{{{\lx@inpgf@ignorespaces}}\lxSVG@begingroup@{_scopebegin=1} \lxSVG@transformcm{1.0}{0.0}{0.0}{1.0}{2.51387pt}{-8.75555pt}\lxSVG@begingroup@{transform=matrix(1.0 0.0 0.0 1.0 3.48 -12.12)} \pgfsys@hbox{58}\lxSVG@closescope }}}
\lxSVG@closescope }}}
}
\lxSVG@closescope {\lx@inpgf@ignorespaces}{\lx@inpgf@ignorespaces}{\lx@inpgf@ignorespaces}\hss}\lxSVG@discardpath\lxSVG@closescope \hss}}\lxSVG@closescope\endpgfpicture}}\otimes\hbox to13.3pt{\vbox to13.3pt{\pgfpicture\makeatletter\hbox{\hskip 0.15pt\lower-0.15pt\hbox to0.0pt{\lxSVG@begingroup@{_scopebegin=1} \lxSVG@begingroup@{stroke=#000000} \lxSVG@begingroup@{fill=#000000} \lxSVG@setlinewidth{\the\pgflinewidth}\lxSVG@begingroup@{stroke-width=0.4pt} \lx@inpgf@ignorespaces\nullfont\lxSVG@begingroup@{_scopebegin=1} \lxSVG@closescope \lxSVG@begingroup@{_scopebegin=1} \lxSVG@closescope \hbox to0.0pt{\lxSVG@begingroup@{_scopebegin=1} {{\lx@inpgf@ignorespaces}}{{\lx@inpgf@ignorespaces}}{{\lx@inpgf@ignorespaces}}{{\lx@inpgf@ignorespaces}{{}}{}
{{\lx@inpgf@ignorespaces}{}}{{}}{}{}{}{}{{}}{}\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lxSVG@setlinewidth{\the\pgflinewidth}\lxSVG@begingroup@{stroke-width=0.3pt} \lx@inpgf@ignorespaces\lxSVG@begingroup@{fill=#FFFFFF} \lxSVG@fill@opacity{1}\lxSVG@begingroup@{fill-opacity=1} {}\lxSVG@fillstroke\lxSVG@drawpath@unclipped{M 0 0 M 0 0 L 0 17.99 L 17.99 17.99 L 17.99 0 Z M 17.99 17.99}{} \lx@inpgf@ignorespaces
\lxSVG@closescope {{\lx@inpgf@ignorespaces}}\lx@inpgf@ignorespaces\hbox{\hbox{{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}{{}{}{{
{}{}}}{
{}{}}
{{}{{\lx@inpgf@ignorespaces}}}{{}{\lx@inpgf@ignorespaces}}{}{{}{\lx@inpgf@ignorespaces}}
{\lxSVG@begingroup@{_scopebegin=1} \color[rgb]{0,0,0}\lx@inpgf@ignorespaces
\lxSVG@closescope }{{{{\lx@inpgf@ignorespaces}}\lxSVG@begingroup@{_scopebegin=1} \lxSVG@transformcm{1.0}{0.0}{0.0}{1.0}{2.51387pt}{4.24445pt}\lxSVG@begingroup@{transform=matrix(1.0 0.0 0.0 1.0 3.48 5.87)} \pgfsys@hbox{58}\lxSVG@closescope }}}
\lxSVG@closescope }}}
}
\lxSVG@closescope {\lx@inpgf@ignorespaces}{\lx@inpgf@ignorespaces}{\lx@inpgf@ignorespaces}\hss}\lxSVG@discardpath\lxSVG@closescope \hss}}\lxSVG@closescope\endpgfpicture}}}&3\\
\hline\cr\end{array}
In fact, in Theorem3.1, in order to compute the corresponding Kostka-Foulkes polynomial,
we must have |λ|=|μ||\lambda|=|\mu|, which is not the case here,
but we can replace λ\lambda by λ˙=(3,2,2,2)\dot{\lambda}=(3,2,2,2) since λ˙−λ=2.(1,1,1,1)\dot{\lambda}-\lambda=2.(1,1,1,1)
so λ\lambda and λ˙\dot{\lambda} coincide as 𝔰𝔩4\mathfrak{sl}_{4}-weights.
One check that a direct computation of the Kostka-Foulkes polynomial gives
As mentioned briefly in the Introduction and explained in Section 8, it is not possible to equate the one-dimensional sums associated with a tensor product of KR-crystals of type Bn(1)B_{n}^{(1)} and Dn(1)D_{n}^{(1)} with a generalized Kostka-Foulkes polynomials. We nevertheless think there are relevant extensions of the notion of Kostka-Foulkes polynomials (defined similarly from
alternating sums of suitable qq-Kostant type partition functions) giving these
missing identifications.
(2)
The equalities illustrated in Table 2 can be specialized at q=1q=1 and
then give various Howe-type dualities. An interesting problem concerns the
generalization of the combinatorial Howe duality [10] obtained in type CnC_{n} which permits to get a charge statistic on King tableaux. More precisely,
it would be interesting to have a combinatorial proof of the various Howe-type
dualities coming from the q=1q=1 specialization of our results. As explained
in Remark 4.2, transferring the energy statistic through this correspondence would
give a charge statistic on relevant combinatorial objects. For example, in type
Cn(1)C_{n}^{(1)} the KR-column crystals are parametrized by the so-called
admissible columns. The duality described in Remark 4.2, once restricted to the highest weight tensor products of such columns, gives a subset of King tableaux with a simple
combinatorial description, hence a combinatorial description of the
generalized Kostka-Foulkes polynomials Kλ^,μ^Cm(0,q)K_{\widehat{\lambda},\widehat{\mu}}^{C_{m}}(0,q).
(3)
Besides the study of the combinatorics mentioned above, we plan to continue developing the combinatorics of the quantum alcove model in [30, 28, 29] in the direction of the Kostka-Foulkes polynomials and the energy function, as suggested in the Introduction.
References
[1]
N. Bourbaki,
Groupes et algèbres de Lie, Chapitres 4, 5 et 6,
Springer, Berlin, Heidelberg, 2007.
[2]
Daniel Bump and Anne Schilling,
Crystal Bases: Representations and Combinatorics,
World Scientific, 2017.
[3]
Vyjayanthi Chari and Andrew Pressley,
Weyl modules for classical and quantum affine algebras,
Representation Theory, 5: 191–223, 2001.
[4]
Vyjayanthi, Chari, Bogdan Ion and Deniz Kus,
Weyl modules for the hyperspecial current algebra,
Int. Math. Res. Not., 15: 6470–6515, 2015.
[5]
Hyeonjae Choi, Donghyun Kim, and Seung Jin Lee,
Lusztig qq-weight multiplicities and Kirillov–Reshetikhin crystals,
arXiv:2412.20757, 2024.
[6]
Philippe Di Francesco and Rinat Kedem,
Duality and Macdonald difference operators,
In: H. S. Cohl, L. Vinet, S. Post, J. Savard (eds),
Orthogonal Polynomials, Special Functions and Applications (OPSFA-16),
Springer Proceedings in Mathematics & Statistics, Springer, 2025, pp. 93–106.
[7]
Maciej Dolega, Thomas Gerber, and Jacinta Torres,
A positive combinatorial formula for symplectic Kostka-Foulkes
polynomials I: Rows,
Journal of Algebra, 560: 1253–1296, 2020.
[8]
William Fulton and Joe Harris,
Representation Theory: A First Course,
Graduate Texts in Mathematics 129, Springer, 1991.
[9]
Ghislain Fourier, Masato Okadao and Anne Schilling, Kirillov–Reshetikhin crystals for nonexceptional types, Adv. in Math., 222: 1080–1116, 2009.
[10]
Thomas Gerber, Jérémie Guilhot and Cédric Lecouvey, Generalised Howe duality and injectivity of induction: the symplectic case, Combinatorial Theory, 2(2), 2022.
[11]
Thomas Gerber and Cédric Lecouvey,
Duality and bicrystals on infinite binary matrices,
Annales de l’Institut Henri Poincaré D (Combinatorics, Physics and their Interactions),
10(4): 715–779, 2023.
[12]
Mikhail Goltsblat,
Ninth variations of classical group characters of type AA–DD and Littlewood identities,
Electronic Journal of Combinatorics, 30(4): P4.9, 2023.
[13]
Jin Hong and Seok-Jin Kang,
Introduction to Quantum Groups and Crystal Bases,
Graduate Studies in Mathematics 42, American Mathematical Society, 2002.
[14] Roger Howe.
Perspective on invariant theory
,
The Schur Lecture 1992, Israel mathematical conference proceedings, 1995.
[15]
James E. Humphreys,
Reflection Groups and Coxeter Groups,
Cambridge Studies in Advanced Mathematics 29, Cambridge University Press, 1990.
[16]
Bogdan Ion,
Nonsymmetric Macdonald polynomials and Demazure characters,
Duke Mathematical Journal, 116(2): 299–318, 2003.
[17]
Bogdan Ion,
Standard bases for affine parabolic modules and nonsymmetric
Macdonald polynomials,
J. Algebra, 319 (8): 3480–3517, 2008.
[18]
Il-Seung Jang and Jae-Hoon Kwon,
Flagged Littlewood–Richardson tableaux and branching rules for classical groups,
Journal of Combinatorial Theory, Series A, 181: 105419, 2021.
[19]
Victor G. Kac,
Infinite-Dimensional Lie Algebras,
3rd edition, Cambridge University Press, 1990.
[20]
Masaki Kashiwara and Toshiki Nakashima,
Crystal graphs for representations of the qq-analogue of classical Lie algebras,
J. Algebra, 165 (2): 295–345, 1994.
[21]
Shin-Ichi Kato,
Spherical functions and a qq-analogue of Kostant’s weight multiplicity formula, Inventiones Mathematicae, 66(3): 461–468, 1982.
[22]
Ron C. King,
Generating functions for some series of characters of classical Lie groups,
arXiv:2303.00576, 2023.
[23]
Alain Lascoux and Marcel-Paul Schützenberger,
Sur une conjecture de H. O. Foulkes,
Comptes Rendus de l’Académie des Sciences de Paris, 286: A323–A324, 1978.
[24]
Cédric Lecouvey,
Combinatorics of crystal graphs and Kostka–Foulkes polynomials for root systems BnB_{n}, CnC_{n} and DnD_{n},
European Journal of Combinatorics, 27: 526–557, 2006.
[25]
Cédric Lecouvey,
Parabolic restrictions and double deformations of weight multiplicities,
arXiv:2412.10003, to appear in J. of the Math. Soc. of Japan.
[26]
Cédric Lecouvey and Cristian Lenart,
Combinatorics of generalized exponents,
International Mathematics Research Notices, 2020(16): 4942–4992, 2020.
[27]
Cédric Lecouvey, Masato Okado, and Mark Shimozono,
Affine crystals, one-dimensional sums and parabolic Lusztig qq-analogues,
Mathematische Zeitschrift, 271: 819–865, 2012.
[28]
Cristian Lenart,
From Macdonald polynomials to a charge statistic beyond type AA,
Journal of Combinatorial Theory Series A, 119: 683–712, 2012.
[29]
Cristian Lenart and Adam Schultze,
On combinatorial models for affine crystals,
arXiv:2109.12199; extended abstract in Proceedings of the
33rd International Conference on Formal Power Series and Algebraic
Combinatorics (FPSAC 2021), Séminaire Lotharingien de Combinatoire, 85B: Art. 20, 13 pp., 2021.
[30]
Cristian Lenart, Satoshi Naito, Daisuke Sagaki, Anne Schilling, and Mark Shimozono,
A uniform model for Kirillov-Reshetikhin crystals II: Path
models and P=XP=X,
International Mathematics Research Notices, (14): 4259–4319, 2017.
[31]
George Lusztig,
Singularities, character formulas, and a qq-analog of weight multiplicities, Astérisque, Tome 101-102: 208–229, 1983.
[32]
Ian G. Macdonald,
Symmetric Functions and Hall Polynomials,
Oxford Mathematical Monographs, Oxford University Press, 1995.
[33]
Katsuhisa Mimachi,
A duality of Macdonald–Koornwinder polynomials and its application to integral representations,
Duke Mathematical Journal, 107(2): 265–281, 2001.
[34]
Kendra Nelsen and Arun Ram,
Kostka–Foulkes polynomials and Macdonald spherical functions,
in: Surveys in Combinatorics 2003, LMS Lecture Note Series 307, Cambridge University Press, 2003, pp. 325–370.
[35]
Akihiro Nakayashiki and Yasuhiko Yamada,
Kostka polynomials and energy functions in solvable lattice models,
Selecta Mathematica, 3: 547–599, 1997.
[36]
Leonardo Patimo and Jacinta Torres,
Atoms and charge in type C2C_{2},
Algebraic Combinatorics, 8(2): 521–574, 2025.
[37]
Eric M. Rains and S. Ole Warnaar,
Bounded Littlewood identities,
Memoirs of the American Mathematical Society, 270(1317), 2021.
[38]
Anne Schilling and Peter Tingley,
Demazure crystals, Kirillov–Reshetikhin crystals and the energy function,
Electron. J. Combin., 19(2) (2012).