05/03/2011 - 12:15pm

05/03/2011 - 1:10pm

Speaker:

Hao Huang (UCLA)

Abstract:

More than twenty years ago, Manickam, Miklos, and Singhi conjectured that for any integers $n, k$ satisfying $n \geq 4k$, every set of $n$ real numbers with nonnegative sum has at least $\binom{n-1}{k-1}$ $k$-element subsets whose sum is also nonnegative. In this talk we discuss the connection of this problem with matchings and fractional covers of hypergraphs, and with the question of estimating the probability that the sum of nonnegative independent random variables exceeds its expectation by a given amount. Using these connections together with some probabilistic techniques, we verify the conjecture for $n \geq 33k^2$. This substantially improves the best previously known exponential lower bound $n \geq e^{ck \log\log k}$. If time permits, we will also discuss its applications in distributed storage. This is joint work with Noga Alon and Benny Sudakov.

Where:

Millikan 208 (Pomona College)

__Claremont Graduate University__ | __Claremont McKenna__ | __Harvey Mudd__ | __Pitzer__ | __Pomona__ | __Scripps__

Proudly Serving Math Community at the Claremont Colleges Since 2007

Copyright © 2018 Claremont Center for the Mathematical Sciences