arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1312.0248math.CO
收藏

最大化非负子集的数量

Maximizing the number of nonnegative subsets

Noga Alon, Harout Aydinian, Hao Huang

摘要:

给定一组$n$实数,如果每个大于$k$的子集的元素之和为负,那么非负和的子集的最大数目是多少?在本说明中,我们表明,答案是$\binom{n-1}{k-1} + \binom{n-1}{k-2} + \cdots + \binom{n-1}{0}+1$,解决问题的Tsukerman。我们提供了两个证明,第一个建立和应用霍尔定理的加权版本,第二个是基于扩展的非均匀Erdens-Ko-Rado定理。

英文摘要:

Given a set of $n$ real numbers, if the sum of elements of every subset of size larger than $k$ is negative, what is the maximum number of subsets of nonnegative sum? In this note we show that the answer is $\binom{n-1}{k-1} + \binom{n-1}{k-2} + \cdots + \binom{n-1}{0}+1$, settling a problem of Tsukerman. We provide two proofs, the first establishes and applies a weighted version of Hall's Theorem and the second is based on an extension of the nonuniform Erdős-Ko-Rado Theorem.

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

↑