Abstract
We show that the longest k-alternating substring of a random permutation has length asymptotic to 2 (n-k) / 3.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.