Skip Navigation


Bulletin of the London Mathematical Society Advance Access originally published online on February 6, 2009
Bulletin of the London Mathematical Society 2009 41(2):205-212; doi:10.1112/blms/bdn118
This Article
Right arrow Full Text (PDF)
Right arrow All Versions of this Article:
41/2/205    most recent
bdn118v1
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 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 Clay, M.
Right arrow Articles by Forester, M.
Right arrow Search for Related Content
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© 2009 London Mathematical Society

Whitehead moves for G-trees

Matt Clay and Max Forester

Department of Mathematics
University of Oklahoma
Norman, OK 73019
USA
forester@math.ou.edu

Received 18 September 2007. Revision received 7 October 2008.

We generalize the familiar notion of a Whitehead move from Culler and Vogtmann's Outer space to the setting of deformation spaces of G-trees. Specifically, we show that there are two moves, each of which transforms a reduced G-tree into another reduced G-tree, that suffice to relate any two reduced trees in the same deformation space. These two moves further factor into three moves between reduced trees that have simple descriptions in terms of graphs of groups. This result has several applications.


2000 Mathematics Subject Classification 20E08 (primary), 20E06, 20F65 (secondary).

The second author is partially supported by NSF grant no. DMS-0605137.


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.