Longest Increasing and Decreasing Subsequences
Longest Increasing and Decreasing Subsequences
复制标题
DOI：
10.4153/cjm-1961-015-3
复制
发表时间：
1961
期刊：
影响因子：
--
通讯作者：
C. Schensted
中科院分区：
文献类型：
--
作者：
C. Schensted
本文研究有限整数序列。我们将处理的典型问题是确定长度为n的序列的数目，该序列由整数1、2、…组成M，它们具有长度为α的最长递增子序列。在这篇论文的第一部分，我们将只讨论其中没有数字重复的序列。在第二部分中，我们将扩展结果以包括重复的可能性。我们的结果将以标准的Young画面表示。
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.