On the longest k-alternating subsequence

Abstract

We show that the longest k-alternating substring of a random permutation has length asymptotic to 2 (n-k) / 3.