Graded decompositions of fusion products in rank two
Abstract.
We determine the graded decompositions of fusion products of finite-dimensional irreducible representations for simple Lie algebras of rank two. Moreover, we give generators and relations for these representations and obtain as a consequence that the Schur positivity conjecture holds in this case. The graded Littlewood-Richardson coefficients in the decomposition are parametrized by lattice points in convex polytopes and an explicit hyperplane description is given in the various types.
2010 Mathematics Subject Classification:
17B10,52B20,17B67,05E101. Introduction
Fusion products have been introduced in [9] by proposing a way to construct generalized versions of Kostka polynomials. In turned out that these representations are very useful and generalize many families of representations, such as local Weyl modules, Kirillov-Reshetikhin modules and Demazure modules, which have been extensively studied due to their application to mathematical physics such as the X = M conjecture, and their rich combinatorial structure (see for example [4, 6, 14, 16, 21] and references therein). Recently, Naoi further highlighted the importance of fusion products by proving that the graded limit of a tensor product of (a certain class of) representations of quantum affine algebras is isomorphic to the fusion product of the corresponding representations for current algebras [22]. Moreover, the characters of graded limits satisfy a graded version of the Q-system [7, 18] which is a certain difference equation arising from models in statistical mechanics [16]. Although the notion of fusion products is 20 years old, very little is known about their structure, especially in the case of finite-dimensional irreducible modules (only in special cases generators and relations are determined; see for example [8, 13, 17]). The motivation of this paper is to settle this problem in rank two and to parametrize its highest weight vectors by lattice points in polytopes.
To each element we can associate an irreducible finite-dimensional representation of a complex finite-dimensional simple Lie algebra denoted by . A very important issue originated from its applications to quantum physics is to understand their tensor product structure. The fusion product can be understood as a graded version of the tensor product and is denoted in the literature often by ; its definition depends a priori on a choice of distinct complex numbers (for details we refer to [9]). The independence of the parameters was initially conjectured in [9, Conjecture 1.8] and is still an unsolved problem (except in the above mentioned cases where the structure has been determined).
Another importance of fusion products is due to its connection to algebraic combinatorics. Schur functions give a linear basis for the ring of symmetric functions and are labelled by partitions. Recently, a lot of work has gone into studying whether certain expressions of the form are Schur positive, i.e. whether they can be written as a non-negative linear combination of Schur functions [5, 12, 19]. The Schur positivity conjecture states under which assimptions on the above expression is Schur positive and is known to be true only in some fairly simple special cases [5]. This conjecture can be generalized and stated in the language of Littlewood-Richardson coefficients (see [5]). As an application of the main theorem we will derive the Schur positivity conjecture in the rank two case (see Corollary Corollary).
We will now describe our results in more details. Denote by the algebra of polynomial maps and by the cyclic quotient of the universal algebra of generated by a non-zero vector subject to the defining relations described in Section 3.1. Then, there is by construction a surjective homomorphism and it has been conjectured that this map is in fact an isomorphism. The conjecture is known to be true in the following special cases:
We emphasize that is the only case where the strucure has been fully understood. In this paper we prove the above conjecture for of rank two where we have to make the additional assumption in the case of that where is the unique short root (see Theorem 1). We believe that this assumption is necessary to end up in a paramatrization of the graded Littlewood-Richardson coefficients by convex polytopes.
We outline the idea of the proof. Let and . We are interested in determining a parametrizing set of Littlewood-Richardson coefficients compatible with the fusion product grading. The strategy is to find an expression of the following form
where is a finite subset parametrizing the highest weight vectors up to a filtration and is defined in Section 3.4. To achieve such an expression, we will define suitable differential operators on enveloping algebras (similar as in [1, 10, 11]) and prove a straightening law (see Proposition Proposition, Proposition Proposition, and Proposition Proposition). It is striking that the proof of the straightening law for rank 2 Lie algebras leads to the fact that can be described in terms of lattice points of a convex polytope (see Definition Definition). Now comparing the number of lattice points with the Littlewood-Richardson coefficients (for example using the models in [20] or [23]) will give the desired result.
The paper is organized as follows. In Section 2 we give the main notations. In Section 3 we state the main result of the paper and give the hyperplane description of the corresponding polytopes in the various cases. Moreover, we discuss the strategy of the proof and its application to the Schur positivity conjecture. Section 4 is devoted to the proof of the main theorem in type , Section 5 deals with type and Section 6 with type .
2. Notations
In this section we recall the notion of fusion products [9] and set up the notation needed in the rest of the paper.
2.1.
Throughout this paper we denote by the field of complex numbers and by (resp. , ) the subset of integers (resp. non-negative, positive integers). For we set
Let be a finite–dimensional complex simple Lie algebra and a Cartan subalgebra of . We denote the corresponding set of roots with respect to by and fix a basis for . The corresponding sets of positive and negative roots are denoted as usual by and for we let be the corresponding coroot of . We fix a Chevalley basis of . Furthermore, let be the root lattice and the subset of non-negative integer linear combinations of simple roots. Let be the weight lattice of with basis and be the subset of dominant integral weights.
2.2.
We let be the universal enveloping algebra of and be the Lie algebra of polynomial maps from to with the obvious pointwise Lie bracket:
The Lie algebra and its universal enveloping algebra inherit a grading from the degree grading of . Thus an element , , for will have grade . We denote by be the homogeneous component of degree and recall that it is a –module for all . Suppose now that we are given a cyclic –module generated by a vector . Define an increasing filtration of –submodules of by
The associated graded vector space admits an action of given by:
Furthermore, is a cyclic –module with cyclic generator , the image of in . The fusion product [9] is a –module of the form for a special choice of cyclic –module which we define next. Given a dominant integral weight and , let be the –module with action
Given and distinct complex numbers , the Chinese remainder theorem implies that the tensor product is cyclic and generated by where and respectively is the highest weight vector of and respectively. The fusion product is defined as follows
Remark.
The fusion product can be defined more generally for any collection of dominant integral weights and a tuple of pairwise distinct complex numbers (see [9] for details). Clearly the definiton depends on the parameters , . However, it is conjectured in [9] (and proved in several special cases) that the structure is independent of the choice. If , the independence can be proven directly.
Lemma.
For each pair of distinct complex numbers, we have an isomorphism of -modules
Proof.
In order to distinguish the highest weight elements, we shall write and respectively. To see the isomorphism, we only have to observe that
Claim: For each homogeneous element of degree there exists suitable elements of degree strictly smaller than such that
(2.1) |
Proof of the Claim: It is enough to show the claim for monomials . Since for all , we can additionally assume by the PBW theorem that is of the form
Modulo terms of strictly smaller degree (applied to ) we obtain
This shows the claim.
Now if , i.e. can be written as a sum of elements of strictly smaller degree (applied to ), we obtain from (2.1) that
for suitable elements of degree strictly smaller than . In order to show that can be written as a sum of elements of strictly smaller degree than (applied to ) we use once more (2.1) and replace each element in the above sum. This gives the desired result since for . ∎
In the rest of the paper we simply write since the fusion product is independent of the choice of parameters by Lemma Lemma. Although fusion products have been introduced around 20 years ago, very little is known about their structure; only in special cases generators and relations are determined (see for example [13, 17]) and the complete structure has only been understood in the case of [8]. The motivation of this paper is to investigate the structure of fusion products in rank two.
3. The Main Theorem
In this section we state our main theorem and discuss the strategy of the proof as well as several consequences.
3.1.
We denote by the cyclic -module generated by a non-zero vector subject to the relations
Obviously, there is a surjective homomorphism
(3.1) |
and it is still an open problem, whether the above map is an isomorphism.
3.2.
In this subsection we will state our main theorem.
Definition.
Let be of rank two and . We set for .
-
(1)
Let be the convex polytope defined by the inequalities
(3.2) (3.3) -
(2)
Let be the convex polytope defined by the inequalities
(3.4) (3.5) (3.6) (3.7) -
(3)
Let be the convex polytope defined by the inequalities
(3.8) (3.9) (3.10) (3.11)
The upper index denotes the type of the Lie algebra. Note that is empty if or is not a dominant integral weight. We denote the lattice points in by and for we define its degree as the sum over its entries and its weight by
In our convention is the unique short root in the case of and .
Theorem 1.
Let be of rank two, be dominant integral weights such that or is a multiple of a minuscule fundamental weight in the case of .
-
(1)
We have an isomorphism of -modules
-
(2)
The multiplicity of in degree in the fusion product is given by the cardinality of
Remark.
We see that each lattice point in the polytope is also a lattice point in the corresponding FFLV/Gornitskii polytope and respectively (see [10, 11, 15]). The restriction on the dominant integral weights in the theorem for type is necessary and preliminary calculations show that our methods do not lead to a convex polytope. We expect a union of polytopes in the general case for type .
3.3.
We first discuss a consequence of our main theorem. Schur functions give a linear basis for the ring of symmetric functions and are labelled by partitions. Recently, a lot of work has gone into studying whether certain expressions of the form are Schur positive, i.e. whether they can be written as a non-negative linear combination of Schur functions. Since Schur functions describe the characters of irreducible finite-dimensional modules in type , the above question has been generalized and formulated in terms of Littlewood Richardson coefficients in [5, Conjecture 2.3]. So far the aforementioned conjecture is known to be true only in some fairly simple special cases [5], namely for multiples of fundamental minuscule weights or if is of type .
Corollary.
Let be of rank two and , be dominant integral weights such that . In the case of we additionally assume that and are multiples of a fundamental miniscule weight. If , we have
Proof.
Since as a -module, we only have to prove that there exists a surjective map . Since , this is a direct consequence of Theorem 1(1) and the assumptions. ∎
With other words, we can extend [5, Conjecture 2.3] to the simple Lie algebra of type and (under the above restriction) and provide a completely different proof in the case of .
3.4.
In this subsection we explain the strategy of the proof of Theorem 1. Note that the first part of Theorem 1 would follow from the injectivity of the map in (3.1). This again is a consequence of the multiplicity bound
(3.12) |
The strategy in showing such an inequality (3.12) will be as follows. We write in the rest of the paper for a positive root simply . We define for an arbitrary tuple of non-negative integers the monomial
where denotes the divided powers, i.e. .
Proposition.
Under the assumptions of Theorem 1 we have
Moreover, we can order the elements in in a way such that
The above proposition implies (3.12) and hence the first part of our main theorem. To see this, consider the finite set and the aforementioned order (which we will define later) on the elements of . Define
which gives an increasing filtration
If we act with on a monomial , we obtain an element which is in the span of monomials corresponding to strictly smaller elements, i.e. . This implies that we have a well–defined surjective map of –modules , which gives
Together with Proposition Proposition we get (3.12). The second part of the theorem follows by construction. Hence we are left to show Proposition Proposition which is done in Section 4 for type , Section 5 for type and Section 6 for type .
4. The case
In this section we prove Proposition Proposition for the rank two Lie algebra of type .
4.1.
We consider the following total order on . We say that if and only if one of the following conditions hold
Proposition.
Assume that is such that . Then we have
for suitable elements .
Proof.
If violates one of the inequalities in (3.2), we would have
(4.1) |
and the claim is obvious. To see this, assume that , i.e.
(4.2) |
by the relations of the module . Since for all , we obtain that equation (4.2) is equal to (4.1). If one of the other two inequalites in (3.2) are violated, we would immeaditely get (4.1). So assume that violates the first inequality in (3.3). We consider
Expanding the above product we obtain up to sign
The maximal term in the above sum is given if we minimalize the power of , so if . This shows the claim. If violates the second inequality in (3.3), then consider
The proof is exactly the same and will be omitted. ∎
Note that Proposition Proposition finishes all parts of Proposition Proposition except the statement on the cardinality of .
4.2.
There are several well-known formulas for the Littlewood-Richardson coefficients; however to the best of our knowledge none of them is compatible with the fusion product grading. Consider the set consisting of triples satisfying the following inequalities:
Then it has been proved in [23, Section 3] that
So the following lemma finishes the proof of Proposition Proposition in the case of .
Lemma.
There exists a bijective map .
Proof.
First we define an equivalence relation on as follows
Then decomposes into the disjoint union of equivalence classes. The following statements are straightforward to check:
-
(i)
-
(ii)
Now the existence of a bijective map follows if we can show that for any equivalence class the cardinality of is equal to the cardinality of . If is empty, there is nothing to show. So assume that the intersection is non-empty. By definition of the equivalence relation and (i) we can always choose an element satisfying or . Since the proof in both cases is similar, we only consider the case where is an equivalence class and contains an element of the form . We fix this element in the rest of the proof and set
From the definition of the polytopes one quickly observes that (using (i) and (ii))
So in order to finish the proof we are left to show that . Note that
Hence we get
which finishes the proof. ∎
5. The case
In this section we prove Proposition Proposition for the rank two Lie algebra of type .
5.1.
Again we define a total order on as follows. We say if and only if one of the following conditions hold
.
Proposition.
Assume that is such that Then we have
for suitable elements .
Proof.
If violates one of the inequalities in (3.4), then the left hand side is already zero by the defining equalities of . If the element violates the first inequality in (3.5), then
Now multiplying the above equation by gives the claim. The proof for the case when violates the second inequality in (3.5) is similar and will be omitted. So assume now that the element violates the first inequality in (3.6); the second is again similarly proven and will be omitted. Then we consider (again up to sign)
Now passing successively through gives (using [3, Lemma 4.1])
where the sum runs over tuples satisfying and . Hence the maximal monomial is given by and . Now multiplying the above equation with gives the result in this case. If violates the inequality in (3.7), then
and hence it follows up to sign that
Now passing all through we obtain as above
where the sum runs again over all tuples of non-negative integers such that and and each is non-zero. Now we want to find the maximal monomial in the above sum. Since we want to minimize the power of we should have in the maximal monomial. If in the maximal monomial, we would get and hence
which is a contradiction. Hence by the definition of the total order. This implies and the maximal monomial is given as desired. ∎
Again Proposition Proposition finishes all parts of Proposition Proposition except the statement on the cardinality of .
5.2.
Again there are several well-known combinatorial models for the sum of Littlewood-Richardson coefficients; none of the being compatible with the fusion product grading. We consider here the set consisting of satisfying the following inequalities:
Then it has been proved in [2, Section 3] that
We define an injective map
whose image consists exactly of those points in where . Hence
(5.1) |
where is the union of the following two polytopes: the one consisting of satisfying
and that consisting of satisfying
Using the injective map
we further obtain
(5.2) |
where is the disjoint union of the following four polytopes:
We summarize the combinatorics of in the following lemma.
Lemma.
Let . Then
Moreover, if , then
and if and we have
Proof.
The first part follows from (5.1) and (5.2). Assume that . Analyzing the polytopes defining , one can calculate the following differences:
This leads to
This implies the second statement:
Now suppose and . If , then consists of the union of the following polytopes
which can be unified to the union of the following two polytopes:
Thus is given by the cardinality of the disjoint union
which is equal to
The first summand describes the cardinality of the first polytope and the second summand the cardinality of the second one. Finally if , then the cardinality of is given by , where simplifies to
Now it is straightforward to see that is the same as the cardinality of those elements in where or ( and ). Hence the difference is given by . ∎
5.3.
Now let us find analoges of the previous statements for . We can define an injective map
whose image consists exactly of those points in where . Thus
(5.3) |
where consists of satisfying
Similar as before, we can define an injective map
which leads to
(5.4) |
where is union of the following two sets: the one consisting of such that
and the one consisting of satisfying
Lemma.
Let . Then
Moreover, if , then
and if and we have
Proof.
The first part follows from (5.3) and (5.4). Assume first that . We have an injective map
whose image does not contain the elements in of the form with and every other point is in the image. Hence we obtain that
where consists of all points satisfying
Since
the claim follows in this case. If , then consists of all satisfying
With the injective map
we easily see that equals ∎
5.4.
So the following lemma finishes the proof of Proposition Proposition in the case of .
Lemma.
There exists a bijective map .
Proof.
In view of Lemma Lemma, Lemma Lemma and an easy induction argument we only have to prove that if . If or , then both sets consist only of one point. If , then both sets are defined by the same non redundant inequalities, so the only interesting case is and . Now the statement follows from
which can be easily seen by arguments similar to those we used before. ∎
6. The case
In this section we prove Proposition Proposition for the rank two Lie algebra of type .
6.1.
Here we consider the total order on defined as follows if and only if one of the following conditions hold
Lemma.
The following relations hold in provided that :
Proof.
We prove the lemma by induction on , where the case is clear. Now if we use [3, Lemma 4.1] and obtain
(6.1) |
where the sum runs over all of non-negative integers satisfing and . Since
we obtain by induction that each summand for in (6.1) is zero. Now the claim follows by taking in (6.1). In order to see the second relation we get by using [3, Lemma 4.1]:
Now the claim follows immediately from the first relation. ∎
Proposition.
Assume that is such that Then we have
for suitable elements .
Proof.
If violates one of the equalities in (3.8), then the statement is clear by the defining equalities of or by the following argument. If , then
where the sum is made by passing successively through (one can check this directly or use [3, Lemma 4.1]). By the definition of the total order, the maximal monomial in the above sum arises when and in each other monomial the power of is strictly greater than . Now the rest follows by multiplying the above equation by since passing this product through has no affect on the power of . To see the last inequality in (3.8), we consider in the case when the product
Then we get (again by direct calculation or using twice [3, Lemma 4.1])
The maximal monomial arises when and and the claim follows by multiplying the above sum with (since and commute). So suppose in the rest of the proof that satisfies the equations in (3.8). In the next step we suppose that the first inequality in (3.9) is violated (the proof for the second inequality in (3.9) and the inequalities in (3.10) is similar and will be omitted). We get
Since for all we get
Hence
where each monomial in the above sum has one of the elements or as a factor. So the claim follows by multiplying the above equation by and the definition of the order. We finally consider the case when one of the inequalities in (3.11) are violated, starting with . Up to sign, we get from Lemma Lemma
(6.2) |
Now multiplying (6.2) with gives (using once more [3, Lemma 4.1])
where the sum runs over triples satisfying and . By the definition of the order we want to minimalize , so choose in the above sum. If we would get and hence
which is a contradiction. Hence the maximal monomial appears if we choose , and . In the last case we assume . From Lemma Lemma we know that up to sign
Multiplying the above equation with we get exactly as above
where the sum runs over triples satisfying and . The conditions on imply hence and . The maximal element is therefore given by choosing and . This finishes the proof of the proposition. ∎
Again it remains to investigate the cardinality of .
6.2.
In the rest of this section we assume for simplicity that and consider the set consisting of all elements satisfying the following inequalities
Lemma.
We have an equality
Proof.
We consider the following admissible sixtuples of rows
and call them and respectively. Let be a column tableau of length such that the entries in the boxes are not decreasing from the top to the bottom and for all the subtableau consisting of the th up to the th row is an admissible sixtuple of rows. Let be the subtablau obtained from by considering the last rows. Define
and let
If for all , we call to be a standard dominant tableau. From [20, Theorem 3.7, Section 3.8] we get that the number of standard dominant tableaux coincides with the cardinality of
In order to finish the proof of the lemma, let be a standard dominant tableau and note that must be a single column starting with a certain number of followed by a certain number of and so on. We denote by the number of in , by the number of in and so on. We will now investigate step by step the condition being a standard dominant tableau. This will lead to certain inequalities among the non-negative integers . First of all, we must have since otherwise the entries in the boxes are decreasing. Since the column length is exactly we also get the inequality
Moreover, choosing
gives the inequalities
It is straightforward to check that the above conditions are also enough to guarantee that is a standard dominant tableau. Hence we obtain a bijection between the set of standard dominant tableau and which maps an element to the tuple . ∎
6.3.
We have an injective map
whose image consists exactly of those points in whose last entry is strictly greater than zero. Hence we obtain
(6.3) |
where consists of tuples satisfying the following inequalities
Again we can define an injective map
whose image consists exactly of those points in whose fifth entry is strictly greater than zero. Hence we obtain the equality
(6.4) |
where consists of tuples (we substitute ) satisfying the following inequalities
In the next step we have to work a little bit more. We define once more an injective map
whose image consists exactly of those points in whose first entry is strictly greater than zero and . Hence we obtain
(6.5) |
where consists of all elements in where or . A straightforward calculation shows that the cardinality of is given by the cardinality of the disjoint union
Note that the polytope corresponds to all elements in where and to all elements where and . We summarize the combinatorics of in the following lemma.
6.4.
We want to prove a similar result as Lemma Lemma for the polytope . First consider the injective map
whose image consists exactly of those points in satisfying . Hence we obtain
(6.6) |
where with
Note that the first polytope correponds to the elements in where and the second polytope to the elements where and . We denote by the subset of elements with . Again we define an injective map
where an element from is mapped to and an element from is mapped to . Hence the image consists exactly of those points in where in and in . We get
Obviously is described by the inequalities
Since
is an injective map, whose image consists of all points in satisfying , we are left to describe the disjoint union
Writing down the inequalities it is straightforward to see that can be identified with the disjoint union of the following two polytopes
corresponds to and to . We have
(6.7) |
In the next step we define again an injective map
where an element from is mapped to and an element from is mapped to . Obviously
(6.8) |
where consists of all elements in such that . Hence it can be identified with the disjoint union of
We summarize the combinatorics of in the following lemma.
6.5.
The following lemma finishes the proof of Proposition Proposition in the case of .
Lemma.
There exists a bijective map .
Proof.
In view of Lemma Lemma, Lemma Lemma and an easy induction argument it will be enough to prove that and have the same cardinality which we prove by induction on . Base step: If , then the cardinality of is given by
(6.9) |
where . If the statement is clear. , then it is easy to see that if and otherwise. Since the same is true for (6.9), we obtain the claim for . We assume from now on that and define an injective map
where an element from is mapped to and an element from is mapped to . We have
where the last summand counts the elements in with . By induction we have
where the last equality follows in the last two cases from the fact that if and only if . This finishes the base step.
Inductive step: If we have where is the cardinality of the union of the following sets
The cardinalities of these sets are given by
So adding these numbers up, we get that
On the other hand we have an injective map
where an element from is mapped to and an element from is mapped to . So we also have where is the cardinality of the union of the following sets:
The cardinality of the first set is if and otherwise . The cardinality of the second set is given by if and otherwise by This shows and hence the claim. ∎
References
- [1] Teodor Backhaus and Deniz Kus. The PBW filtration and convex polytopes in type . J. Pure Appl. Algebra, 223(1):245–276, 2019.
- [2] A. D. Berenstein and A. V. Zelevinsky. Tensor product multiplicities and convex polytopes in partition space. J. Geom. Phys., 5(3):453–472, 1988.
- [3] Samuel Chamberlin. Integral bases for the universal enveloping algebras of map algebras. J. Algebra, 377:232–249, 2013.
- [4] Vyjayanthi Chari. On the fermionic formula and the Kirillov-Reshetikhin conjecture. Internat. Math. Res. Notices, (12):629–654, 2001.
- [5] Vyjayanthi Chari, Ghislain Fourier, and Daisuke Sagaki. Posets, tensor products and Schur positivity. Algebra Number Theory, 8(4):933–961, 2014.
- [6] Vyjayanthi Chari, Bogdan Ion, and Deniz Kus. Weyl modules for the hyperspecial current algebra. Int. Math. Res. Not. IMRN, (15):6470–6515, 2015.
- [7] Vyjayanthi Chari and R. Venkatesh. Demazure modules, fusion products and -systems. Comm. Math. Phys., 333(2):799–830, 2015.
- [8] B. Feigin and E. Feigin. -characters of the tensor products in -case. Mosc. Math. J., 2(3):567–588, 2002. Dedicated to Yuri I. Manin on the occasion of his 65th birthday.
- [9] Boris Feigin and Sergei Loktev. On generalized Kostka polynomials and the quantum Verlinde rule. In Differential topology, infinite-dimensional Lie algebras, and applications, volume 194 of Amer. Math. Soc. Transl. Ser. 2, pages 61–79. Amer. Math. Soc., Providence, RI, 1999.
- [10] Evgeny Feigin, Ghislain Fourier, and Peter Littelmann. PBW filtration and bases for irreducible modules in type . Transform. Groups, 16(1):71–89, 2011.
- [11] Evgeny Feigin, Ghislain Fourier, and Peter Littelmann. PBW filtration and bases for symplectic Lie algebras. Int. Math. Res. Not. IMRN, (24):5760–5784, 2011.
- [12] Sergey Fomin, William Fulton, Chi-Kwong Li, and Yiu-Tung Poon. Eigenvalues, singular values, and Littlewood-Richardson coefficients. Amer. J. Math., 127(1):101–127, 2005.
- [13] Ghislain Fourier. New homogeneous ideals for current algebras: filtrations, fusion products and Pieri rules. Mosc. Math. J., 15(1):49–72, 181, 2015.
- [14] Philippe Di Francesco and Rinat Kedem. Proof of the combinatorial Kirillov-Reshetikhin conjecture. Int. Math. Res. Not. IMRN, (7):Art. ID rnn006, 57, 2008.
- [15] A. A. Gornitskiĭ. Essential signatures and canonical bases of irreducible representations of the group . Mat. Zametki, 97(1):35–47, 2015.
- [16] Goro Hatayama, Atsuo Kuniba, Masato Okado, Taichiro Takagi, and Zengo Tsuboi. Paths, crystals and fermionic formulae. In MathPhys odyssey, 2001, volume 23 of Prog. Math. Phys., pages 205–272. Birkhäuser Boston, Boston, MA, 2002.
- [17] Deniz Kus and Peter Littelmann. Fusion products and toroidal algebras. Pacific J. Math., 278(2):427–445, 2015.
- [18] Deniz Kus and R. Venkatesh. Twisted Demazure modules, fusion product decomposition and twisted -systems. Represent. Theory, 20:94–127, 2016.
- [19] Thomas Lam, Alexander Postnikov, and Pavlo Pylyavskyy. Schur positivity and Schur log-concavity. Amer. J. Math., 129(6):1611–1622, 2007.
- [20] Peter Littelmann. A generalization of the Littlewood-Richardson rule. J. Algebra, 130(2):328–368, 1990.
- [21] Katsuyuki Naoi. Weyl modules, Demazure modules and finite crystals for non-simply laced type. Adv. Math., 229(2):875–934, 2012.
- [22] Katsuyuki Naoi. Tensor products of Kirillov-Reshetikhin modules and fusion products. Int. Math. Res. Not. IMRN, (18):5667–5709, 2017.
- [23] Igor Pak and Ernesto Vallejo. Combinatorics and geometry of Littlewood-Richardson cones. European J. Combin., 26(6):995–1008, 2005.
- [24] R. Venkatesh. Fusion product structure of Demazure modules. Algebr. Represent. Theory, 18(2):307–321, 2015.