The bounded and precise word problems for presentations of groups

Research exposition (monographs, survey articles) pertaining to group theory (20-02) Generators, relations, and presentations of groups (20F05) Cancellation theory of groups; application of van Kampen diagrams (20F06) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Geometric group theory (20F65) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)

arXiv classification

cs.CG math.GR

Abstract: We introduce and study the bounded word problem and the precise word problem for groups given by means of generators and defining relations. For example, for every finitely presented group, the bounded word problem is in NP, i.e., it can be solved in nondeterministic polynomial time, and the precise word problem is in PSPACE. The main technical result of the paper states that, for certain finite presentations of groups, which include the Baumslag-Solitar one-relator groups and free products of cyclic groups, the bounded word problem and the precise word problem can be solved in polylogarithmic space. As consequences of developed techniques that can be described as calculus of brackets, we obtain polylogarithmic space bounds for the computational complexity of the diagram problem for free groups, for the width problem for elements of free groups, and for computation of the area defined by polygonal singular closed curves in the plane. We also obtain polynomial time bounds for these problems.

Recommendations

This page was built for publication: The bounded and precise word problems for presentations of groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6274951)