arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv math/9511224math.CO
收藏

渐近最优覆盖设计

Asymptotically optimal covering designs

Daniel Gordon, Greg Kuperberg, Oren Patashnik, Joel Spencer

摘要:

一个(v,k,t)覆盖设计,或称覆盖,是从一个v-集合中选择的k-子集族,称为块,使得每个t-子集包含在至少一个块中。块的数目是覆盖的大小,并且这样的覆盖的最小大小由C(v,k,t)表示。很容易看出,覆盖必须至少包含(v选择t)/(k选择t)块,并且在1985年Rödl [European J. Combin. 5(1985),69-78]证明了Erdés和Hanani [Publ. Math. Debrecen 10(1963),10-13]的一个长期存在的猜想,即对于固定的k和t,存在大小为(v choose t)/(k choose t)(1+o(1))的覆盖(如v \to \infty)。前三位作者的早期论文[J. Combin。Des. 3(1995),269-284]给出了构造好覆盖的新方法,并给出了小v,k和t时C(v,k,t)上的上界表。本文证明了其中两个构造是渐近最优的:对于固定的k和t,构造的覆盖的大小与Rödl界相匹配。本文还明确了o(1)误差界,并给出了更强的误差界的证据。

英文摘要:

A (v,k,t) covering design, or covering, is a family of k-subsets, called blocks, chosen from a v-set, such that each t-subset is contained in at least one of the blocks. The number of blocks is the covering's size}, and the minimum size of such a covering is denoted by C(v,k,t). It is easy to see that a covering must contain at least (v choose t)/(k choose t) blocks, and in 1985 Rödl [European J. Combin. 5 (1985), 69-78] proved a long-standing conjecture of Erdős and Hanani [Publ. Math. Debrecen 10 (1963), 10-13] that for fixed k and t, coverings of size (v choose t)/(k choose t) (1+o(1)) exist (as v \to \infty). An earlier paper by the first three authors [J. Combin. Des. 3 (1995), 269-284] gave new methods for constructing good coverings, and gave tables of upper bounds on C(v,k,t) for small v, k, and t. The present paper shows that two of those constructions are asymptotically optimal: For fixed k and t, the size of the coverings constructed matches Rödl's bound. The paper also makes the o(1) error bound explicit, and gives some evidence for a much stronger bound.

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

↑