The non-peripheral curve graph and divergence in big mapping class groups

Abstract

We introduce a numerical invariant ζ() measuring the end-complexity of and use it to organize coarse-geometric features of Map(). Our main tool is the non-peripheral curve graph C np(), whose vertices are those essential simple closed curves that cannot be pushed out of every compact subsurface, with edges given by disjointness. Assuming Map() is CB-generated and ζ() 5, we prove that C np() is connected, has infinite diameter, is Gromov hyperbolic, and that the Map()-action has unbounded orbits. As applications, we show that if ζ() 4 then Map() has infinite coarse rank, and if ζ() 5 then Map() has at most quadratic divergence, hence is one-ended.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…