Group Embeddings with Algorithmic Properties

DOI10.1080/00927872.2014.955579zbMath1337.20036arXiv1708.04397OpenAlexW1777911311MaRDI QIDQ3448552

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 productsword problemmembership problemtime complexityspace complexity2-generator groupsembeddings of groupssubnormal embeddings

Mathematics Subject Classification ID

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

Related Items (4)

Embeddings into left‐orderable simple groups ⋮ Groups with decidable word problem that do not embed in groups with decidable conjugacy problem ⋮ On decidability of amenability in computable groups ⋮ COMPUTABILITY, ORDERS, AND SOLVABLE GROUPS

Cites Work

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

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