4 research outputs found
Maximizing the number of nonnegative subsets
Given a set of real numbers, if the sum of elements of every subset of
size larger than 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
Erd\H{o}s-Ko-Rado Theorem
Extremal Problems for Subset Divisors
Let be a set of positive integers. We say that a subset of is
a divisor of , if the sum of the elements in divides the sum of the
elements in . We are interested in the following extremal problem. For each
, what is the maximum number of divisors a set of positive integers can
have? We determine this function exactly for all values of . Moreover, for
each we characterize all sets that achieve the maximum. We also prove
results for the -subset analogue of our problem. For this variant, we
determine the function exactly in the special case that . We also
characterize all sets that achieve this bound when .Comment: 10 pages, 0 figures. This is essentially the journal version of the
paper, which appeared in the Electronic Journal of Combinatoric