On the Longest Increasing Subsequence for Finite and Countable Alphabets

Christian houdré, Trevis J. Litherland

Let $X_1,X_2,...,X_n,...$ be a sequence of iid random variables with values in a finite alphabet $\{1,...,m\}$. Let $L{I}_n$ be the length of the longest increasing subsequence…