Bar-Ilan Combinatorics Seminar
The last meeting of the seminar for this academic year will take
place, IYH,
(when)  Sunday, 27 Sivan (June 17), 14:00-15:30
(where) Room 201 (Math & CS Seminar Room), Building 216, Bar-Ilan
(who)    Chaim Even-Zohar (Hebrew University)
(what)   Compression methods and sums of sets in (Z_2)^n
Denote by F(K) the maximum of |span(A)|/|A|, over all subsets A of
(Z_2)^n with |A+A|/|A| < K. Using methods of subset compression,
Green and Tao and Konyagin found F(K) = Theta(poly(K) 4^K).
Elaborating on these methods, we explicitly calculate F(K), and in
particular show that it is Theta(4^K / K). More generally, we give a
fairly tight lower bound on |A+B|, where A and B are two generating
subsets of (Z_2)^n of prescribed cardinalities.
You are all invited! Graduate students are especially welcome.
Seminar organizer: Ron Adin   <> 
Seminar's homepage:
Technion Math Net-2 (TECHMATH2)
Editor: Michael Cwikel   <> 
Announcement from: Ron Adin   <>