Download Algorithms and Classification in Combinatorial Group Theory by Charles F. Miller III (auth.), Gilbert Baumslag, Charles F. PDF

By Charles F. Miller III (auth.), Gilbert Baumslag, Charles F. Miller III (eds.)

The papers during this quantity are the results of a workshop held in January 1989 on the Mathematical Sciences study Institute. issues lined contain choice difficulties, finitely provided easy teams, combinatorial geometry and homology, and automated teams and similar themes.

Show description

Read or Download Algorithms and Classification in Combinatorial Group Theory PDF

Best algorithms books

Genetic Algorithms for Machine Learning

The articles offered the following have been chosen from initial models awarded on the foreign convention on Genetic Algorithms in June 1991, in addition to at a distinct Workshop on Genetic Algorithms for desktop studying on the related convention. Genetic algorithms are general-purpose seek algorithms that use rules encouraged via normal inhabitants genetics to adapt recommendations to difficulties.

Reconfigurable Computing: Architectures, Tools, and Applications: 10th International Symposium, ARC 2014, Vilamoura, Portugal, April 14-16, 2014. Proceedings

This publication constitutes the completely refereed convention complaints of the tenth overseas Symposium on Reconfigurable Computing: Architectures, instruments and purposes, ARC 2014, held in Vilamoura, Portugal, in April 2014. The sixteen revised complete papers offered including 17 brief papers and six detailed consultation papers have been conscientiously reviewed and chosen from fifty seven submissions.

Computability theory

What will we compute--even with limitless assets? Is every little thing close by? Or are computations unavoidably tremendously restricted, not only in perform, yet theoretically? those questions are on the center of computability conception. The objective of this booklet is to offer the reader a company grounding within the basics of computability concept and an outline of presently energetic components of study, comparable to opposite arithmetic and algorithmic randomness.

Structure-Preserving Algorithms for Oscillatory Differential Equations II

This booklet describes quite a few powerful and effective structure-preserving algorithms for second-order oscillatory differential equations. Such platforms come up in lots of branches of technology and engineering, and the examples within the publication contain platforms from quantum physics, celestial mechanics and electronics.

Extra info for Algorithms and Classification in Combinatorial Group Theory

Sample text

That the generalized word problem is solvable is a theorem of Nielsen [71]. The isomorphism type of a free group is determined by its rank which can be easily computed from any presentation by considering its abelianization. Hence all of the basic decision problems are solvable for finitely generated free groups. In this section we survey what is known about the fundamental decision problems for classes of groups enjoying some of the more familiar algebraic properties, for example abelian, solvable, linear and so on.

Alternatively, the generalized word problem for polycyclic groups can be solved by a direct inductive method (see [12]). Quite remarkably, Grunewald and Segal [48] have shown that the isomorphism problem for finitely generated nilpotent groups is recursively solvable. And more recently Segal [99] has succeeded in solving the isomorphism problem for polycyclic groups. In fact all of the algorithms mentioned carry over to the larger class of polycyclic-by-finite groups. 7. The word problem, conjugacy problem, generalized word problem and isomoprphism problem for polycyclic-by-finite groups are recursively solvable.

These various classes of (bi)automatic groups have number of other interesting properties. Thurston has shown that automatic groups are of type FP 00 (see [4]). Gersten and Short [39] have obtained useful information about subgroups of biautomatic and hyperbolic groups. Normal forms and rewriting systems: Continuing with the above notations, one difficulty with Dehn's algorithm for solving the word problem is the following: if R is a Dehn's algorithm and we apply the process of R-reduction to a word w i-c 1 the resulting word, say p( w) will be Rreduced but it is not unique.

Download PDF sample

Rated 5.00 of 5 – based on 49 votes