A Probabilistic Approach to the Asymptotics of the Length of the Longest Alternating Subsequence
Keyword(s):
Let $LA_{n}(\tau)$ be the length of the longest alternating subsequence of a uniform random permutation $\tau\in\left[ n\right] $. Classical probabilistic arguments are used to rederive the asymptotic mean, variance and limiting law of $LA_{n}\left( \tau\right) $. Our methodology is robust enough to tackle similar problems for finite alphabet random words or even Markovian sequences in which case our results are mainly original. A sketch of how some cases of pattern restricted permutations can also be tackled with probabilistic methods is finally presented.
1992 ◽
Vol 1
(2)
◽
pp. 107-114
◽
Keyword(s):
1983 ◽
Vol 73
(4)
◽
pp. 1225-1241
2015 ◽
Vol 732
◽
pp. 313-318
2021 ◽
Vol 38
◽
pp. 65-83
2005 ◽
Vol 52
(1)
◽
pp. 3-10
◽