用户名: 密码: 验证码:
Computer implementation of the Kerov-Kirillov-Reshetikhin algorithm
详细信息查看全文 | 推荐本文 |
摘要
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.

Program summary

Program title: KKR algorithm

Catalogue identifier: AELQ_v1_0

Program summary URL:

Program obtainable from: CPC Program Library, Queen始s University, Belfast, N. Ireland

Licensing provisions: Standard CPC licence,

No. of lines in distributed program, including test data, etc.: 974

No. of bytes in distributed program, including test data, etc.: 11鈥?18

Distribution format: tar.gz

Programming language: Maple

Computer: PC

Operating system: Windows, Linux

RAM: 1 GB

Classification: 2.7, 4.2

Nature of problem: The method of classification of all eigenstates and eigenvalues is given for the generalised model of the one-dimensional Heisenberg magnet consisting of N nodes.

Solution method: We use a prolongation of the RSK bijection [1] to the set of all eigenstates of an integrable model, in terms of rigged string configurations. More specifically, one selects from the irreducible basis of the Schur-Weyl duality all highest weight states | with respect to the unitary group and generates a rigged string configurations for each .

Running time: The running time is about 1 ms.

Reference:

[1]

S. Veigneau, Algebraic Combinatorics Environment for the computer algebra system, User始s Reference Manual, Version 3.0 98-11, Universit茅 de Marne-la-Vall茅, Institut Gaspard-Monge, CNRS, 1998.

© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号

地址:北京市海淀区学院路29号 邮编:100083

电话:办公室:(+86 10)66554848;文献借阅、咨询服务、科技查新:66554700