Downloads provided by UsageCounts
handle: 10261/31107
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.
Graph theory, Divisors, Lattice points, Divisors of polynomials, Coding theory, Probability of intersections, Sidon sets
Graph theory, Divisors, Lattice points, Divisors of polynomials, Coding theory, Probability of intersections, Sidon sets
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 2 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
| views | 39 | |
| downloads | 103 |

Views provided by UsageCounts
Downloads provided by UsageCounts