Subspaces in sumsets: a problem of Bourgain and Green
|
Tue, 01/06/2010 14:30 |
Tom Sanders (Cambridge) |
Combinatorial Theory Seminar |
L3 |
Suppose that has density . How
large a subspace is guaranteed to contain? We
discuss this problem and how the the result changes as the density
approaches . |
|||

has density
. How
large a subspace is
guaranteed to contain? We
discuss this problem and how the the result changes as the density
approaches
.