The number of steps in the Robinson-Schensted algorithm

DOI10.1007/S10688-005-0030-8MaRDI QIDQ883619zbMATH OpenOpenAlexFDO

Authors Dan Romik

Publication date 5 June 2007

Published in Functional Analysis and Its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10688-005-0030-8

zbMATH Keywords

analysis of algorithmsPlancherel measureYoung tableaux

Mathematics Subject Classification ID

Asymptotic enumeration (05A16) Combinatorial aspects of representation theory (05E10)

Recommendations

• Limit shapes of bumping routes in the Robinson-Schensted correspondence
• Poisson limit of bumping routes in the Robinson-Schensted correspondence
• The Robinson-Schensted and Schützenberger algorithms, an elementary approach
• scientific article; zbMATH DE number 3559589
• Generalized Robinson-Schensted correspondence: A new algorithm

Cites work

• A variational problem for random Young tableaux
• scientific article; zbMATH DE number 1268810 (Why is no real title available?)
• scientific article; zbMATH DE number 1052006 (Why is no real title available?)
• scientific article; zbMATH DE number 1757341 (Why is no real title available?)
• Sparse interpolation of symmetric polynomials
• The computational complexity of rules for the character table of \(S_n\).

Cited in

(6)

• How many timesteps for a cycle? Analysis of the Wisdom-Holman algorithm
• Limit shapes of bumping routes in the Robinson-Schensted correspondence
• Asymptotics of some Plancherel averages via polynomiality results
• A bump statistic on permutations resulting from the Robinson-Schensted correspondence
• Fast RSK correspondence by doubling search
• Permutations with short monotone subsequences

This page was built for publication: The number of steps in the Robinson-Schensted algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q883619)