集合并族中的超饱和现象
Supersaturation in union-closed families of sets
AI总结：
该数学研究证明了特定大小并族中k-链数量的极小化条件，明确了极小化族的唯一存在范围，为并族理论提供了关键结论。
AI中文摘要：
设k和n为正整数，满足2≤k≤n+1，我们证明了论域为[n]、大小为m的并族中，k-链的数量在其成员集尽可能大时达到最小。还表明当最小值非零且m>n时，不存在其他极小化族。
英文摘要：
Let $k$ and $n$ be positive integers such that $2 \leq k \leq n+1$. We prove that the number of $k$-chains in a union-closed family with universe $[n]$ and size $m$ is minimized when its member sets are largest possible. We also show that, whenever the minimum is nonzero and $m>n$, there are no other minimizing families.
