AI 中文总结
研究证明覆盖数C(12,6,4)为41。通过计数论证、案例分析及可满足性求解，结合证书验证，得出不存在40个块的4 - (12,6,1)覆盖，还得到最优3 - (11,5,1)覆盖唯一性等结论，新值传播到相关覆盖数下界。
AI 中文摘要
一个t - (v,k,λ)覆盖是v元集的k子集（块）的集合，使得每个t子集至少包含在λ个块中；覆盖数C_λ(v,k,t)是这样一个集合中块的最少数量，当λ = 1时记为C(v,k,t)。已记录的C(12,6,4)的界为40 ≤ C(12,6,4) ≤ 41。我们证明不存在有40个块的4 - (12,6,1)覆盖，因此C(12,6,4)=41。通过计数论证表明在假设的40 - 块覆盖中每个点恰好位于20个块中，每个点的链接是具有强制度序列的最优3 - (11,5,1)覆盖，且六对度为10的点形成完美匹配。通过可满足性求解对阶为3840的群的轨道进行详尽的案例分析，表明不存在这样的最优3 - (11,5,1)覆盖作为链接。主要证明中的81个公式都有不可满足性证书，由drat - trim和形式验证检查器cake_lpr检查，另外两个交叉编码证书也由相同管道检查。下界论证不使用列表覆盖数，其唯一数值输入C(10,4,2) ≥ 9也经过认证。作为副产品，证书产生了一个自包含的认证证明，即最优3 - (11,5,1)覆盖在同构意义下是唯一的。等价地，图兰数T(12,8,6)为41；新值传播到C(13,7,5)、C(14,8,6)、C(15,9,7)和C(16,10,8)的改进下界。
英文摘要
A $t$-$(v,k,λ)$ covering is a collection of $k$-subsets (blocks) of a $v$-set such that every $t$-subset of points lies in at least $λ$ blocks; the covering number $C_λ(v,k,t)$ is the least number of blocks in such a collection, and one writes $C(v,k,t)$ when $λ=1$. The recorded bounds for $C(12,6,4)$ have been $40 \le C(12,6,4) \le 41$. We show that no $4$-$(12,6,1)$ covering with $40$ blocks exists, and hence that $C(12,6,4)=41$. A counting argument shows that in a hypothetical $40$-block covering every point lies in exactly $20$ blocks, the link of every point is an optimal $3$-$(11,5,1)$ covering with a forced degree sequence, and the six pairs of points of degree $10$ form a perfect matching; an exhaustive case analysis over the orbits of a group of order $3840$, carried out by satisfiability solving, then shows that no optimal $3$-$(11,5,1)$ covering occurs as such a link. Each of the $81$ formulas in the primary proof has an unsatisfiability certificate checked by drat-trim and by the formally verified checker cake_lpr; two additional cross-encoding certificates are checked by the same pipeline. The lower-bound argument uses no tabulated covering number: its only numerical input, $C(10,4,2) \ge 9$, is itself certified. As a by-product the certificates yield a self-contained certified proof that the optimal $3$-$(11,5,1)$ covering is unique up to isomorphism. Equivalently, the Turán number $T(12,8,6)$ is $41$; the new value propagates to improved lower bounds for $C(13,7,5)$, $C(14,8,6)$, $C(15,9,7)$ and $C(16,10,8)$.
