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

DOI10.1016/J.EJC.2011.07.006zbMath1308.11030arXiv1011.2803OpenAlexW2091730879WikidataQ123094344 ScholiaQ123094344MaRDI QIDQ649004

Mykhaylo Tyomkyn

Publication date: 29 November 2011

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

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

zbMATH Keywords

\(k\)-subsetsnon-negative sums

Mathematics Subject Classification ID

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

Related Items (10)

The adjacency matrix of a graph as a data table: a geometric perspective ⋮ The minimum number of nonnegative edges in hypergraphs ⋮ Nonnegative \(k\)-sums, fractional covers, and probability of small deviations ⋮ A remark on the problem of nonnegative \(k\)-subset sums ⋮ Solution of a problem on non-negative subset sums ⋮ A linear programming approach to the Manickam-Miklós-Singhi conjecture ⋮ The Manickam-Miklós-Singhi conjectures for sets and vector spaces ⋮ On the number of nonnegative sums for certain function ⋮ On the number of nonnegative sums for semi-partitions ⋮ A linear bound on the Manickam-Miklós-Singhi conjecture

Cites Work

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

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