arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0910.3815math.COmath.NT
收藏

关于集合的平移覆盖

On covering by translates of a set

Bela Bollobas, Svante Janson, Oliver Riordan

摘要:

在本文中,我们研究的任意子集$S$的一个组$G$覆盖所需的最小数量的翻译,以及相关的概念,这种覆盖的效率。我们主要关注离散群中的有限子集,回顾这一领域的经典结果,并将其推广到更广泛的背景下。例如,我们表明,当$S$具有$k$元素时,最坏情况下的效率是$1/\log k$阶,对于$k$固定和$n$大,几乎任何给定$n$元素组的每个$k$子集都以接近最佳效率覆盖$G$。

英文摘要:

In this paper we study the minimal number 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, we show that while the worst-case efficiency when $S$ has $k$ elements is of order $1/\log k$, for $k$ fixed and $n$ large, almost every $k$-subset of any given $n$-element group covers $G$ with close to optimal efficiency.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑