Abstract
Suppose that a permutation σ ∈ S n is chosen at random (n is large) and the Robinson-Schensted algorithm is applied to compute the associated Young diagram. Then for almost all permutations the number of bumping operations performed by the algorithm is about (128/27π2)n 3/2, and the number of comparison operations is about (64/27π2)n 3/2 log2 n.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
A. Barvinok and S. Fomin, Adv. in Appl. Math., 18, No.3, 271–285 (1997).
D. Bernstein, J. Symbolic Comput., 37, No.6, 727–748 (2004).
V. Ivanov and G. Olshanski, In: Symmetric Functions 2001: Surveys of Developments and Perspectives, Proc. NATO Advanced Study Institute (S. Fomin, ed.), Kluwer, 2002, pp. 93–152.
D. E. Knuth, The Art of Computer Programming, Vol. 3: Sorting and Searching, 2nd ed., Addison Wesley, 1998.
S. V. Kerov and A. M. Vershik, Dokl. Akad. Nauk USSR, 233, No.6, 1024–1027 (1977); English transl.: Soviet Math. Dokl., 18, 527–531 (1977).
S. V. Kerov and A. M. Vershik, Funkts. Anal. Prilozhen., 19, 25–38 (1985); English transl.: Funct. Anal. Appl., 19, 21–31 (1985).
B. F. Logan and L. A. Shepp, Adv. Math., 26, No.2, 206–222 (1977).
R. P. Stanley, Enumerative Combinatorics, Vol. 2., Cambridge Univ. Press, 1999.
J. R. Stembridge, In: Interaction of Combinatorics and Representation Theory, MSJ Memoirs, Vol. 11, Math. Soc. Japan, Tokyo, 2001, pp. 1–38.
Author information
Authors and Affiliations
Additional information
__________
Translated from Funktsional’nyi Analiz i Ego Prilozheniya, Vol. 39, No. 2, pp. 82–86, 2005
Original Russian Text Copyright © by D. Romik
Rights and permissions
About this article
Cite this article
Romik, D. The Number of Steps in the Robinson-Schensted Algorithm. Funct Anal Its Appl 39, 152–155 (2005). https://doi.org/10.1007/s10688-005-0030-8
Received:
Issue Date:
DOI: https://doi.org/10.1007/s10688-005-0030-8