Bonferroni-Galambos inequalities for partition lattices (Q1773163): Difference between revisions

Summary: We establish a new analogue of the classical Bonferroni inequalities and their improvements by Galambos for sums of type \(\sum_{\pi\in {\mathbb P}(U)} (-1)^{|\pi|-1} (|\pi|-1)! f(\pi)\) where \(U\) is a finite set, \({\mathbb P}(U)\) is the partition lattice of \(U\) and \(f:{\mathbb P}(U)\rightarrow{\mathbb R}\) is some suitable non-negative function. Applications of this new analogue are given to counting connected \(k\)-uniform hypergraphs, network reliability, and cumulants.