The Bounded and Precise Word Problems for Presentations of Groups (Paperback)

The author introduces and studies 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, i.e., it can be solved in polynomial space. 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, the author obtains 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. The author also obtains polynomial time bounds for these problems.

General

Imprint:	American Mathematical Society
Country of origin:	United States
Series:	Memoirs of the American Mathematical Society
Release date:	October 2020
Authors:	S. V Ivanov
Dimensions:	254 x 178mm (L x W)
Format:	Paperback
Pages:	106
ISBN-13:	978-1-4704-4143-2
Categories:	Books > Science & Mathematics > Mathematics > Algebra > Groups & group theory Books > Science & Mathematics > Mathematics > Geometry > Algebraic geometry
LSN:	1-4704-4143-8
Barcode:	9781470441432

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!