arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1808.02352math.CO
收藏

集合系统的VC维数与并定理

VC dimension and a union theorem for set systems

Stijn Cambie, António Girão, Ross J. Kang

摘要:

固定正整数$k$和$d$。我们证明了,作为$n\to\infty$,任何集合系统$\mathcal{A} \subset 2^{[n]}$,$\{ \triangle_{i=1}^k S_i \mid S_i \in \mathcal{A}\}$的VC维至多为$d$,其大小至多为$(2^{d\bmod{k}}+o(1))\binom{n}{\lfloor d/k\rfloor}$。这里,$\triangle$表示对称差分算子。这是对Dvir和Moran的结果的$k$折叠概括,它解决了他们的一个问题。一个关键的见解是,通过压缩的方法,这个问题是等价于一个极值集理论问题的$k$明智的交叉或工会,最初是由于Erdibs和Frankl。我们也给出了一个例子,一个家庭$\mathcal{A} \subset 2^{[n]}$,$\mathcal{A}\cap \mathcal{A}$和$\mathcal{A}\cup \mathcal{A}$的VC维都是最多$d$,而$\lvert \mathcal{A} \rvert = Ω(n^d)$。这为Dvir和Moran的另一个问题提供了否定的答案。

英文摘要:

Fix positive integers $k$ and $d$. We show that, as $n\to\infty$, any set system $\mathcal{A} \subset 2^{[n]}$ for which the VC dimension of $\{ \triangle_{i=1}^k S_i \mid S_i \in \mathcal{A}\}$ is at most $d$ has size at most $(2^{d\bmod{k}}+o(1))\binom{n}{\lfloor d/k\rfloor}$. Here $\triangle$ denotes the symmetric difference operator. This is a $k$-fold generalisation of a result of Dvir and Moran, and it settles one of their questions. A key insight is that, by a compression method, the problem is equivalent to an extremal set theoretic problem on $k$-wise intersection or union that was originally due to Erdős and Frankl. We also give an example of a family $\mathcal{A} \subset 2^{[n]}$ such that the VC dimension of $\mathcal{A}\cap \mathcal{A}$ and of $\mathcal{A}\cup \mathcal{A}$ are both at most $d$, while $\lvert \mathcal{A} \rvert = Ω(n^d)$. This provides a negative answer to another question of Dvir and Moran.

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

↑