Applications of computational tools for finitely presented groups

Details Applications of computational tools for finitely presented groups Applications of computational tools for finitely presented groups

1994-06-15

arxiv.org/abs/math/9406207v1

Mathematics

Group Theory

To appear in the Proceedings of the DIMACS Workshop on Computational Support for Discrete Mathematics, DIMACS Ser. in Discrete

Scientific paper

Computer based techniques for recognizing finitely presented groups are quite powerful. Tools available for this purpose are outlined. They are available both in stand-alone programs and in more comprehensive systems. A general computational approach for investigating finitely presented groups by way of quotients and subgroups is described and examples are presented. The techniques can provide detailed information about group structure. Under suitable circumstances a finitely presented group can be shown to be soluble and its complete derived series can be determined, using what is in effect a soluble quotient algorithm.

Affiliated with

Also associated with

No associations

Rating

Applications of computational tools for finitely presented groups does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Applications of computational tools for finitely presented groups, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Applications of computational tools for finitely presented groups will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-653137