On Increasing Subsequences of Random Per
โ
Jeong Han Kim
๐
Article
๐
1996
๐
Elsevier Science
๐
English
โ 292 KB
Let L n be the length of a longest increasing subsequence in a random permutation of [1, ..., n]. It is known that the expected value of L n is asymptotically equal to 2 -n as n gets large. This note derives upper bound on the probability that L n &2 -n exceeds certain quantities. In particular, we