Previous Conferences & Workshops

Sep
27
2011

Computer Science/Discrete Mathematics Seminar II

Tight Lower Bounds for 2-query LCCs Over Finite fields
10:30am|S-101

A locally correctable code (LCC) is an error correcting code mapping d symbols to n symbols, such that for every codeword c and every received word r that is \delta-close to c, we can recover any coordinate of c (with high probability) by only...

Sep
26
2011

Members’ Seminar

First Steps in Symplectic Dynamics
4:00pm|S-101

The modern theory of dynamical systems, as well as symplectic geometry, have their origin with Poincare as one field with integrated Ideas. Since then these fields developed quite independently. Given the progress in these fields one can make a good...

Sep
26
2011

Computer Science/Discrete Mathematics Seminar I

Nonnegative k-Sums, Fractional Covers, and Probability of Small Deviations
Benny Sudakov
11:15am|S-101

More than twenty years ago, Manickam, Miklos, and Singhi conjectured that for any integers $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...