Group Embeddings with Algorithmic Properties

DOI10.1080/00927872.2014.955579MaRDI QIDQ3448552zbMATH OpenOpenAlexFDO

Authors Arman Darbinyan

Publication date 26 October 2015

Published in Communications in Algebra (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1708.04397

zbMATH Keywords

wreath productsspace complexitytime complexityword problem2-generator groupsmembership problemembeddings of groupssubnormal embeddings

Mathematics Subject Classification ID

Extensions, wreath products, and other compositions of groups (20E22) Generators, relations, and presentations of groups (20F05) Subgroup theorems; subgroup growth (20E07) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Abstract: We show that every countable group H with solvable word problem (=computable group) can be subnormally embedded into a 2-generated group G which also has solvable word problem. Moreover, the membership problem for H < G is also solvable. We also give estimates of time and space complexity of the word problem in G and of the membership problem for H < G.

Recommendations

• Embeddings into efficient groups
• Embeddings into \(k\)-efficient groups.
• Algorithmic and asymptotic properties of groups.
• scientific article; zbMATH DE number 1026062
• Towards effective algorithms for linear groups.
• scientific article; zbMATH DE number 5976624
• scientific article; zbMATH DE number 1521041
• Embedding arbitrary algebras in groups
• scientific article; zbMATH DE number 5657421
• scientific article; zbMATH DE number 29103

Cites work

• An Embedding Construction for Ordered Groups
• An Embedding Theorem for Finitely Generated Groups
• An algebraic characterization of groups with soluble word problem
• Embedding Methods for Periodic Groups
• Embedding Theorems for Groups
• Embedding Theorems for Groups
• Embedding theorems for residually finite groups
• Isoperimetric and isodiametric functions of groups
• Isoperimetric functions of groups and computational complexity of the word problem
• On Embedding Groups and the Conjugacy Problem
• On the Finiteness of Certain Soluble Groups
• On the embedding of a group in a join of given groups
• Space functions of groups.
• Subnormal Embedding Theorems for Groups
• Varieties of groups

Cited in

(17)

• On some residual properties of the verbal embeddings of groups
• Isoperimetric functions of groups and computational complexity of the word problem
• Groups with decidable word problem that do not embed in groups with decidable conjugacy problem
• An Embedding Construction for Ordered Groups
• Magnus embedding and algorithmic properties of groups \(F/N^{(d)}\)
• On Embedding Groups and the Conjugacy Problem
• Two problems for solvable and nilpotent groups
• scientific article; zbMATH DE number 1534357 (Why is no real title available?)
• Embeddings into left‐orderable simple groups
• Algorithmic and asymptotic properties of groups.
• Embeddings determined by universal words in the rank 2 free group
• COMPUTABILITY, ORDERS, AND SOLVABLE GROUPS
• Embeddings in finitely presented groups which preserve the center.
• Embedding of groups and quadratic equations over groups
• On embeddings of countable generalized soluble groups into two-generated groups
• Implementation of Stanley's algorithm for projective group imbeddings
• On decidability of amenability in computable groups

This page was built for publication: Group Embeddings with Algorithmic Properties

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3448552)