An improved bound for the Manickam-Miklós-Singhi conjecture

DOI10.1016/J.EJC.2011.07.006zbMATH Open1308.11030arXiv1011.2803OpenAlexW2091730879WikidataQ123094344 ScholiaQ123094344MaRDI QIDQ649004FDOQ649004

Authors: Mykhaylo Tyomkyn 

Publication date: 29 November 2011

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Abstract: We show that for $n>k(4elogk{)}^k$ every set $x_1,\mathrm{...},x_n$ of $n$ real numbers with $su{m}_{i=0}^n{x}_{i}geq0$ has at least $$ $k$-element subsets of a non-negative sum. This is a substantial improvement on the best previously known bound of $n>(k-1)(k^k+k^2)+k$, proved by Manickam and Mikl'os cite{MM} in 1987.

Full work available at URL: https://arxiv.org/abs/1011.2803

Recommendations

• A linear bound on the Manickam-Miklós-Singhi conjecture
• A note on the Manickam-Miklós-Singhi conjecture
• On a conjecture of Manickam and Singhi
• New results related to a conjecture of Manickam and Singhi
• An improved bound in Vizing's conjecture
• A linear programming approach to the Manickam-Miklós-Singhi conjecture
• The Manickam-Miklós-Singhi conjectures for sets and vector spaces
• An improved lower bound related to the Furstenberg-Sárközy theorem
• An improved upper bound for the Erdős-Szekeres conjecture
• Improved bounds on a generalization of Tuza's conjecture

zbMATH Keywords

\(k\)-subsetsnon-negative sums

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Other combinatorial number theory (11B75)

Cites Work

• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Title not available (Why is that?)
• First distribution invariants and EKR theorems
• Title not available (Why is that?)
• A method to count the positive 3-subsets in a set of real numbers with non-negative sum
• Title not available (Why is that?)
• On a conjecture of Manickam and Singhi
• The first distribution invariant of the Johnson-scheme
• On a problem concerning the weight functions
• New results related to a conjecture of Manickam and Singhi

Cited In (17)

• Positive sum systems
• The minimum number of nonnegative edges in hypergraphs
• The adjacency matrix of a graph as a data table: a geometric perspective
• On the number of nonnegative sums
• Solution of a problem on non-negative subset sums
• A linear bound on the Manickam-Miklós-Singhi conjecture
• The Manickam-Miklós-Singhi conjectures for sets and vector spaces
• A linear programming approach to the Manickam-Miklós-Singhi conjecture
• A note on the Manickam-Miklós-Singhi conjecture
• On the number of nonnegative sums for semi-partitions
• On a conjecture of Manickam and Singhi
• A generalization of Alon-Aydinian-Huang theorem
• A class of lattices and Boolean functions related to the Manickam-Miklös-Singhi conjecture
• On the number of nonnegative sums for certain function
• New results related to a conjecture of Manickam and Singhi
• A remark on the problem of nonnegative \(k\)-subset sums
• Nonnegative \(k\)-sums, fractional covers, and probability of small deviations

This page was built for publication: An improved bound for the Manickam-Miklós-Singhi conjecture

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