Papers
Topics
Authors
Recent
Search
2000 character limit reached

A recipe for short-word pseudo-Anosovs

Published 12 Aug 2010 in math.GT | (1008.2217v1)

Abstract: Given any generating set of any pseudo-Anosov-containing subgroup of the mapping class group of a surface, we construct a pseudo-Anosov with word length bounded by a constant depending only on the surface. More generally, in any subgroup G we find an element f with the property that the minimal subsurface supporting a power of f is as large as possible for elements of G; the same constant bounds the word length of f. Along the way we find new examples of convex cocompact free subgroups of the mapping class group.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.