Long Unimodal Subsequences: A Problem of F.R.K. Chung.
STANFORD UNIV CA DEPT OF STATISTICS
Pagination or Media Count:
Let ln be the expected length of the longest unimodal subsequence of a random permutation. It is proved here that lnsq. root of n converges to 2 sq. root of 2. This settles a conjecture of F.R.K. Chung. Author
- Statistics and Probability