Monday, May 09, 2005

would you like lyme disease with that?

I did not avoid well enough: I found a tick on me last night. It hadn't burrowed in, it was just lounging around. It did annoy me some, though, so that whenever a hair moved on my body I thought I had another one. It took some time to stop mildly freaking out about it.

OSU Mathematics Seminars of Interest:
Wed. 3:30PM - Karl Mahlburg
"The Andrews-Garvan-Dyson crank and proofs of partition congruences"

Th. 4:30PM - Ben Green
"Arithmetic progressions of primes"

Both of these results are ground-breaking! The first one made world news for solving a 70-year old Ramanujan problem. The second one is just freaking revolutionary: there are arithmetic progressions of arbitrary length (also known as AP-rich) among the prime numbers. This supports the oldest (and most lucrative) Erdos problem that any sequence of natural numbers whose reciprocals diverge is AP-rich. This would imply Szemeredi's theorem (often referred to as the crown jewel of combinatorics) that any set of natural numbers with positive upper density is AP-rich, among many others.


0 Comments:

Post a Comment

<< Home