Computer implementation of the Kerov–Kirillov–Reshetikhin algorithm Original Research Article

The Kerov–Kirillov–Reshetikhin (KKR) algorithm establishes a bijection between semistandard Weyl tableaux of the shape λ and weight μ and rigged string configurations of type image. This algorithm can be applied to Heisenberg magnetic chains and their generalisations by use of Schur–Weyl duality, and gives a way to classify all eigenstates of the chain in a methodological manner.