A linear programming approach to the Manickam-Miklós-Singhi conjecture

DOI10.1016/j.ejc.2013.06.047zbMath1284.05325OpenAlexW2088903408WikidataQ123080381 ScholiaQ123080381MaRDI QIDQ2441613

Derrick Stolee, Stephen G. Hartke

Publication date: 25 March 2014

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

Full work available at URL: https://doi.org/10.1016/j.ejc.2013.06.047

zbMATH Keywords

computational methodbranching strategy

Mathematics Subject Classification ID

Linear programming (90C05) Permutations, words, matrices (05A05) Extremal set theory (05D05) Other combinatorial number theory (11B75) Randomized algorithms (68W20)

Related Items (6)

The adjacency matrix of a graph as a data table: a geometric perspective ⋮ The minimum number of nonnegative edges in hypergraphs ⋮ A note on the Manickam-Miklós-Singhi conjecture for vector spaces ⋮ Divisor function inequalities, entropy, and the chance of being below average ⋮ The Manickam-Miklós-Singhi conjectures for sets and vector spaces ⋮ Sums of seven octahedral numbers

Uses Software

• CPLEX
• GLPK

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nonnegative \(k\)-sums, fractional covers, and probability of small deviations
• Solution of a problem on non-negative subset sums
• An improved bound for the Manickam-Miklós-Singhi conjecture
• 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
• A class of lattices and boolean functions related to the Manickam–Miklös–Singhi conjecture

This page was built for publication: A linear programming approach to the Manickam-Miklós-Singhi conjecture