Abstract
This paper deals with finite sequences of integers. Typical of the problems we shall treat is the determination of the number of sequences of length n, consisting of the integers 1,2, ... , m, which have a longest increasing subsequence of length α. Throughout the first part of the paper we will deal only with sequences in which no numbers are repeated. In the second part we will extend the results to include the possibility of repetition. Our results will be stated in terms of standard Young tableaux.
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
Preview
Unable to display preview. Download preview PDF.
References
J. S. Frame, G. de B. Robinson, and R. M. Thrall, The hook graphs of the symmetric group, Can. J. Math., 6 (1954), 316.
D. E. Rutherford, Substitutional analysis (Edinburgh University Press, 1948), p. 26.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Birkhäuser Boston, a part of Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Schensted, C. (2009). Longest Increasing and Decreasing Subsequences. In: Gessel, I., Rota, GC. (eds) Classic Papers in Combinatorics. Modern Birkhäuser Classics. Birkhäuser Boston. https://doi.org/10.1007/978-0-8176-4842-8_21
Download citation
DOI: https://doi.org/10.1007/978-0-8176-4842-8_21
Publisher Name: Birkhäuser Boston
Print ISBN: 978-0-8176-4841-1
Online ISBN: 978-0-8176-4842-8
eBook Packages: Springer Book Archive