English

On the longest k-alternating subsequence

Combinatorics 2014-06-23 v1

Abstract

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

Cite

@article{arxiv.1406.5207,
  title  = {On the longest k-alternating subsequence},
  author = {Igor Pak and Robin Pemantle},
  journal= {arXiv preprint arXiv:1406.5207},
  year   = {2014}
}
R2 v1 2026-06-22T04:42:48.043Z