Algorithmic Problems in Groups and Semigroups by Jean-Camille Birget (PDF)

Description

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.

User’s Reviews

Reviews from Amazon users which were colected at the time this book was published on the website:

⭐

⭐

Keywords

Free Download Algorithmic Problems in Groups and Semigroups in PDF format
Algorithmic Problems in Groups and Semigroups PDF Free Download
Download Algorithmic Problems in Groups and Semigroups 2013 PDF Free
Algorithmic Problems in Groups and Semigroups 2013 PDF Free Download
Download Algorithmic Problems in Groups and Semigroups PDF
Free Download Ebook Algorithmic Problems in Groups and Semigroups