Finding non-trivial elements and splittings in groups.
From MaRDI portal
(Redirected from Publication:716463)
recursion theoryfinitely presented groupsalgorithms in groupsdecision problems in groupsfinite presentations of groupspartial algorithmsrecursively unsolvable problems
Free products of groups, free products with amalgamation, Higman-Neumann-Neumann extensions, and generalizations (20E06) Generators, relations, and presentations of groups (20F05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Applications of computability and recursion theory (03D80)
Abstract: It is well known that the triviality problem for finitely presented groups is unsolvable; we ask the question of whether there exists a general procedure to produce a non-trivial element from a finite presentation of a non-trivial group. If not, then this would resolve an open problem by J. Wiegold: `Is every finitely generated perfect group the normal closure of one element?' We prove a weakened version of our question: there is no general procedure to pick a non-trivial generator from a finite presentation of a non-trivial group. We also show there is neither a general procedure to decompose a finite presentation of a non-trivial free product into two non-trivial finitely presented factors, nor one to construct an embedding from one finitely presented group into another in which it embeds. We apply our results to show that a construction by Stallings on splitting groups with more than one end can never be made algorithmic, nor can the process of splitting connect sums of non-simply connected closed 4-manifolds.
Recommendations
- Algorithmically insoluble problems about finitely presented solvable groups, Lie and associative algebras. I
- scientific article; zbMATH DE number 3875527
- A finitely presented group with almost solvable conjugacy problem.
- Deciding if an automorphism of an infinite soluble group is inner
- Recursive functions in group theory
- A Note on Recursively Presented and Co-Recursively Presented Groups
- On Embedding Groups and the Conjugacy Problem
- On the difficulty of presenting finitely presentable groups.
- Algorithmic and asymptotic properties of groups.
- scientific article; zbMATH DE number 3875526
Cites work
- scientific article; zbMATH DE number 3139761 (Why is no real title available?)
- scientific article; zbMATH DE number 3149985 (Why is no real title available?)
- scientific article; zbMATH DE number 3658019 (Why is no real title available?)
- scientific article; zbMATH DE number 3736614 (Why is no real title available?)
- scientific article; zbMATH DE number 67424 (Why is no real title available?)
- scientific article; zbMATH DE number 706263 (Why is no real title available?)
- scientific article; zbMATH DE number 2146477 (Why is no real title available?)
- scientific article; zbMATH DE number 2103273 (Why is no real title available?)
- scientific article; zbMATH DE number 848029 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- scientific article; zbMATH DE number 3390004 (Why is no real title available?)
- Irreducible Outer Automorphisms of a Free Group
- On a Problem of J.H.C. Whitehead and a Problem of Alonzo Church.
- Recursive unsolvability of a problem of Thue
- Recursive unsolvability of group theoretic problems
- The Kourovka notebook. Unsolved problems in group theory. Including archive of solved problems
- The word problem
Cited in
(5)
This page was built for publication: Finding non-trivial elements and splittings in groups.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q716463)
