A Probabilistic Approach to the Asymptotics of the Length of the Longest Alternating Subsequence
Christian Houdré, Ricardo Restrepo · The Electronic Journal of Combinatorics · 2010
Not cached yet. This record was fetched live for this request and is stored after the lookup. Reopening the page should serve the cached copy.
The Electronic Journal of Combinatorics · Electronic Journal of Combinatorics · article · 2010
Abstract
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.
Open the resolved locator · 10.37236/440
Metadata licence: OpenAlex metadata (CC0)