Premium
The role of paths in Robinson–Schensted algorithm (RS), and Kerov, Kirillov and Reshetikhin bijection (KKR)
Author(s) -
Jakubczyk D.,
Lulek B.
Publication year - 2005
Publication title -
physica status solidi (b)
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.51
H-Index - 109
eISSN - 1521-3951
pISSN - 0370-1972
DOI - 10.1002/pssb.200460053
Subject(s) - bijection , young tableau , continuation , interpretation (philosophy) , combinatorics , bridge (graph theory) , algorithm , computer science , mathematics , biology , anatomy , programming language
In this work we want to amplify the RS algorithm in the language of paths. Thus, it is a continuation of the previous work [Lulek et al., to appear in Mol. Phys.], where the magnetic interpretation of RS algorithm was given. We also want to present the intermediative role of paths in bijection between standard Young tableaux and rigged configurations. We will treat the paths as a “bridge” which allow us to move between this two objects. (© 2005 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)