The Manickam-Miklós-Singhi Conjecture states that for positive integers n and k with n > (4k - 1), a multi-set X = {x_1,x_2, … ,x_n} with real entries and nonnegative sum has at least \binom{n-1}{k-1} subsets of size k with nonnegative sum.
This talk will cover the simple arguments necessary to motivate the conjecture, an overview of recent progress towards proving the conjecture, and a sketch of the proof by Chowdhury, Sarkis, and Shahriari from 2014 that shows the conjecture holds for the quadratic bound, n > (8k^2 – 1).