A Note on the Expected Length of the Longest Common Subsequences of two i.i.d. Random Permutations

被引：0
|
作者：
Houdre, Christian [1 ]
Xu, Chen [1 ]
机构：
[1] Georgia Inst Technol, Sch Math, Atlanta, GA 30332 USA
来源：
ELECTRONIC JOURNAL OF COMBINATORICS | 2018年 / 25卷 / 02期
关键词：
D O I：
暂无
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
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, ...n}. The question is resolved by showing that the minimal expectation is not attained in the uniform case. The conjecture asserts that root n is a lower bound on this expectation, but we only obtain (3)root n for it.
引用
收藏
页数：10
相关论文
共 50 条
12345