准Fisher族
Almost-Fisher families
摘要:
组合设计理论中的一个经典定理是Fisher不等式,它指出$[n]$的子集族$\mathcal F$,其所有成对交叉的大小为$λ$,最多可以有$n$非空集。可以通过要求对于$\mathcal F$中的每个集合,除了至多$k$之外,其成对交集的所有$k$具有大小$λ$来削弱该条件。我们称这样的族为$k$ -几乎$λ$ -Fisher。武是第一个研究最大规模的家庭,证明了$k=1$最大的家庭有$2n-2$集,并表征时达到平等。我们大大改进了他的结果,显示了最大家庭的大小取决于$λ$。特别是,我们证明,小$λ$一个基本上恢复费舍尔的界限。我们还解决了$k=2$的下一个开放情况,并获得了一般$k$的第一个非平凡上界。
英文摘要:
A classic theorem in combinatorial design theory is Fisher's inequality, which states that a family $\mathcal F$ of subsets of $[n]$ with all pairwise intersections of size $λ$ can have at most $n$ non-empty sets. One may weaken the condition by requiring that for every set in $\mathcal F$, all but at most $k$ of its pairwise intersections have size $λ$. We call such families $k$-almost $λ$-Fisher. Vu was the first to study the maximum size of such families, proving that for $k=1$ the largest family has $2n-2$ sets, and characterising when equality is attained. We substantially refine his result, showing how the size of the maximum family depends on $λ$. In particular we prove that for small $λ$ one essentially recovers Fisher's bound. We also solve the next open case of $k=2$ and obtain the first non-trivial upper bound for general $k$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。