You are currently browsing the monthly archive for December 2012.

In winter and spring of 2001, Nathan Dunfield and I ran a seminar at Harvard whose purpose was to go through Thurston’s proof of the geometrization theorem for Haken manifolds. This was a very useful and productive exercise, and there was wide participation from faculty and students. As well as talks by Nathan and myself, there were talks by David Dumas, Laura de Marco, Maryam Mirzakhani, Curt McMullen, Dylan Thurston, and John Holt. At the conclusion of the semester, Bill Thurston agreed to come out and lead a discussion on geometrization, in which he ended up talking a bit about what had led him to formulate the conjecture in the first place, what ideas had played into it, how and when he had gone about proving it, his ideas about exposition, and so on.

I had recently bought a video camera, and decided to tape Bill’s talk. I never did anything with it until now (in fact, I don’t think I ever re-watched anything that I taped), but it turned out to be not too difficult to transfer the file from tape to computer. Since this seems like an interesting fragment of intellectual history, I thought it might be worthwhile to post the result to YouTube — the video link is here.

My eldest daughter Lisa recently brought home a note from her school from her computer class teacher. Apparently, the 5th grade kids have been learning to program in Logo, in the MicroWorlds programming environment. I have very pleasant memories of learning to program in Logo back when I was in middle school. If you’re not familiar with Logo, it’s a simple variant of Lisp designed by Seymour Papert, whereby the programmer directs a turtle cursor to move about the screen, moving forward some distance, turning left or right, etc. The turtle can also be directed to raise or lower a pen, and one can draw very pretty pictures in Logo as the track of the turtle’s motion.

Let’s restrict our turtle’s movements to alternating between taking a step of a fixed size S, and turning either left or right through some fixed angle A. Then a (compiled) “program” is just a finite string in the two letter alphabet L and R, indicating the direction of turning at each step. A “random turtle” is one for which the choice of L or R at each step is made randomly, say with equal probability, and choices made independently at each step. The motion of a Euclidean random turtle on a small scale is determined by its turning angle A, but on a large scale “looks like” Brownian motion. Here are two examples of Euclidean random turtles for A=45 degrees and A=60 degrees respectively.

turtle_Euclid

The purpose of this blog post is to describe the behavior of a random turtle in the hyperbolic plane, and the appearance of an interesting phase transition at \sin(A/2) = \tanh^{-1}(S). This example illustrates nicely some themes in probability and group dynamics, and lends itself easily to visualization.

Read the rest of this entry »

Follow

Get every new post delivered to your Inbox.

Join 176 other followers