On covering by translates of a set
In this paper we study the minimal number τ(S,G) of translates of an arbitrary subset S of a group G needed to cover the group, and related notions of the efficiency of such coverings. We focus mainly on finite subsets in discrete groups, reviewing the classical results in this area, and generalizing them to a much broader context. For example, the worst-case efficiency when S has k elements is of order 1/log k. We show that if n(k) grows at a suitable rate with k, then almost every k-subset of any given group with order n comes close to this worst-case bound. In contrast, if n(k) grows very rapidly, or if k is fixed and n →∞, then almost every k-subset of the cyclic group with order n comes close to the optimal efficiency. © 2010 Wiley Periodicals, Inc.
Random Structures and Algorithms
Bollobás, B., Janson, S., & Riordan, O. (2011). On covering by translates of a set. Random Structures and Algorithms, 38 (1-2), 33-67. https://doi.org/10.1002/rsa.20346