arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2210.07924cs.ITmath.IT
收藏

关于三消元Fourier-Motzkin消元法的注记

A Note on Fourier-Motzkin Elimination with Three Eliminating Variables

Hao Xu, Kai-Kit Wong, Giuseppe Caire

摘要:

在这篇文章中,我们展示了暴力傅里叶-莫茨金消除是多么困难,即使在一个简单的情况下,有三个消除变量。首先给出了一个在多址窃听(MAC-WT)信道的信息论安全性研究中起着重要作用的定理,然后直接利用Fourier-Motzkin过程对三个用户的情况进行了证明.结果表明,大量的不等式产生的消元过程中,其中大部分是多余的。实际上,生成的不等式的数量随着用户或消除变量的数量呈指数增长。因此,用这种蛮力的方法直接证明定理变得难以管理。除了极大的复杂性之外,直接策略的另一个缺点是它只在用户数量给定的情况下才有效。显然,这使得该策略不适合定理的证明,因为它是任何数量的用户的一般结果。因此,一般性地证明该定理是迫切的和具有挑战性的。

英文摘要:

In this note, we show how difficult the brute-force Fourier-Motzkin elimination is, even in a simple case with three eliminating variables. Specifically, we first give a theorem, which plays quite an important role in the study of information-theoretic security for a multiple access wiretap (MAC-WT) channel, and then prove it for the case with three users by directly using the Fourier-Motzkin procedure. It is shown that large amounts of inequalities are generated in the elimination procedure while most of them are redundant. Actually, the number of generated inequalities grows doubly exponentially with the number of users or eliminating variables. It thus becomes unmanageable to directly prove the theorem in this brute-force way. Besides the great complexity, another disadvantage of the direct strategy is that it works only if the number of users is given. Obviously, this makes the strategy inappropriate for the proof of the theorem since it is a general result for any number of users. It is thus urgent and challenging to generally prove the theorem.

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

↑