The word and geodesic problems in free solvable groups
From MaRDI portal
Publication:4930015
DOI10.1090/S0002-9947-10-04959-7zbMath1207.20026arXiv0807.1032OpenAlexW2019453185MaRDI QIDQ4930015
Alexander Ushakov, Alexei G. Myasnikov, Vitaliĭ Roman'kov, Anatoly M. Vershik
Publication date: 27 September 2010
Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0807.1032
computational complexitySteiner tree problemword problemFox derivativesfree solvable groupsgeodesic problem
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Solvable groups, supersolvable groups (20F16) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)
Related Items (25)
Randomness and complexity in matrix groups ⋮ Non-commutative lattice problems ⋮ The conjugacy problem in free solvable groups and wreath products of abelian groups is in \({\mathsf {TC}^0}\) ⋮ On groups that have normal forms computable in logspace. ⋮ Superpositions of free Fox derivations ⋮ Time complexity of the conjugacy problem in relatively hyperbolic groups ⋮ Conjugation curvature in solvable Baumslag–Solitar groups ⋮ Algorithmic theory of free solvable groups: randomized computations. ⋮ \(\mathcal C\)-graph automatic groups. ⋮ Knapsack and the power word problem in solvable Baumslag–Solitar groups ⋮ APPROXIMATION OF GEODESICS IN METABELIAN GROUPS ⋮ THE MAGNUS EMBEDDING IS A QUASI-ISOMETRY ⋮ Unnamed Item ⋮ Spherical quadratic equations in free metabelian groups ⋮ Orientable quadratic equations in free metabelian groups ⋮ Generalized Learning Problems and Applications to Non-commutative Cryptography ⋮ Detecting properties from descriptions of groups ⋮ The conjugacy problem in free solvable groups and wreath products of abelian groups is in \(\mathsf{TC}^0\) ⋮ Logspace computations in graph products ⋮ Knapsack problems in groups ⋮ Unnamed Item ⋮ Random walks on free solvable groups ⋮ Unnamed Item ⋮ Magnus embedding and algorithmic properties of groups 𝐹/𝑁^{(𝑑)} ⋮ Searching for applicable versions of computable structures
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Free differential calculus. III: Subgroups
- A class of varieties of inverse semigroups
- Quasi-isometries and rigidity of solvable groups
- Connected graphs containing a given connected graph as a unique greatest common subgraph
- Random walks on discrete groups: Boundary and entropy
- E-unitary inverse monoids and the Cayley graph of a group presentation
- Groups of polynomial growth and expanding maps. Appendix by Jacques Tits
- Semidirect products of pseudovarieties from the universal algebraist's point of view
- Quasi-isometric rigidity for the solvable Baumslag-Solitar groups. II
- A rigidity theorem for the solvable Baumslag-Solitar groups. (With an appendix by Daryl Cooper)
- Quasi-actions on trees. I: Bounded valence
- On drift and entropy growth for random walks on groups
- A constructive version of the Ribes-Zalesskiĭ product theorem.
- Free differential calculus. V: The Alexander matrices reexamined
- Growth of finitely generated solvable groups
- Constructing divisions into power groups
- On a theorem of Marshall Hall
- Free differential calculus. I: Derivation in the free group ring
- Free differential calculus. II: The isomorphism problem of groups
- Dynamic theory of growth in groups: Entropy, boundaries, examples
- The Length of Elements in Free Solvable Groups
- Two Examples of Soluble Groups that are not Conjugacy Separable
- Residual Properties of Infinite Soluble Groups
- Free Objects in Certain Varieties of Inverse Semigroups
- GEOMETRICAL APPROACH TO THE FREE SOLVABLE GROUPS
- Free Group Rings
- Growth Series of Some Wreath Products
- Free Inverse Semigroups
- Another Example of a Soluble Group that is not Conjugacy Separable
- The Rectilinear Steiner Tree Problem is $NP$-Complete
- The geometry of profinite graphs with applications to free groups and finite monoids
- PROFINITE SEMIGROUPS, VARIETIES, EXPANSIONS AND THE STRUCTURE OF RELATIVELY FREE PROFINITE SEMIGROUPS
- ALGORITHMIC PROBLEMS IN VARIETIES
- The Conjugacy Problem in Wreath Products and Free Metabelian Groups
- On Steiner’s Problem with Rectilinear Distance
This page was built for publication: The word and geodesic problems in free solvable groups
