The Bounded and Precise Word Problems for Presentations of Groups

preview-18
  • The Bounded and Precise Word Problems for Presentations of Groups Book Detail

  • Author : S. V. Ivanov
  • Release Date : 2020-05-13
  • Publisher : American Mathematical Soc.
  • Genre : Education
  • Pages : 106
  • ISBN 13 : 1470441438
  • File Size : 33,33 MB

The Bounded and Precise Word Problems for Presentations of Groups by S. V. Ivanov PDF Summary

Book Description: 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.

Disclaimer: www.yourbookbest.com does not own The Bounded and Precise Word Problems for Presentations of Groups books pdf, neither created or scanned. We just provide the link that is already available on the internet, public domain and in Google Drive. If any way it violates the law or has any issues, then kindly mail us via contact us page to request the removal of the link.

Bounded Littlewood Identities

Bounded Littlewood Identities

File Size : 7,7 MB
Total View : 1925 Views
DOWNLOAD

We describe a method, based on the theory of Macdonald–Koornwinder polynomials, for proving bounded Littlewood identities. Our approach provides an alternativ