Computer implementation of the Kerov–Kirillov–Reshetikhin algorithm

Published: 1 June 2012| Version 1 | DOI: 10.17632/575g4cy5sr.1
P. Jakubczyk, A. Wal, D. Jakubczyk, T. Lulek


Abstract The Kerov–Kirillov–Reshetikhin (KKR) algorithm establishes a bijection between semistandard Weyl tableaux of the shape λ and weight μ and rigged string configurations of type ( λ , μ ) . 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. Title of program: KKR algorithm Catalogue Id: AELQ_v1_0 Nature of problem The method of classification of all eigenstates and eigenvalues is given for the generalized model of the one-dimensional Heisenberg magnet consisting of N nodes. Versions of this program held in the CPC repository in Mendeley Data AELQ_v1_0; KKR algorithm; 10.1016/j.cpc.2012.01.025 This program has been imported from the CPC Program Library held at Queen's University Belfast (1969-2018)



Atomic Physics, Computational Physics, Computational Method