2011
DOI: 10.1016/j.aim.2011.06.012
|View full text |Cite
|
Sign up to set email alerts
|

Stable rigged configurations for quantum affine algebras of nonexceptional types

Abstract: For an affine algebra of nonexceptional type in the large rank we show the fermionic formula depends only on the attachment of the node 0 of the Dynkin diagram to the rest, and the fermionic formula of not type A can be expressed as a sum of that of type A with Littlewood-Richardson coefficients. Combining this result with [13] and [19] we settle the X = M conjecture under the large rank hypothesis.

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
6
0

Year Published

2012
2012
2016
2016

Publication Types

Select...
4
1

Relationship

3
2

Authors

Journals

citations
Cited by 5 publications
(6 citation statements)
references
References 29 publications
(79 reference statements)
0
6
0
Order By: Relevance
“…n in [15]. It should be mentioned that this conjecture was recently settled for nonexceptional g under the large rank hypothesis by combining the results in [15], [18] and [22], and for general g if ℓ 1 = • • • = ℓ p = 1 [20].…”
Section: Introductionmentioning
confidence: 94%
“…n in [15]. It should be mentioned that this conjecture was recently settled for nonexceptional g under the large rank hypothesis by combining the results in [15], [18] and [22], and for general g if ℓ 1 = • • • = ℓ p = 1 [20].…”
Section: Introductionmentioning
confidence: 94%
“…We remark that these results can be viewed as another important example of significant properties of rigged configurations with respect to deep structures of the underlying algebra. For example, in [19] an interesting new bijection related to rigged configurations and Littlewood-Richardson tableaux is introduced which is expected to be an analogue of the involution corresponding to exchanging Dynkin nodes 0 and n − 1 constructed in [15]. Another such phenomenon is that generalizations of Schützenberger's involution become simple operations on rigged configurations (taking complements of the riggings, see [28]).…”
Section: Introductionmentioning
confidence: 99%
“…Remarkably, the construction is uniform for all types of algebras and the Littlewood-Richardson tableaux naturally appear as the recording tableaux of the algorithm. We expect that the bijection coincides with (and generalizes) a canonical Dynkin diagram automorphism (see Remark 3.2 of [23]).…”
Section: Introductionmentioning
confidence: 90%
“…Step 1. Suppose that we have P (i) 23, we see that f i acts on the same string before and after δ. Let us consider the behavior of δ before and after f i .…”
Section: The Case = Jmentioning
confidence: 99%