A new method for generating Bonferroni-type inequalities by iteration

DOI10.1017/S0305004100068857zbMath0672.60031OpenAlexW1984572897MaRDI QIDQ3825841

Yuan Xu, Janos Galambos

Publication date: 1990

Published in: Mathematical Proceedings of the Cambridge Philosophical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0305004100068857

zbMATH Keywords

iteration methodoptimal boundsbinomial momentsBonferroni-type inequalitynumber of occurrences

Mathematics Subject Classification ID

Inequalities; stochastic orderings (60E15) Exact distribution theory in statistics (62E15) Combinatorial probability (60C05)

Related Items

Improved bivariate Bonferroni-type inequalities ⋮ Inclusion-exclusion: exact and approximate ⋮ The maximal probability that k‐wise independent bits are all 1 ⋮ Some Optimal Bivariate Bonferroni-Type Bounds

Cites Work

• Unnamed Item
• Unnamed Item
• Iterating Bonferroni bounds
• Some inequalities of Bonferroni-Galambos type
• Bonferroni inequalities
• The Intermediate Prime Divisors of Integers
• Bonferroni-Type Inequalities Via Interpolating Polynomials
• Bounds on the probability of the union and intersection of m events
• Most Stringent Bounds on Aggregated Probabilities of Partially Specified Dependent Probability Systems
• Methods for Proving Bonferroni Type Inequalities
• An Inequality for Probabilities
• On Bonferroni-Type Inequalities of the Same Degree for the Probability of Unions and Intersections