Shannon容量、Chess、DNA和Umbrellas
Shannon capacity, Chess, DNA and Umbrellas
摘要:
在信息论中,一个令人烦恼的公开问题是寻找大于五边形的奇循环图的Shannon容量,特别是对于七边形。通过求解国王棋问题得到了容量的下界。上界是通过解决纠缠问题得到的,即找到好的Lovasz保护伞,图的量子态实现。我们观察到最优状态总是纯态。其余的都是暂时的。一个普遍有趣的问题是香农容量是否总是图的n次幂的独立数的某个n次方根。
英文摘要:
A vexing open problem in information theory is to find the Shannon capacity of odd cyclic graphs larger than the pentagon and especially for the heptagon. Lower bounds for the capacity are obtained by solving King chess puzzles. Upper bounds are obtained by solving entanglement problems, that is to find good Lovasz umbrellas, quantum state realizations of the graph. We observe that optimal states are always pure states. The rest is expository. One general interesting question is whether the Shannon capacity is always some n-th root of the independence number of the n'th power of the graph.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。