3
$\begingroup$

$\DeclareMathOperator{\MCG}{\operatorname{MCG}}$Consider a bordered, punctured, orientable surface $S$. Associated to it there is its mapping class group $\MCG(S)$. One way to concretely think about it is in terms of generators and relations, which can be done in many ways. Typically one chooses a set of closed simple curves on $S$, defines associated Dehn twists and half-twists and then gives set of relations among them in terms of how curves intersect on $S$.

Recently I discovered that there is a very different presentation of the mapping class group in terms of its actions on (isotopy classes of) triangulations on the surface, see for example Penner's book on decorated Teichmuller theory. Essentially, the idea is that a MCG element takes a triangulation to another one with the same combinatorics. Since triangulations are acted transitively by a set of moves (flips, quasi-flips and further generalization used in the context of cluster algebras), each mapping class group element is corresponds to a sequence of flips which connects two combinatorially equivalent triangulations. Furthermore, if one adds 2-dimensional faces corresponding to the so-called pentagon identities, the complex whose vertices are (isotopy classes of) triangulations and whose edges are flips one gets a simply connected 2-dim CW-complex.

By choosing any vertex in this complex, one can then think of the mapping class group as the set of paths that join this vertex to any other vertex labelled by a combinatorially equivalent triangulation, modulo the contractible paths (which are a combination of the pentagon identities).

My question is, is there an explicit/algorithmic way to produce a sequence-of-flips representative for a given Dehn twist?

$\endgroup$
7
  • 1
    $\begingroup$ You might be interested in Mark C Bell's amazing programs Flipper and Curver which encode mapping classes in precisely this way and use them to do computations. From the existence of these programs I think the answer to your question must be yes, and since they're open source you should be able to reverse engineer to figure out the algorithm you want: markcbell.github.io/build/html/software.html $\endgroup$ – Jonny Evans Nov 6 '20 at 21:50
  • 1
    $\begingroup$ (and having spent some time reading the source code myself, I can testify that it is extremely readable: I learned a lot just browsing the source code) $\endgroup$ – Jonny Evans Nov 6 '20 at 21:53
  • 1
    $\begingroup$ oh yeah I know that amazing code! That's a good point thanks $\endgroup$ – giulio bullsaver Nov 6 '20 at 21:56
  • $\begingroup$ You'd have to double-check me, but I think maybe this is the answer: you draw the curve you want to do the Dehn twist around, and follow the arc (choose a parameterization of that curve). Perform the flips at each diagonal of the triangulation as you cross them in order. $\endgroup$ – Nick Nov 15 '20 at 1:54
  • 1
    $\begingroup$ You might be interested in my User's Guide to the Mapping Class Group, where certain such Dehn twist's, represented as sequences of flips (aka "elementary moves") are used in producing an automatic structure on $MCG(S)$. $\endgroup$ – Lee Mosher Nov 18 '20 at 2:32
2
$\begingroup$

Yes there is an entirely constructive process to produce a sequence of flips (and a relabelling) from a labelled triangulation $\mathcal{T}$ to its image $D_\gamma(\mathcal{T})$ under a Dehn twist about a curve $\gamma$. You will need to specify $\gamma$ combinatorially, for example, by specifying the number of time it intersects each edge of $\mathcal{T}$. This is implemented within curver in the encode_twist method of a (multi)curve.

The trick is to first consider the case in which $\gamma$ appears very simply on $\mathcal{T}$. For example, orienting $\gamma$ and following along it you see that it enters each triangle and turns either left or right to exit. Assume that it only performs a single left turn (in which case we say that $\mathcal{T}$ is a short triangulation for $\gamma$). In this case it is easy to produce a sequence of flips: flip the edge in between $\gamma$ turning left and turning right (to get a new short triangulation), identify the new edge where $\gamma$ goes from turning left to turning right and flip that, and repeat this process (approximately) $\iota(\gamma, \mathcal{T})$ times. This forms the base case that curver implements, but it also has some more advanced patterns to allow it to compute powers of twists in log space.

If $\gamma$ does not appear simply on $\mathcal{T}$ then we can use a shortening process to find a short triangulation for $\gamma$. It turns out that there is a always a flip which reduces $\iota(\gamma, \mathcal{T})$. Again curver implements this process, again with some more advanced tricks to allow it to take advantage of accelerating twists. So by repeatedly applying using this you can produce a "conjugating" path to get to a base case triangulation, apply the base case implementation and then follow the "conjugating" path back. This is actually what is being done here.

$\endgroup$
1
  • $\begingroup$ Amazing! Thanks! $\endgroup$ – giulio bullsaver Dec 10 '20 at 8:08

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.