Abstract
In this chapter we begin by defining partially ordered sets, linear extensions, the dual of a poset, and the disjoint union of two posets. We then define further combinatorial objects we will need including compositions, partitions, diagrams and Young tableaux, reverse tableaux, Young’s lattice and Schensted insertion.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Fulton, W.: Young tableaux. With applications to representation theory and geometry. Cambridge University Press, Cambridge (1997)
Gelfand, I., Krob, D., Lascoux, A., Leclerc, B., Retakh, V., Thibon, J.-Y.: Noncommutative symmetric functions. Adv. Math. 112, 218–348 (1995)
Haglund, J., Luoto, K., Mason, S., van Willigenburg, S.: Quasisymmetric Schur functions. J. Combin. Theory Ser. A 118, 463–490 (2011)
Sagan, B.: The symmetric group. Representations, combinatorial algorithms, and symmetric functions. Second edition. Springer-Verlag, New York (2001)
Stanley, R.: Enumerative combinatorics. Vol. 2. Cambridge University Press, Cambridge (1999)
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2013 Kurt Luoto, Stefan Mykytiuk, Stephanie van Willigenburg
About this chapter
Cite this chapter
Luoto, K., Mykytiuk, S., van Willigenburg, S. (2013). Classical combinatorial concepts. In: An Introduction to Quasisymmetric Schur Functions. SpringerBriefs in Mathematics. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-7300-8_2
Download citation
DOI: https://doi.org/10.1007/978-1-4614-7300-8_2
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4614-7299-5
Online ISBN: 978-1-4614-7300-8
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)