Algorithmic Problems in Groups and Semigroups

Algorithmic Problems in Groups and Semigroups

Paperback(Softcover reprint of the original 1st ed. 2000)

Eligible for FREE SHIPPING
  • Want it by Thursday, September 27  Order now and choose Expedited Shipping during checkout.

Product Details

ISBN-13: 9781461271260
Publisher: Birkhäuser Boston
Publication date: 10/10/2012
Series: Trends in Mathematics
Edition description: Softcover reprint of the original 1st ed. 2000
Pages: 309
Product dimensions: 6.10(w) x 9.25(h) x 0.03(d)

Table of Contents

Syntactic and Global Semigroup Theory: A Synthesis Approach.- Semigroups with Central Idempotents.- Algebraic Geometry over Groups.- Aspects of the Theory of Free Groups.- Polynomial Isoperimetric Inequalities for Richard Thompson’s Groups F, T,and V.- Ordered Monoids and J-Trivial Monoids.- A Remark on Finitely Generated Subgroups of Free Groups.- Homotopy Reduction Systems for Monoid Presentations II:The Guba—Sapir Reduction and Homotopy Modules.- Algorithmic Problems for Finite Groups and Finite Semigroups.- A Survey on the Computational Power of Some Classes of Finite Monoid Presentations.- Rewriting Systems, Finiteness Conditions, and Associated Functions.- Multiparty Communication Complexity of Finite Monoids.- Presentations for Monoids, Their Maximal Subgroups, and Schützenberger Groups.- On the Growth of Relatively Free Semigroups.- When Can One Finite Monoid Simulate Another?.- Computing Closures of Finitely Generated Subgroups of the Free Group.

Customer Reviews

Most Helpful Customer Reviews

See All Customer Reviews