When the law of large numbers fails for increasing subsequences of random permutations (Q2371955): Difference between revisions

Let \(Z_{n,k}\) denote the number of increasing subsequences of length \(k\) in a random permutation from \(S_n,\) the symmetric group of permutations of \(\{1,\dots,n\}.\) The author proved earlier that the weak law of large numbers holds for the sequence \(Z_{n,k_n}\) if \(k_n= o(n^{2/5})\) [cf. Random Struct. Algorithms 29, No. 3, 277--295 (2006; Zbl 1111.60006)]. The author now shows that the law of large numbers fails for \(Z_{n,k_n}\) if \(\limsup_{n\rightarrow \infty}(k_n/n^{4/9})= \infty.\)