Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

A combinatorial algorithm to compute presentations of mapping class groups of orientable surfaces with one boundary component

A combinatorial algorithm to compute presentations of mapping class groups of orientable surfaces... Abstract We give an algorithm which computes a presentation for a subgroup, denoted 𝒜ℳ g , p , 1 ${\mathcal {AM}_{g,p,1}}$ , of the automorphism group of a free group. It is known that 𝒜ℳ g , p , 1 ${\mathcal {AM}_{g,p,1}}$ is isomorphic to the mapping class group of an orientable genus- g surface with p punctures and one boundary component. We define a variation of the Auter space. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Groups Complexity Cryptology de Gruyter

A combinatorial algorithm to compute presentations of mapping class groups of orientable surfaces with one boundary component

Groups Complexity Cryptology , Volume 7 (2) – Nov 1, 2015

Loading next page...
 
/lp/de-gruyter/a-combinatorial-algorithm-to-compute-presentations-of-mapping-class-su0Ig4Wrg0
Publisher
de Gruyter
Copyright
Copyright © 2015 by the
ISSN
1867-1144
eISSN
1869-6104
DOI
10.1515/gcc-2015-0011
Publisher site
See Article on Publisher Site

Abstract

Abstract We give an algorithm which computes a presentation for a subgroup, denoted 𝒜ℳ g , p , 1 ${\mathcal {AM}_{g,p,1}}$ , of the automorphism group of a free group. It is known that 𝒜ℳ g , p , 1 ${\mathcal {AM}_{g,p,1}}$ is isomorphic to the mapping class group of an orientable genus- g surface with p punctures and one boundary component. We define a variation of the Auter space.

Journal

Groups Complexity Cryptologyde Gruyter

Published: Nov 1, 2015

There are no references for this article.