Abstract
We give an algorithm which computes a presentation for a subgroup, denoted
Funding source: MIC
Award Identifier / Grant number: MTM2008-01550
The author is grateful to Warren Dicks for introducing him to algebraic mapping class groups and to Luis Paris for his advices during a post-doc in Dijon. The article has been benefited by the anonymous referee's remarks.
Received: 2015-2-1
Published Online: 2015-9-26
Published in Print: 2015-11-1
© 2015 by De Gruyter
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- Frontmatter
- A combinatorial algorithm to compute presentations of mapping class groups of orientable surfaces with one boundary component
- Non-abelian analogs of lattice rounding
- Tree-based language complexity of Thompson's group F
- New probabilistic public-key encryption based on the RSA cryptosystem
- Algorithmic recognition of quasipositive 4-braids of algebraic length three
- Cryptanalysis of a system using matrices over group rings
- On transitive differentiable modulo pn functions
- On the generic complexity of the searching graph isomorphism problem
- Key agreement under tropical parallels
Keywords for this article
Mapping class groups;
presentations;
automorphism groups;
Auter space
Articles in the same Issue
- Frontmatter
- A combinatorial algorithm to compute presentations of mapping class groups of orientable surfaces with one boundary component
- Non-abelian analogs of lattice rounding
- Tree-based language complexity of Thompson's group F
- New probabilistic public-key encryption based on the RSA cryptosystem
- Algorithmic recognition of quasipositive 4-braids of algebraic length three
- Cryptanalysis of a system using matrices over group rings
- On transitive differentiable modulo pn functions
- On the generic complexity of the searching graph isomorphism problem
- Key agreement under tropical parallels