arXiv
Open Access
2014
On the longest k-alternating subsequence
Igor Pak
Robin Pemantle
Abstrak
We show that the longest k-alternating substring of a random permutation has length asymptotic to 2 (n-k) / 3.
Topik & Kata Kunci
Penulis (2)
I
Igor Pak
R
Robin Pemantle
Akses Cepat
Informasi Jurnal
- Tahun Terbit
- 2014
- Bahasa
- en
- Sumber Database
- arXiv
- Akses
- Open Access ✓