Polynomial-time algorithms for the curve graph

Polynomial-time algorithms for the curve graph

Mark C. Bell111Department of Mathematics, University of Illinois: mcbell@illinois.edu    Richard C. H. Webb222DPMMS, Centre for Mathematical Sciences, University of Cambridge: rchw2@cam.ac.uk

We describe a polynomial-time algorithm to compute a (tight) geodesic between two curves in the curve graph. As well as enabling us to compute the distance between a pair of curves, this has several applications to mapping classes. For example, we can use these geodesics to compute:

  • the asymptotic translation length,

  • the Nielsen–Thurston type, and

  • the canonical curve system

of a mapping class in polynomial time in its word length.


curve graph, geodesics, polynomial-time, mapping class group, asymptotic translation length, Nielsen–Thurston classification, canonical curve system.

Comments 0
Request Comment
You are adding the first comment!
How to quickly get a good reply:
  • Give credit where it’s due by listing out the positive aspects of a paper before getting into which changes should be made.
  • Be specific in your critique, and provide supporting evidence with appropriate references to substantiate general statements.
  • Your comment should inspire ideas to flow and help the author improves the paper.

The better we are at sharing our knowledge with each other, the faster we move forward.
The feedback must be of minimum 40 characters and the title a minimum of 5 characters
Add comment
Loading ...
This is a comment super asjknd jkasnjk adsnkj
The feedback must be of minumum 40 characters
The feedback must be of minumum 40 characters

You are asking your first question!
How to quickly get a good answer:
  • Keep your question short and to the point
  • Check for grammar or spelling errors.
  • Phrase it like a question
Test description