Longest Increasing and Decreasing Subsequences

doi:10.4153/cjm-1961-015-3

Longest Increasing and Decreasing Subsequences

2018-11-20

0

OA

AI

DOI：10.4153/cjm-1961-015-3

原文链接

查看原文

摘要

En 中文

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.

Longest Increasing and Decreasing Subsequences

摘要

AI总结

期刊

机构

引用论文