An Explicit Algorithm of Rigged Configuration Bijection for the Adjoint Crystal of Type $G_2^{(1)}$

Abstract

We construct an explicit algorithm of the static-preserving bijection between the rigged configurations and the highest weight paths of the form $(B^{2,1}{)}^{\otimes L}$ in the $G_2^{(1)}$ adjoint crystals.

arXiv comment70 pages, typo fixed, references added

References in corpus (11)

• Soliton Cellular Automata Associated With Crystal Bases
• X=M for symmetric powers
• Virtual crystals and Kleber's algorithm
• New fermionic formula for unrestricted Kostka polynomials
• The canonical solutions of the Q-systems and the Kirillov-Reshetikhin conjecture
• Level 1 Perfect Crystals and Path Realizations of Basic Representations at q=0
• Affine crystal structure on rigged configurations of type D_n^(1)
• Rigged Configurations and Kashiwara Operators
• Zero Action on Perfect Crystals for U_q(G_2^{(1)})
• A crystal to rigged configuration bijection and the filling map for type $D_4^{(3)}$
• Rigged configuration bijection and proof of the $X=M$ conjecture for nonexceptional affine types