Deciding if an automorphism of an infinite soluble group is inner
DOI10.1017/S0017089500009344zbMATH Open0711.20021MaRDI QIDQ3496403FDOQ3496403
Publication date: 1990
Published in: Glasgow Mathematical Journal (Search for Journal in Brave)
Recommendations
- Decidable Properties of Polycyclic Groups
- Decision problems for soluble groups of finite rank
- Algorithmically insoluble problems about finitely presented solvable groups, Lie and associative algebras. II
- scientific article; zbMATH DE number 3884377
- Algorithmically insoluble problems about finitely presented solvable groups, Lie and associative algebras. I
relationsalgorithmswordsendomorphismautomorphismgeneratorsfinitely generated metabelian groupsouter automorphism groupalgorithmic problemssoluble word problemrecursively undecidablefinitely generated recursive presentationnilpotent-by-polycyclic-by-finite groupsoluble-by-finite group of finite Prüfer rank
Symbolic computation and algebraic computation (68W30) Automorphisms of infinite groups (20E36) Generators, relations, and presentations of groups (20F05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Solvable groups, supersolvable groups (20F16) Software, source code, etc. for problems pertaining to group theory (20-04)
Cites Work
- Constructable solvable groups
- Algorithmically insoluble problems about finitely presented solvable groups, Lie and associative algebras. I
- Computable algebra and group embeddings
- Some recognizable properties of solvable groups
- Infinitely generated subgroups of finitely presented groups. I
- A Finitely Presented Group Whose Group of Automorphisms is Infinitely Generated
- The Word Problem for Finitely Generated Soluble Groups of Finite Rank
Cited In (2)
This page was built for publication: Deciding if an automorphism of an infinite soluble group is inner
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3496403)
