An overlapping theorem with applications
Résumé
We establish a general and optimal lower bound for the complete sum of the probabilities of k-intersections of n events. We then describe various applications to additive and multiplicative number theory, graph theory, coding theory, study of lattice points on circles, and divisors of polynomials.
Origine : Fichiers produits par l'(les) auteur(s)
Loading...