The number of steps in the Robinson-Schensted algorithm

DOI10.1007/s10688-005-0030-8zbMath1117.05006OpenAlexW2067701708MaRDI QIDQ883619

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

Plancherel measureanalysis of algorithmsYoung tableaux

Mathematics Subject Classification ID

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

Related Items (2)

Permutations with short monotone subsequences ⋮ Asymptotics of some Plancherel averages via polynomiality results

Cites Work

• Sparse interpolation of symmetric polynomials
• A variational problem for random Young tableaux
• The computational complexity of rules for the character table of \(S_n\).
• Unnamed Item
• Unnamed Item
• Unnamed Item

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