arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1312.6490cs.ITmath.IT
收藏

Book不等式

Book inequalities

Laszlo Csirmaz

摘要:

信息论不等式与多拟阵及其可表示性有着密切的联系。一个多拟阵是熵的,如果它的秩函数由某些离散随机变量子集的Shannon熵给出。这本书是一个特殊的迭代粘合剂扩展的polymatroids的财产,熵polymatroids有$n$页书的扩展在任意的脊柱。我们证明了每一个多拟阵有一个$n$页书扩展在一个单一的元素和所有,但一个元素的脊椎。因此,对于四个元素上的多拟阵,只有两个元素的书脊上的书扩展应该被考虑。F. Matústan证明了张杨不等式刻画了四个元素上的多拟阵,它们具有这样的2页书扩展。定义了$n$ -页书不等式,刻画了二元脊上四元多拟阵的$n$ -页书扩张.我们证明了这个条件是必要的,因此每个Book不等式都是关于四个随机变量的信息不等式。使用计算机辅助多目标优化,该条件的充分性被验证为9页的书扩展。

英文摘要:

Information theoretical inequalities have strong ties with polymatroids and their representability. A polymatroid is entropic if its rank function is given by the Shannon entropy of the subsets of some discrete random variables. The book is a special iterated adhesive extension of a polymatroid with the property that entropic polymatroids have $n$-page book extensions over an arbitrary spine. We prove that every polymatroid has an $n$-page book extension over a single element and over an all-but-one-element spine. Consequently, for polymatroids on four elements, only book extensions over a two-element spine should be considered. F. Matúš proved that the Zhang-Yeung inequalities characterize polymatroids on four elements which have such a 2-page book extension. The $n$-page book inequalities, defined in this paper, are conjectured to characterize polymatroids on four elements which have $n$-page book extensions over a two-element spine. We prove that the condition is necessary; consequently every book inequality is an information inequality on four random variables. Using computer-aided multiobjective optimization, the sufficiency of the condition is verified up to 9-page book extensions.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑