ON COMPUTING GEODESICS IN BAUMSLAG–SOLITAR GROUPS

DOI10.1142/S0218196711006108zbMath1235.20041arXiv0907.5114MaRDI QIDQ2996841

Volker Diekert, Jürn Laun

Publication date: 3 May 2011

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0907.5114

zbMATH Keywords

deterministic algorithmsNP-complete problemsmetabelian groupsBaumslag-Solitar groupspolynomial time algorithmsgeodesic lengthsnormal form theoremsgeodesic problems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Solvable groups, supersolvable groups (20F16) Generators, relations, and presentations of groups (20F05) Geometric group theory (20F65) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Related Items (4)

Metric properties of Baumslag–Solitar groups ⋮ Conjugation curvature in solvable Baumslag–Solitar groups ⋮ Limits of Baumslag-Solitar groups and dimension estimates in the space of marked groups. ⋮ Growth in Baumslag–Solitar groups II: The Bass–Serre tree

Cites Work

• Some two-generator one-relator non-Hopfian groups
• On the entropy of context-free languages

This page was built for publication: ON COMPUTING GEODESICS IN BAUMSLAG–SOLITAR GROUPS