Algorithmic Problems in Groups and Semigroups - Couverture souple
Livre 27 sur 89: Trends in Mathematics
Synopsis
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.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
