Hypergraphs and sharpened sieve inequalities

DOI10.1016/0012-365X(92)00561-5MaRDI QIDQ1336651zbMATH OpenFDO

Publication date 28 November 1994

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365X(92)00561-5

Bonferroni inequalities finitely generated Boolean algebras hypergraph hypertrees measure space sieve inequalities

Combinatorial identities, bijective combinatorics (05A19) Combinatorial inequalities (05A20) Hypergraphs (05C65) Combinatorial probability (60C05)

Review text

It is shown that the alternating inequalities (known as Bonferroni inequalities) associated with Jordan's formulae for the probability that exactly \(m\) (and at least \(m\), respectively) of \(n\) given events occur may be sharpened by the addition of a sum whose entries are determined by the edges of a hypergraph \(H\) satisfying the following conditions (in the case when exactly \(m\) of \(n\) given events occur): \(H\) is a \(k\)-uniform hypergraph \((0\leq m< k)\) with the property that for each \(I\subseteq V(H)\), the induced partial hypergraph \(H_ I\) has at most \[ \left({| I|\atop m}\right) \left({| I|- m-1\atop k- m-1}\right) \] edges. Moreover, if \(H\) is otherwise then there exists a measure space where sharpened Bonferroni inequalities proposed in the paper do not hold. (The results are given in the broader context of measures over finitely generated Boolean algebras.) Another type of hypergraph for the same purpose was proposed by the reviewer (so-called hypertrees, defined recursively); see [J. Comb. Theory, Ser. B 41, 209-217 (1986; Zbl 0577.05052)].

Recommendations

Cites work

Cited in

(5)

This page was built for publication: Hypergraphs and sharpened sieve inequalities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1336651)