arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1801.04706math.CO
收藏

无序消去容斥法

Inclusion-exclusion by ordering-free cancellation

Yin Chen, Jianguo Qian

摘要:

惠特尼的断路定理给出了一个图形的例子,以减少在包含-排除公式的总和预测取消的项数。到目前为止,已知的取消的公式强烈依赖于规定的(线性或部分)排序的指标集。我们给出了一种新的消去方法,它不需要在索引集上进行任何排序。我们的方法扩展了文献中已知的所有“基于排序”的方法,并在一般情况下减少了更多的条款。作为例子,我们用我们的方法改进了图多项式的一些相关结果。

英文摘要:

Whitney's broken circuit theorem gives a graphical example to reduce the number of the terms in the sum of the inclusion-exclusion formula by a predicted cancellation. So far, the known cancellations for the formula strongly depend on the prescribed (linear or partial) ordering on the index set. We give a new cancellation method, which does not require any ordering on the index set. Our method extends all the `ordering-based' methods known in the literatures and in general reduces more terms. As examples, we use our method to improve some relevant results on graph polynomials.

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

↑