Pages that link to "Item:Q2441613"

The following pages link to A linear programming approach to the Manickam-Miklós-Singhi conjecture (Q2441613):

Displaying 12 items.

• The minimum number of nonnegative edges in hypergraphs (Q405286) (← links)
• Nonnegative \(k\)-sums, fractional covers, and probability of small deviations (Q414653) (← links)
• The Manickam-Miklós-Singhi conjectures for sets and vector spaces (Q458287) (← links)
• An improved bound for the Manickam-Miklós-Singhi conjecture (Q649004) (← links)
• A note on the Manickam-Miklós-Singhi conjecture for vector spaces (Q896061) (← links)
• Miklós-Manickam-Singhi conjectures on partial geometries (Q1752549) (← links)
• Refuting conjectures in extremal combinatorics via linear programming (Q2010628) (← links)
• The adjacency matrix of a graph as a data table: a geometric perspective (Q2362877) (← links)
• A formulation of the wide partition conjecture using the atom problem in discrete tomography (Q2440106) (← links)
• Sums of seven octahedral numbers (Q2793769) (← links)
• Divisor function inequalities, entropy, and the chance of being below average (Q5372077) (← links)
• A Branch-and-Cut Strategy for the Manickam-Miklos-Singhi Conjecture (Q6239647) (← links)