and are running Many Cheerful Facts this semester..

This Fall, the talks will be held in Evans 1015, Wednesdays at 1:10-2:00. If you'd like to talk, email me at brownda at-sign math.berkeley.edu or Adam at booth at-sign math.berkeley.edu.

For more info, and to see old abstracts of talks, see the MGSA site.

Fall 2005

Scott Carnahan, Moonshine for Beginners August 31, 2005
Jared Weinstein, 691, Most Irregular Prime September 7, 2005
Anton Geraschenko, Bruhat-Tits Spaces and the Exponential Map September 14, 2005
Chris Pries, Why ask for associativity when you have have the alternative: The Octonions. September 21, 2005
John Goodrick, Everything you always wanted to know about abelian torsion groups (but were afraid to ask). September 28, 2005
Tony Varilly, Dude, Where's my Title? (Dave, I can't think of a title... `First Steps in Geometric Invariant Theory might be OK') October 5, 2005
Soroosh Yazdani, When Plato Met Pythagorus October 12, 2005
Jomy Alappattu, Markov Chains, and the Graphs and Trees That Love Them October 19, 2005
AJ Tolland, Vanishing Vector Fields and Topological Invariants October 26, 2005
Noah Snyder, Many Cheerful Categories November 2, 2005
Alex Diesl, Graph Theory and Ring Theory are Friends - Zero Divisor Graphs of Rings November 9, 2005
Kenny Easwaran, Why Can't We Count the Reals?, November 16, 2005
Sevak Mkrtchyan, Generalized Flag Manifolds, November 23, 2005
Matthias Goerner, The Metropolis Transport Algorithm November 30, 2005
David Brown, Generalized Fermat Equations and Descent: A Love Story December 7, 2005

Spring 2005

A talk on axioms of the type proposed by Freiling, or What happens when set theorists play darts, by Adam Booth, January 26, 2005
Buckyballs, Glass, and Origami: A Talk for Your Fingers, by Anton Geraschenko, February 2, 2005
A Riddle Wrapped in a Mystery, by Johanna Franklin, February 9, 2005
The Inverse Problem fo Roulettes, by Ryan Hynd, February 16, 2005
Good Things Always Come in Pairs, by David Freeman, February 23, 2005
So Much For the 80's: P=NP is still hard., by Cameron Hill, March 2, 2005
What Functor Do You Represent?, by David `The Guru' Smyth, March 9, 2005
Hash is Hard, by Ed Carter, March 16, 2005
Spring Break, March 23, 2005
Sevak Mkrtchyan, March 30, 2005
The Prime Number Theorem for Graphs, by David Zywina, April 6, 2005
Von Newman's Minimax Theorem, by Joel Los, April 13, 2005
Simiplicial Sets: Better Than the Average Bear, by Joel Kamnitzer, April 20, 2005
3 implies Chaos, by Katie Lisenger, April 27, 2005
An Infinitude of Proofs, by David Brown, May 4, 2005