Groups with decidable word problem that do not embed in groups with decidable conjugacy problem
From MaRDI portal
Publication:2030402
DOI10.1007/s00222-020-01022-0OpenAlexW3104010695MaRDI QIDQ2030402
Publication date: 7 June 2021
Published in: Inventiones Mathematicae (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1708.09047
Generators, relations, and presentations of groups (20F05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Torsion, torsion length and finitely presented groups
- Representation of Turing reducibility by word and conjugacy problems in finitely presented groups
- Word problems. Decision problems and the Burnside problem in group theory
- Undecidability and recursive inseparability
- SUBGROUPS OF FINITELY PRESENTED GROUPS WITH SOLVABLE CONJUGACY PROBLEM
- Group Embeddings with Algorithmic Properties
- The Conjugacy Problem and Subgroups of Finite Index
- On Group-Theoretic Decision Problems and Their Classification. (AM-68)
- Computational complexity and the conjugacy problem
- LENGTH AND AREA FUNCTIONS ON GROUPS AND QUASI-ISOMETRIC HIGMAN EMBEDDINGS
- CONSTRUCTIVE ALGEBRAS I
- Computable Algebra, General Theory and Theory of Computable Fields
- COMPUTABILITY, ORDERS, AND SOLVABLE GROUPS
This page was built for publication: Groups with decidable word problem that do not embed in groups with decidable conjugacy problem