Skip Navigation


Bulletin of the London Mathematical Society Advance Access originally published online on March 31, 2008
Bulletin of the London Mathematical Society 2008 40(2):249-262; doi:10.1112/blms/bdn005
This Article
Right arrow Full Text (PDF)
Right arrow All Versions of this Article:
40/2/249    most recent
bdn005v1
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 Cohen, D. C.
Right arrow Articles by Pruidze, G.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© 2008 London Mathematical Society

Motion planning in tori

Daniel C. Cohen and Goderdzi Pruidze

Department of Mathematics Louisiana State University
Baton Rouge, LA 70808
USA
gio@math.lsu.edu
http://www.math.lsu.edu/~cohen
http://www.math.lsu.edu/~gio

Received 26 March 2007. Revision received 24 October 2007.

Let X be a subcomplex of the standard CW-decomposition of the n-dimensional torus. We exhibit an explicit optimal motion planning algorithm for X. This construction is used to calculate the topological complexity of complements of general position arrangements and Eilenberg–Mac Lane spaces associated to right-angled Artin groups.

The first author was partially supported by National Security Agency grant H98230 [GenBank] -05-1-0055.

2000 Mathematics Subject Classification 20F36, 52C35, 55M30.


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.