Skip to main content

On Some Properties of Robinson-Schensted Correspondence

  • Conference paper
ICM-90 Satellite Conference Proceedings

Abstract

Some new results related to C. Green’s theorem about the shape of Young tableaux P and Q which correspond to the fixed permutation under Robinson-Schensted correspondence are presented. The results are based on the theory of rigged and filled configurations. We give the explicit description of the first tableaux of the filled configuration for Young tableaux P (or Q) in terms of the structure of descents of the corresponding permutation.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. C. Schensted, Longest increasing and decreasing subsequences, Canad. J. Math. 13 (1961), 179–191.

    Article  MathSciNet  MATH  Google Scholar 

  2. C. Greene, An extension of Schensted’s theorem, Advances in Math., 14 (1974), 254–265.

    Article  MathSciNet  MATH  Google Scholar 

  3. C. Greene, Some or der-theoretic properties of the Robinson-Schensted correspondence, Led. Notes in Math., 579 (1976), 114–120.

    Article  MathSciNet  Google Scholar 

  4. S. V. Kerov, A. M. Vershik, The characters of the infinite symmetric group and probability properties of the Robinson-Schensted-Knuth algorithm, SIAM Journ. alg. math., 7 (1984), 116–124.

    MathSciNet  Google Scholar 

  5. S. V. Fomin, Finite partially ordered sets and Young tableaux, Soviet Math. Dokl., 19 (1978), 1510–1514.

    MATH  Google Scholar 

  6. A. N. Kirillov, N. Yu. Reshetikhin, Bethe ansatz and the combinatorics of Young tableaux, Zap. Nauch. Semin. LOMI, 155 (1986), 65–115 (in Russian).

    MATH  Google Scholar 

  7. A. N. Kirillov, On the Kostka-Green-Foulkes polynomials and Clebsch-Gordan numbers, JGP, 5 (1988), 365–389.

    MathSciNet  MATH  Google Scholar 

  8. M. -P. Schützenberger, La correspondance de Robinson, Lect. Notes in Math., 579 (1976), 59–113.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Tokyo

About this paper

Cite this paper

Kirillov, A. (1991). On Some Properties of Robinson-Schensted Correspondence. In: Kashiwara, M., Miwa, T. (eds) ICM-90 Satellite Conference Proceedings. Springer, Tokyo. https://doi.org/10.1007/978-4-431-68170-0_7

Download citation

  • DOI: https://doi.org/10.1007/978-4-431-68170-0_7

  • Publisher Name: Springer, Tokyo

  • Print ISBN: 978-4-431-70085-2

  • Online ISBN: 978-4-431-68170-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics