Computer implementation of the Kerov–Kirillov–Reshetikhin algorithm

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)摘要 凯罗夫-基里洛夫-列舍季奇金（Kerov–Kirillov–Reshetikhin，KKR）算法建立了形状为λ、权为μ的半标准外尔表（semistandard Weyl tableaux）与类型为(λ, μ)的rigged弦构型（rigged string configurations）之间的双射关系。该算法可借助舒尔-外尔对偶性（Schur–Weyl duality）应用于海森堡磁链及其推广模型，并为系统化分类该磁链的全部本征态提供了方法论途径。 程序名称：KKR算法 目录编号：AELQ_v1_0 问题本质 针对由N个节点构成的一维广义海森堡磁体模型，给出了其全部本征态与本征值的分类方法。 Mendeley数据中的CPC程序库收录的该程序版本：AELQ_v1_0；KKR算法；10.1016/j.cpc.2012.01.025 本程序源自贝尔法斯特女王大学维护的CPC程序库（1969-2018年）