设计大集的概率存在性
Probabilistic Existence of Large Sets of Designs
摘要:
最近,Kuperberg、Lovett和Peled(STOC 2012)引入了一种新的概率技术,用于确定某些正则组合结构的存在性。使用这种技术,可以表明,在某些条件下,随机选择的结构具有$t$ - $(n,k,λ)$组合设计所需的性质,具有微小的,但积极的概率。KLP的证明方法适用于证明如下的大设计集和类似的组合结构的存在性。我们修改的随机选择和分析表明,在相同的条件下,不仅存在一个$t$ - $(n,k,λ)$设计,但事实上,正概率存在一个大的这样的设计集-也就是说,一个分区的$k$ -子集的$[n]$到$t$ -设计$t$ - $(n,k,λ)$设计。具体来说,使用本文推导的概率方法,我们证明了,对于所有足够大的$n$,大的$t$ - $(n,k,λ)$设计集存在时,$k > 12t$和必要的整除条件得到满足。这解决了所有$k > 12t$的大型设计集的存在性猜想。
英文摘要:
A new probabilistic technique for establishing the existence of certain regular combinatorial structures has been recentlyintroduced by Kuperberg, Lovett, and Peled (STOC 2012). Using this technique, it can be shown that under certain conditions, a randomly chosen structure has the required properties of a $t$-$(n,k,λ)$ combinatorial design with tiny, yet positive, probability. The proof method of KLP is adapted to show the existence of large sets of designs and similar combinatorial structures as follows. We modify the random choice and the analysis to show that, under the same conditions, not only does a $t$-$(n,k,λ)$ design exist but, in fact, with positive probability there exists a large set of such designs -- that is, a partition of the set of $k$-subsets of $[n]$ into $t$-designs $t$-$(n,k,λ)$ designs. Specifically, using the probabilistic approach derived herein, we prove that for all sufficiently large $n$, large sets of $t$-$(n,k,λ)$ designs exist whenever $k > 12t$ and the necessary divisibility conditions are satisfied. This resolves the existence conjecture for large sets of designs for all $k > 12t$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。