对称容斥
Symmetric inclusion-exclusion
摘要:
容斥原理的一种形式断言,如果A和B是有限集的函数,则A(S)是B(T)在S的所有子集T上的和,当且仅当B(S)是(-1)^|S-T| A(T)在S的所有子集T上。如果我们用(-1)^ |S| B(S)代替B(S),我们得到包含-排除的对称形式:A(S)是S的所有子集T上的(-1)^ |T| B(T)的和当且仅当B(S)是S的所有子集T上的(-1)^ |T| A(T)的和。我们研究对称包容-排斥的实例,其中函数A和B具有组合或概率解释。特别地,我们研究了与Polya-Eggenberger瓮模型相关的情况,其中A(S)和B(S)仅依赖于S的基数。
英文摘要:
One form of the inclusion-exclusion principle asserts that if A and B are functions of finite sets then A(S) is the sum of B(T) over all subsets T of S if and only if B(S) is the sum of (-1)^|S-T| A(T) over all subsets T of S. If we replace B(S) with (-1)^|S| B(S), we get a symmetric form of inclusion-exclusion: A(S) is the sum of (-1)^|T| B(T) over all subsets T of S if and only if B(S) is the sum of (-1)^|T| A(T) over all subsets T of S. We study instances of symmetric inclusion-exclusion in which the functions A and B have combinatorial or probabilistic interpretations. In particular, we study cases related to the Polya-Eggenberger urn model in which A(S) and B(S) depend only on the cardinality of S.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。