Skip to main content
SpringerLink
Log in

A Glimpse of Young Tableaux

  • Chapter
  • First Online:
Algebraic Combinatorics

Part of the book series: Undergraduate Texts in Mathematics ((UTM))

  • 4530 Accesses

Abstract

We defined in Chapter 6 Young’s lattice Y , the poset of all partitions of all nonnegative integers, ordered by containment of their Young diagrams.

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

Access this chapter

Log in via an institution
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 EPUB and 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
Hardcover Book
USD 54.99
Price excludes VAT (USA)
  • Durable hardcover 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

Notes

  1. 1.

    The phrase “the right-hand side, on the other hand” does not mean the left-hand side!

References

  1. E.A. Beem, Craige and Irene Schensted don’t have a car in the world, in Maine Times (March 12, 1982), pp. 20–21

    Google Scholar 

  2. E.A. Bender, D.E. Knuth, Enumeration of plane partitions. J. Comb. Theor. 13, 40–54 (1972)

    Article  MathSciNet  Google Scholar 

  3. S. Fomin, Duality of graded graphs. J. Algebr. Combin. 3, 357–404 (1994)

    Article  MathSciNet  Google Scholar 

  4. S. Fomin, Schensted algorithms for dual graded graphs. J. Algebr. Combin. 4, 5–45 (1995)

    Article  MathSciNet  Google Scholar 

  5. J.S. Frame, G. de B. Robinson, R.M. Thrall, The hook graphs of S n . Can. J. Math. 6 316–324 (1954)

    Google Scholar 

  6. D.S. Franzblau, D. Zeilberger, A bijective proof of the hook-length formula. J. Algorithms 3, 317–343 (1982)

    Article  MathSciNet  Google Scholar 

  7. F.G. Frobenius, Über die Charaktere der symmetrischen Gruppe, Sitzungsber. Kön. Preuss. Akad. Wissen. Berlin (1900), pp. 516–534; Gesammelte Abh. III, ed. by J.-P. Serre (Springer, Berlin, 1968), pp. 148–166

    Google Scholar 

  8. W.E. Fulton, Young Tableaux. Student Texts, vol. 35 (London Mathematical Society/Cambridge University Press, Cambridge, 1997)

    Google Scholar 

  9. C. Greene, A. Nijenhuis, H.S. Wilf, A probabilistic proof of a formula for the number of Young tableaux of a given shape. Adv. Math. 31, 104–109 (1979)

    Article  MathSciNet  Google Scholar 

  10. A.P. Hillman, R.M. Grassl, Reverse plane partitions and tableaux hook numbers. J. Comb. Theor. A 21, 216–221 (1976)

    Article  Google Scholar 

  11. C. Krattenthaler, Bijective proofs of the hook formulas for the number of standard Young tableaux, ordinary and shifted. Electronic J. Combin. 2, R13, 9 pp. (1995)

    Google Scholar 

  12. D.E. Knuth, Permutations, matrices, and generalized Young tableaux. Pac. J. Math. 34, 709–727 (1970)

    Article  MathSciNet  Google Scholar 

  13. P.A. MacMahon, Memoir on the theory of the partitions of numbers — Part I. Philos. Trans. R. Soc. Lond. A 187, 619–673 (1897); Collected Works, vol. 1, ed. by G.E. Andrews (MIT, Cambridge, 1978), pp. 1026–1080

    Google Scholar 

  14. P.A. MacMahon, Memoir on the theory of the partitions of numbers — Part IV. Philos. Trans. R. Soc. Lond. A 209, 153–175 (1909); Collected Works, vol. 1, ed. by G.E. Andrews (MIT, Cambridge, 1978), pp. 1292–1314

    Google Scholar 

  15. P.A. MacMahon, Combinatory Analysis, vols. 1, 2 (Cambridge University Press, Cambridge, 1915/1916); Reprinted in one volume by Chelsea, New York, 1960

    Google Scholar 

  16. J.-C. Novelli, I. Pak, A.V. Stoyanovskii, A new proof of the hook-length formula. Discrete Math. Theor. Comput. Sci. 1, 053–067 (1997)

    MathSciNet  MATH  Google Scholar 

  17. J.B. Remmel, Bijective proofs of formulae for the number of standard Young tableaux. Linear Multilinear Algebra 11, 45–100 (1982)

    Article  MathSciNet  Google Scholar 

  18. G. de B. Robinson, On the representations of S n . Am. J. Math. 60, 745–760 (1938)

    Google Scholar 

  19. B.E. Sagan, The Symmetric Group, 2nd edn. (Springer, New York, 2001)

    Book  Google Scholar 

  20. C.E. Schensted, Longest increasing and decreasing subsequences. Can. J. Math. 13, 179–191 (1961)

    Article  MathSciNet  Google Scholar 

  21. R. Stanley, Differential posets. J. Am. Math. Soc. 1, 919–961 (1988)

    Article  MathSciNet  Google Scholar 

  22. R. Stanley, Variations on differential posets, in Invariant Theory and Tableaux, ed. by D. Stanton. The IMA Volumes in Mathematics and Its Applications, vol. 19 (Springer, New York, 1990), pp. 145–165

    Google Scholar 

  23. R. Stanley, Enumerative Combinatorics, vol. 1, 2nd edn. (Cambridge University Press, Cambridge, 2012)

    Google Scholar 

  24. R. Stanley, Enumerative Combinatorics, vol. 2 (Cambridge University Press, New York, 1999)

    Book  Google Scholar 

  25. M.A.A. van Leeuwen, The Robinson-Schensted and Schützenberger algorithms, Part 1: new combinatorial proofs, Preprint no. AM-R9208 1992, Centrum voor Wiskunde en Informatica, 1992

    Google Scholar 

  26. A. Young, Qualitative substitutional analysis (third paper). Proc. Lond. Math. Soc. (2) 28, 255–292 (1927)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Massachusetts Institute of Technology, Cambridge, MA, USA

    Richard P. Stanley

Authors
  1. Richard P. Stanley
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Stanley, R.P. (2018). A Glimpse of Young Tableaux. In: Algebraic Combinatorics. Undergraduate Texts in Mathematics. Springer, Cham. https://doi.org/10.1007/978-3-319-77173-1_8

Download citation

Publish with us

Policies and ethics

Search

Navigation