If you haven’t already, I suggest you skim through my introduction to curve complexes post before reading this one. It has a bunch of the vocabulary I’ll use. Also, here’s an **exercise**: why, exactly, is the curve complex locally infinite? I didn’t say exactly explicitly, but take a look and see if you can convince yourself of this fact.

So far we’ve seen a few properties of the curve complex that were discovered a long time ago. This object, by the way, was first described in 1978 by W.J. Harvey. [A lot of people mention this, but wikipedia has the actually citation. I guess because it’s not online.] In October, Joan Birman and William Menasco submitted a short paper with a new property of the curve complex: that it needs to take better care of its hair. I meant, that **the curve complex has dead ends**.

*geodesics*. A geodesic is a shortest route from A to B. In a plane, geodesics are just straight lines. That’s using the usual

*metric*, way to measure distance. But what if we used a different metric? For instance, in Chicago, the fastest way between places is *not* a straight line, because I can’t walk through walls and houses and trees etc. There’s often two or more geodesics between A and B, by taking the north-south grid lines first, then the east-west, or vice-versa. You could use a staircase pattern to get between, say, six corners and Humboldt park. This whole thing is an aside about the

*taxicab metric.*You could also do a giant loop and then do the usual L shaped route, but that wouldn’t be a geodesic because it’s not the shortest way to go.

**the curve complex admits infinitely many geodesics between two distinct points**. This is pretty crazy. Remember from last time that it was hard to find points that were distance three or more from each other. This says that there are infinitely many routes that go between any two points. I don’t know why this is true, but it’s probably to be found in the seminal papers of Masur and Minsky on the curve complex.

*n*. We say B is a

*dead end*with respect to A if you can’t extend that geodesic to length

*n+1*. That means that for any city C distance 1 from B, the distance between A and C is less than or equal to

*n*. Remember, ‘distance’ for us means the length of the shortest path between two points, a.k.a. the length of a geodesic.

*n*has

*depth k*

*if you have to backtrack by*

*k*cities to extend the geodesic to length

*n+1.*So if it takes you 10 steps to get from Milwaukee to Aurora, and you have to backpedal by two cities so that you can reroute to El Paso, which is 11 steps from Milwaukee, then the

*depth*of the dead end at Aurora is 2.

**every dead end of the curve complex has depth 1.**So chew on that! More math later!

Thanks for taking an interest in our work…enjoyable descriptions of the topology. WWM

This comment made my two weeks! Thank you for reading! I’m glad I didn’t get anything egregiously incorrect.