Hostname: page-component-74656f9884-2dmjx Total loading time: 0 Render date: 2026-11-10T04:53:00.717Z Has data issue: false hasContentIssue false

The order problem and the power problem for free product sixth-groups

Published online by Cambridge University Press:  18 May 2009

James McCool
Affiliation:
University of Toronto, Toronto, Canada
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Let G be a group given in terms of generators and denning relations. The order problem is said to be solvable for (the given presentation of) the group G if, given any element W of G (as a word in the given generators of G), we can determine the order of W in G. The power problem is solvable for G if, given any pair X, Y of elements of G, we can determine whether or not X belongs to the cyclic subgroup {Y} of G generated by Y. It is easy to see that if either of these problems is solvable for G, then the word problem is also solvable for G.

Information

Type
Research Article
Copyright
Copyright © Glasgow Mathematical Journal Trust 1969