Artikel
Lizenziert
Nicht lizenziert
Erfordert eine Authentifizierung
Some geodesic problems in groups
-
Murray Elder
und
Andrew Rechnitzer
Veröffentlicht/Copyright:
18. Oktober 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
Sie haben derzeit keinen Zugang zu diesem Inhalt.
Sie haben derzeit keinen Zugang zu diesem Inhalt.
Artikel in diesem Heft
- 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
Artikel in diesem Heft
- 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
