Abstract
In 1961 Graham Higman [1] proved that a finitely generated group is a subgroup of a finitely presented group if, and only if, it is recursively presented. Therefore a finitely generated metabelian group can be embedded in a finitely presented group.
Publisher
Cambridge University Press (CUP)
Cited by
40 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Semigroup Algorithmic Problems in Metabelian Groups;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10
2. Finitely presented condensed groups;Proceedings of the American Mathematical Society;2024-05-21
3. Orders on free metabelian groups;Journal of Group Theory;2023-11-30
4. Recent Advances in Algorithmic Problems for Semigroups;ACM SIGLOG News;2023-10
5. Dehn functions of finitely presented metabelian groups;Journal of Group Theory;2021-05-19