On the longest k-alternating subsequence
classification
🧮 math.CO
keywords
k-alternatinglongestasymptoticlengthpermutationrandomsubsequencesubstring
read the original abstract
We show that the longest k-alternating substring of a random permutation has length asymptotic to 2 (n-k) / 3.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.