Homological decision problems for finitely generated groups with solvable word problem

W. A. Bogley, J. Harlander

Research output: Contribution to journalArticlepeer-review

2 Scopus citations

Abstract

We show that for finitely generated groups P with solvable word problem, there is no algorithm to determine whether H1(P) is trivial, nor whether H2(P) is trivial.

Original languageEnglish
Pages (from-to)213-221
Number of pages9
JournalInternational Journal of Algebra and Computation
Volume12
Issue number1-2
DOIs
StatePublished - 2002

Keywords

  • Homology of groups
  • Word problem

Fingerprint

Dive into the research topics of 'Homological decision problems for finitely generated groups with solvable word problem'. Together they form a unique fingerprint.

Cite this