Asymptotic results on weakly increasing subsequences in random words

On unfair permutations

“…The discussion on number of inversions can be generalized to increasing (or decreasing) sequences of arbitrary length. This statistic in uniformly random permutation framework was previously studied in [5]. Their proof is a lot simpler due to underlying symmetry.…”