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

关于Kleitman一个结果的推广

On a generalization of a result of Kleitman

Ryan R. Martin, Balázs Patkós

AI总结:

本文推广Kleitman关于不交子集族的极值结果,研究不含s组每组t个集合的并两两不交的子集族最大规模vex(n,K_{s×t}),确定了不同模条件和t取值下2ⁿ减该值的渐近性质。

摘要:

Kleitman的经典结果确定了当n≡0,-1 (mod s)时,不含s个两两不交的不同集合F₁,F₂,…,Fₛ的子集族ℱ⊆2^([n])的最大规模f(n,s)。Katona和Nagy确定了n元集合的子集族中,不存在满足∪ᵢ₌₁ᵗAᵢ与∪ᵢ₌₁ᵗBᵢ不交的集合A₁,…,Aₜ,B₁,…,Bₜ时的最大规模。本文研究求不含满足Gⱼ=∪ᵢ₌₁ᵗFᵢʲ(j=1,2,…,s)两两不交的集合F¹₁,…,F¹ₜ,…,Fˢ₁,…,Fˢₜ的子集族ℱ⊆2^([n])的最大规模vex(n,K_{s×t})的问题。我们确定了当n≡-1 (mod s)且t任意时,2ⁿ - vex(n,K_{s×t})的渐近式;并证明当n≡0 (mod s)且t≥3时,该渐近式与t=2子情形的渐近式不同,而t=2子情形又与t=1和t≥3子情形均不同。

英文摘要:

A classical result of Kleitman determines the maximum number $f(n,s)$ of subsets in a family $\mathcal{F}\subseteq 2^{[n]}$ of sets that do not contain distinct sets $F_1,F_2,\dots,F_s$ that are pairwise disjoint in the case $n\equiv 0,-1$ (mod $s$). Katona and Nagy determined the maximum size of a family of subsets of an $n$-element set that does not contain $A_1,A_2,\dots,A_t,B_1,B_2,\dots,B_t$ with $\bigcup_{i=1}^t A_i$ and $\bigcup_{i=1}^t B_i$ being disjoint. In this paper, we consider the problem of finding the maximum number $vex(n,K_{s\times t})$ in a family $\mathcal{F}\subseteq 2^{[n]}$ without sets $F^1_1,\dots,F^1_t,\dots,F^s_1,\dots,F^s_t$ such that $G_j=\bigcup_{i=1}^tF^j_i$ $j=1,2,\dots,s$ are pairwise disjoint. We determine the asymptotics of $2^n-vex(n,K_{s\times t})$ if $n\equiv -1$ (mod $s$) for all $t$, and if $n\equiv 0$ (mod $s$), $t\ge 3$ and show that in this latter case the asymptotics of the $t=2$ subcase is different from both the $t=1$ and $t\ge 3$ subcases.

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

↑