Previous Conferences & Workshops

Oct
09
2007

Arithmetic Combinatorics

On Square Sum-Free Sets
2:00pm|S-101

Let A be subset of {1,...,n}. We say that A is square sum-free if the sum of any two different elements of A is not a square. Erdos and Sarkozy asked whether a square sum-free set can have more than n(1/3+epsilon) elements (motivated by the sequence...

Oct
08
2007

Computer Science/Discrete Mathematics Seminar I

Erdos-Renyi Phase Transition
11:15am|S-101

In their great 1960 paper "On the Evolution of Random Graphs" Paul Erdos and Alfred Renyi expresses a special interest in the behavior of the random graph G(n,p) when np was near one. Today we view it through the prism of Percolation Theory. Write c...