Algorithmic Problems in Groups and Semigroups - Brossura

Libro 25 di 156: Trends in Mathematics
 
9781461213895: Algorithmic Problems in Groups and Semigroups

Al momento non sono disponibili copie per questo codice ISBN.

Sinossi

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.

Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.

Altre edizioni note dello stesso titolo

9780817641306: Algorithmic Problems in Groups and Semigroups

Edizione in evidenza

ISBN 10:  0817641300 ISBN 13:  9780817641306
Casa editrice: Birkhauser, 1999
Rilegato