On the longest \(k\)-alternating subsequence (Q2260622)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the longest k-alternating subsequence |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the longest \(k\)-alternating subsequence |
scientific article |
Statements
On the longest \(k\)-alternating subsequence (English)
0 references
11 March 2015
0 references
Summary: We show that the longest \(k\)-alternating substring of a random permutation has length asymptotic to \(2(n-k)/3\).
0 references
0 references
0 references
