Simplifying inclusion — exclusion formulas
Let F = (F 1, F 2, …, F n) be a family of n sets on a ground set S, such as a family of balls in R d. For every finite measure μ on S, such that the sets of F are measurable, the classical inclusion-exclusion formula asserts that μ (F 1 ∪ F 2 ∪ …∪ F n) = ∑I:ø≠⊆[n] (−1)¦I¦+1μ(∩i ∈IF i); that is, the measure of the union is expressed using measures of various intersections. The number of terms in this formula is exponential in n, and a significant amount of research, originating in applied areas, has been devoted to constructing simpler formulas for particular families F. We provide an upper bound valid for an arbitrary F: we show that every system F of n sets with m nonempty fields in the Venn diagram admits an inclusion-exclusion formula with m O (log2 n) terms and with ±1 coefficients, and that such a formula can be computed in m O (log2 n) expected time.
KeywordsSimplicial Complex Travel Salesman Problem Venn Diagram Expected Time Bonferroni Inequality
Unable to display preview. Download preview PDF.
- D. Attali and H. Edelsbrunner, Inclusion-exclusion formulas from independent complexes, Discrete Comput. Geom. 37(1) (2007),.Google Scholar
- C. E. Bonferroni, Teoria statistica delle classi e calcolo delle probabilità, Pubbl. d. R. Ist. Super. di Sci. Econom. e Commerciali di Firenze 8 (1936), 1–62.Google Scholar
- K. Dohmen, “Improved Bonferroni Inequalities via Abstract Tubes”, volume 1826 of Lecture Notes in Mathematics, Springer-Verlag, Berlin, 2003.Google Scholar
- X. Goaoc, J. Matoušek, P. Paták, Z. Safernová and M. Tancer, Simplifying inclusion-exclusion formulas, preprint; http://arxiv.org/abs/1207.2591, 2012.
- J. M. M. van Rooij, J. Nederlof and T. C. van Dijk, Inclusion/exclusion meets measure and conquer: exact algorithms for counting dominating sets, In: “Algorithms—ESA 2009”, volume 5757 of Lecture Notes in Comput. Sci., Springer, Berlin, 2009, 554–565.Google Scholar