On the Longest $k$-Alternating Subsequence

  • Igor Pak
  • Robin Pemantle
DOI: https://doi.org/10.37236/4480

Abstract

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

Author Biographies

Igor Pak, University of California at Los Angeles
Department of Mathematics
Robin Pemantle, University of Pennsylvania
Department of Mathematics
Published
2015-02-25
How to Cite
Pak, I., & Pemantle, R. (2015). On the Longest $k$-Alternating Subsequence. The Electronic Journal of Combinatorics, 22(1), P1.48. https://doi.org/10.37236/4480
Issue
Volume 22, Issue 1 (2015)
Article Number
P1.48