Stability conjecture for the combinatorial R-matrix on the limiting crystal
Stability conjecture for the combinatorial R-matrix on the limiting crystal
Let be the limiting crystal obtained from the crystals , and let be its set-theoretic embedding. For fixed and , define and by
where is the unique element satisfying for sufficiently large , and the isomorphism is the combinatorial -matrix . Stability conjecture. For any fixed and , the elements and are independent of for all sufficiently large . This asserts that the combinatorial -matrix has a well-defined stable limit on the limiting crystal; the source gives no proof or resolution in the supplied text.
Sources & referencesView supporting material
Primary source
Goro Hatayama, Atsuo Kuniba and Taichiro Takagi, “Soliton Cellular Automata Associated With Crystal Bases”, arXiv:solv-int/9907020 (2000).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.