REACH Minutes for 4/11/02, by David Speyer

The first half of REACH mostly consisited of independent discussion in the
computer room. Jim also demonstrated the random tiling algorithms, using
coupling for the past. It was discovered that the Jave code runs much
faster in Internet Explorer than Netscape. There was also evidence that, 
at least in the square tiling algorithm, the code is buggy. If anyone 
would like to dig into the Java, that would be great.

We looked at some T-shirt designs from the past. The discussion will be
continued by e-mail.

On Tuesday, there will be a math table to recruit for REACH; try to show
up. Moreover, try to think of people we particularly want to recruit.
People who have been mentioned include Richard Chudney, Kirsten Wickelgren
and Sasha Schwartz. REACH will probably be based out of Havrard next year, 
even though Propp won't be.

On Wed. there will be a talk at MIT on Grassmanians and Cluster algebras.
I'll email out a rapid guide to Grassmanians later tonight.

On May 1, Propp will be speaking at Brandeis to recruit for REACH. Let him
know if you'd be interested in joining him.

Gabriel has been working out a "numerical Kuo condensation", where two
grids of numbers obeying certain inequalities are overlayed and summed.

David has been playing some with height functions and their relation to
face exponents for crosses-and-wrenches graphs.