Magnus embedding and algorithmic properties of groups 𝐹/𝑁^{(𝑑)}
From MaRDI portal
Publication:5267968
DOI10.1090/tran/6880zbMath1434.20021arXiv1501.01001OpenAlexW2964051707MaRDI QIDQ5267968
Funda Gul, Alexander Ushakov, Mahmood Sohrabi
Publication date: 14 June 2017
Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1501.01001
Generalizations of solvable and nilpotent groups (20F19) Geometric group theory (20F65) Complexity of computation (including implicit computational complexity) (03D15) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)
Related Items
The conjugacy problem in free solvable groups and wreath products of abelian groups is in \({\mathsf {TC}^0}\), Orientable quadratic equations in free metabelian groups, The conjugacy problem in free solvable groups and wreath products of abelian groups is in \(\mathsf{TC}^0\)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algorithmic theory of free solvable groups: randomized computations.
- On quasilinear-time complexity theory
- Knapsack problems in products of groups
- Topology of finite graphs
- On the word problem and the conjugacy problem for groups of the form \(F/V(R)\)
- Stallings foldings and subgroups of free groups
- Limit groups as limits of free groups.
- On a theorem of Marshall Hall
- Spherical quadratic equations in free metabelian groups
- Polynomial time conjugacy in wreath products and free solvable groups
- [https://portal.mardi4nfdi.de/wiki/Publication:3916734 On the Conjugacy Problem for F/R �]
- On Group-Theoretic Decision Problems and Their Classification. (AM-68)
- THE MAGNUS EMBEDDING IS A QUASI-ISOMETRY
- The word and geodesic problems in free solvable groups
- Knapsack problems in groups
- The Conjugacy Problem in Wreath Products and Free Metabelian Groups
- Commutator Subgroups of Free Groups
