Titlebook: Algorithms and Classification in Combinatorial Group Theory; Gilbert Baumslag,Charles F. Miller Book 1992 Springer-Verlag New York, Inc. 1

尊敬

發(fā)源

A Tour Around Finitely Presented Infinite Simple Groups,mples of infinite simple groups. For example, let .. be any non-trivial torsion free group. Then, by [3], there exists a torsion free group C., containing .., in which the non-trivial elements of .. are all conjugate to each other. For . ∈ ? define ... = C. and let . = ∪.C.. Then . is an infinite si

sulcus

嫌惡

The Geometry of Rewriting Systems: A Proof of the Anick-Groves-Squier Theorem,ssifying space of . down to a quotient complex (typically “small”) of the same homotopy type. If the rewriting system is finite, then the quotient complex has only finitely many cells in each dimension. The proof yields an explicit free resolution of . over .., similar to resolutions obtained by Ani

嘲弄

Ingenuity

有角

Problems on Automatic Groups,s merely to establish a time and a first speaker, Bill Thurston soon took the floor and one after another of the participants proposed questions on automatic groups, none of which could be answered at that time. It seemed worthwhile to record those questions asked as a guide to research into automat

Harbor

Algorithms and Classification in Combinatorial Group Theory

harrow

Leaven