A note on the expected length of the longest common subsequences of two i.i.d. random permutations (Q1648658)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6895333
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on the expected length of the longest common subsequences of two i.i.d. random permutations |
scientific article; zbMATH DE number 6895333 |
Statements
A note on the expected length of the longest common subsequences of two i.i.d. random permutations (English)
0 references
27 June 2018
0 references
Summary: We address a question and a conjecture on the expected length of the longest common subsequences of two i.i.d. random permutations of \([n]:=\{1,2,\ldots,n\}\). The question is resolved by showing that the minimal expectation is not attained in the uniform case. The conjecture asserts that \(\sqrt{n}\) is a lower bound on this expectation, but we only obtain \(\root 3 \of {n}\) for it.
0 references
random permutation
0 references
longest common subsequence
0 references
0.8915015459060669
0 references
0.8793371319770813
0 references
0.8666317462921143
0 references
0.8194580674171448
0 references
0.8161532878875732
0 references
