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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.