8:00am 


9:00am 


10:00am 


11:00am 
[11:30am] Niranjan Balachandran
 Description:
 Title: On tricoloredsumfree sets and Green's Boolean Removal Lemma
Abstract: A tricoloredsumfree set in F_2^n is a collection of triples
{(a_i,b_i,c_i)}_{I=1..m} such that
a) for each I, a_i+b_i+c_i=0
b) If a_i+b_j+c_k = 0, then I=j=k.
The notion of a tricolouredsumfree set generalizes the notion of a
capset to F_2^n. The basic question here is: How large can a
tricoloredsumfree set be?
We will see the following two (recent) results.
i) Kleinberg's upper bound of 6\binom{n}{n/3} for a tricoloredsumfree
set. This in conjunction with a previous result of his establishing a
lower bound of \binom{n}{n/3}2^{\sqrt{16n/3}} gives almost asymptotically
tight results.
ii) Ben Green (in 2005) proved the following BOOLEAN REMOVAL LEMMA:
Given \epsilon>0 there exists \delta depending only on epsilon such
that the
following holds: Write N=2^n. If X,Y,Z are subsets of F_2^n if by deleting
\epsilon N elements from X,Y, Z altogether, one can eliminate all
arithmetic triangles (triples (x,y,z) with \in X,y\in Y,z\in Z such that
x+y+z=0) then there are at most \delta N^2 arithmetic triangles in
(X,Y,Z). Green's proof establishes a bound for1/(\delta) which is a tower
of 2s of length poly(1/\epsilon). We will look at a recent result of Fox
and Lovasz (junior) who obtained an almost tight bound for this
deltaepsilon dependence with \delta =O(\epsilon^{O(1)}).


12:00pm 

1:00pm 


2:00pm 


3:00pm 


4:00pm 


5:00pm 


6:00pm 

