Symmetric inclusion-exclusion

Details Symmetric inclusion-exclusion Symmetric inclusion-exclusion

2005-05-12

arxiv.org/abs/math/0505255v2

Mathematics

Combinatorics

10 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Symmetric inclusion-exclusion does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Symmetric inclusion-exclusion, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Symmetric inclusion-exclusion will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-163223