A question of Higman
coenumerablefinitely generated groupgroup of recursive permutationsnonrecursive permutationword problem
Computable structure theory, computable model theory (03C57) Recursive functions and relations, subrecursive hierarchies (03D20) Word problems, etc. in computability and recursion theory (03D40) Theory of numerations, effectively presented structures (03D45) General theory for infinite permutation groups (20B07) Infinite automorphism groups (20B27) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)
If a finitely generated group \(G\) is embeddable into \(\hbox{Aut}_ r(\omega)\), the group of recursive permutations of \(\omega\), then the word problem for \(G\) is obviously coenumerable. G. Higman asked whether the converse was true. The author answers the question in the negative. He shows that the group \(G_ g\) generated by any nonrecursive permutation \(g\) of \(\omega\) and the permutations \((01), (01)(23)\dots\) and \((12)(34)\dots\) can not be embedded into \(\hbox{Aut}_ r(\omega)\) and constructs a nonrecursive \(g\) such that the word problem for \(G_ g\) is coenumerable.
- scientific article; zbMATH DE number 1534357
- scientific article; zbMATH DE number 166021
- scientific article; zbMATH DE number 1038640
- A question of Kühnau
- A question of Kaplansky
- scientific article; zbMATH DE number 3853969
- On a Question of Quillen
- On a question of Quillen
- On a question of Roitman
- A question of L. A. Shemetkov
This page was built for publication: A question of Higman
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1814620)
