Maximizing the Number of Nonnegative Subsets

From MaRDI portal
Publication:3192165




Abstract: 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 , 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 ErdH{o}s-Ko-Rado Theorem.









This page was built for publication: Maximizing the Number of Nonnegative Subsets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3192165)