Skip Navigation


Journal of the London Mathematical Society Advance Access originally published online on November 19, 2007
Journal of the London Mathematical Society 2008 77(1):33-50; doi:10.1112/jlms/jdm090
This Article
Right arrow FREE Full Text (PDF) Freely available
Right arrow All Versions of this Article:
77/1/33    most recent
jdm090v1
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Bell, G. C.
Right arrow Articles by Fujiwara, K.
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© 2007 London Mathematical Society

The asymptotic dimension of a curve graph is finite

Gregory C. Bell

Department of Mathematics and Statistics
UNC Greensboro
Greensboro, NC 27455
USA

Koji Fujiwara

Mathematical Institute
Tohoku University
Sendai 980-8578
Japan
fujiwara{at}math.tohoku.ac.jp

We find an upper bound for the asymptotic dimension of a hyperbolic metric space with a set of geodesics satisfying a certain boundedness condition studied by Bowditch. The primary example is a collection of tight geodesics on the curve graph of a compact orientable surface. We use this to conclude that a curve graph has a finite asymptotic dimension. It follows then that a curve graph has property A1. We also compute the asymptotic dimension of mapping class groups of orientable surfaces with genus at most 2.


Dedicated to Professor Yukio Matsumoto on his 60th birthday

2000 Mathematics Subject Classification 57M99 (primary), 20F69 (secondary).

Received September 30, 2005; revised January 30, 2007; published online November 19, 2007.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.