On a problem concerning the weight functions
Let \(X\) be a finite set with \(n\) elements. A function \(f: X\to\mathbb{R}\) such that \(\sum_{x\in X} f(x)\geq 0\) is called an \(n\)-weight function. \textit{N. Manickam} and \textit{N. M. Singhi} [J. Comb. Theory, Ser. A 46, 91-103 (1988; Zbl 0645.05023)] conjectured the following: if \(d\) is a positive integer and \(f\) is an \(n\)-weight function with \(n\geq 4d\), then there exist at least \({n-1\choose d-1}\) subsets \(Y\) of \(X\) with \(|Y|= d\), for which \(\sum_{y\in Y}f(y)\geq 0\). \textit{T. Bier} and \textit{N. Manickam} [Southeast Asian Bull. Math. 11, 61-68 (1987; Zbl 0723.05120)] showed that the conjecture is not true for all values of \(n\) and \(d\). The present paper proves the conjecture under the condition \(|\{x\in X: f(x)\geq 0\}|\leq d\leq n/2\).
- On a conjecture of Manickam and Singhi
- Parallel and sequential dynamics of two discrete models of signed integer partitions
- A method to count the positive 3-subsets in a set of real numbers with non-negative sum
- Sand piles models of signed partitions with d piles
- On some numbers related to extremal combinatorial sum problems
- The adjacency matrix of a graph as a data table: a geometric perspective
- Parallel rank of two sandpile models of signed integer partitions
- A linear programming approach to the Manickam-Miklós-Singhi conjecture
- New results related to a conjecture of Manickam and Singhi
- On Muckenhoupt´s classes of weight functions
- Solution of a problem on non-negative subset sums
- A minimum problem for finite sets of real numbers with nonnegative sum
- Real subset sums and posets with an involution
- On Hotelling's Weighing Problem
- An improved bound for the Manickam-Miklós-Singhi conjecture
- A note on the Manickam-Miklós-Singhi conjecture for vector spaces
This page was built for publication: On a problem concerning the weight functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1348764)
