Article
Licensed
Unlicensed
Requires Authentication
Some geodesic problems in groups
-
Murray Elder
and
Andrew Rechnitzer
Published/Copyright:
October 18, 2010
Abstract
We consider several algorithmic problems concerning geodesics in finitely generated groups. We show that the three geodesic problems considered by Miasnikov et al. are polynomial-time reducible to each other. We study two new geodesic problems which arise in a previous paper of the authors and Fusy.
Keywords.: Word problem; geodesic problems
Received: 2010-06-11
Published Online: 2010-10-18
Published in Print: 2010-December
© de Gruyter 2010
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- On asymptotic densities and generic properties in finitely generated groups
- On finite Thurston-type orderings of braid groups
- Subgroup conjugacy problem for Garside subgroups of Garside groups
- The Latin squares and the secret sharing schemes
- A note on the homology of hyperbolic groups
- Cutting up graphs revisited – a short proof of Stallings' structure theorem
- Some geodesic problems in groups
- Search and witness problems in group theory
- Algebraic attacks using SAT-solvers
Articles in the same Issue
- On asymptotic densities and generic properties in finitely generated groups
- On finite Thurston-type orderings of braid groups
- Subgroup conjugacy problem for Garside subgroups of Garside groups
- The Latin squares and the secret sharing schemes
- A note on the homology of hyperbolic groups
- Cutting up graphs revisited – a short proof of Stallings' structure theorem
- Some geodesic problems in groups
- Search and witness problems in group theory
- Algebraic attacks using SAT-solvers
