I am posting the last two talks in my Clay-Mahler lecture series here:
- “Structure and randomness in the prime numbers“. This public lecture is slightly updated from a previous talk of the same name given last year, but is largely the same material.
- “Perelman’s proof of the Poincaré conjecture“. Here I try (perhaps ambitiously) to give an overview of Perelman’s proof of the Poincaré conjecture into an hour-length talk for a general mathematical audience. It is a little unpolished, as I have not given any version of this talk before, but I hope to update it a bit in the future.
[Update, Sep 14: Poincaré conjecture slides revised.]
[Update, Sep 18: Prime slides revised also.]
What's new 
8 comments
Comments feed for this article
7 September, 2009 at 12:01 am
Manjil P. Saikia
Great lectures, I enjoyed the prime one, you could have added a few more facts and theorems. :)
7 September, 2009 at 5:05 am
Anthony Prod'homme
Lecture about Perelman results is very good but rather challenging in 1 hour time.
Just a typo on slide 22 in one of the names: Bessières should be read instead of Bessires. (è is Alt+0232) [Corrected, thanks – T.]
Best Regards
Anthony
7 September, 2009 at 10:50 am
Kristal Cantwell
Isn’t the security of prime number encryption put into jeopardy by quantum computers? As I understand it there are polynomial algorithms
for factoring and discrete logs.
One has been recently demonstrated see:
http://www.sciencemag.org/cgi/content/abstract/sci;325/5945/1221
here is the abstract from that page:
Shor’s quantum factoring algorithm finds the prime factors of a large number exponentially faster than any other known method, a task that lies at the heart of modern information security, particularly on the Internet. This algorithm requires a quantum computer, a device that harnesses the massive parellism afforded by quantum superposition and entanglement of quantum bits (or qubits). We report the demonstration of a compiled version of Shor’s algorithm on an integrated waveguide silica-on-silicon chip that guides four single-photon qubits through the computation to factor 15.
7 September, 2009 at 11:27 am
Anonymous
You might want to change the line
“It turns out to similarly represent Ricci flow…” on Page 34 of the Perelman lecture. Do you mean that a similar gradient flow interpretation is possible, but for a different “energy”? [Yes, thanks – T.]
8 September, 2009 at 6:43 am
joe_grateful
Terry, these slides and the others are great!
I’m sure all your lectures (I’ve seen you’ll repeat them several times) will really bear fruits in terms of youngsters and the public being positively impressed by math as is done by experts.
Actually is the public mostly students and adults, or perhaps have some high school students been attending with a teacher, so far?
10 September, 2009 at 5:14 pm
Graham Norton
Dear Professor Tao,
Many use the term ‘random’ without ever defining it. Is there a formal i.e. rigourous definition of randomness? For a finite population, one can always say that the population is uniformly distributed, but how does one define randomness when the population is infinite?
Yours sincerely,
Still a student.
PS Enjoyed your recent Clay-Mahler lectures.
12 September, 2009 at 10:42 am
Robert Winslow
Professor Tao,
I apologize if this set theory question is not germane to your current pursuits, but I would appreciate your quick thoughts on the following question.
Does the Axiom of Extensionality imply that if we set A =
and B = 
, then {A, B} = {A} = {B}? The reason I ask is that I am writing an exposition on the axioms of set theory for non-mathemeticians, and it seems to me that in order to create a second set in our mathematical universe (after the Axiom of Existence gives us the empty set), we must use the Axiom of Power Set to get us set number two (namely, 
).
If so, then it seems to me that the Axiom of Pair cannot get us from a universe with just the empty set, to one with two sets in it, because A.Pair requires two sets as “input”.
Again, my question may be ill-posed, but I’m trying to wrap my head around this issue. Perhaps another way to phrase my question is, are variable names “pointers” to sets, or are they new “instantiations” of sets (to abuse the terms of object-oriented programming)?
Thanks!
21 December, 2011 at 7:05 pm
Nguyễn Duy Khánh
Dear professor Tao,
Last year, I remembered I did donwloaded two lectures above in mp4 format. But now, I forgot the link and I could not find them.
Could you please tell me somewhere that the videos are avaiable?
Thank you very much professor.