The Length of Elements in Free Solvable Groups

DOI10.2307/2159821zbMath0798.20026OpenAlexW4235762796MaRDI QIDQ3141280

Jacques Lewin, Carl Droms, Herman J. Servatius

Publication date: 3 November 1994

Full work available at URL: https://doi.org/10.2307/2159821

zbMATH Keywords

presentationcomplexityword problempolynomial timefree solvable grouplength of a shortest word

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Solvable groups, supersolvable groups (20F16) Generators, relations, and presentations of groups (20F05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Software, source code, etc. for problems pertaining to group theory (20-04)

Related Items (8)

Algorithmic theory of free solvable groups: randomized computations. ⋮ The word and geodesic problems in free solvable groups ⋮ Spherical quadratic equations in free metabelian groups ⋮ Orientable quadratic equations in free metabelian groups ⋮ Amenability of semigroups and the Ore condition for semigroup rings ⋮ Logspace computations in graph products ⋮ Random walks on free solvable groups ⋮ Metric behaviour of the Magnus embedding.

Cites Work

• Unnamed Item
• Unnamed Item
• The Euclidean traveling salesman problem is NP-complete
• Growth Series of Some Wreath Products

This page was built for publication: The Length of Elements in Free Solvable Groups