Let be i.i.d random variables uniformly on [0,1]. Let be the length of the longest increasing subsequence of . Show that
Using the Erdos' lemma I can only deduce that , which is a weaker bound unfortunately.
I would appreciate any further ideas!
Thanks for your help,
PS: Would it be more suitable to post it in the statistics forum?