Algorithmic and combinatorial methods for enumerating the relators of a group presentation

Details Algorithmic and combinatorial methods for enumerating the relators of a group presentation Algorithmic and combinatorial methods for enumerating the relators of a group presentation

2008-02-24

arxiv.org/abs/0802.3544v8

Mathematics

Group Theory

This is my Ph.D. thesis, 134 pages

Scientific paper

The main achievement of this thesis is an algorithm which given a finite
group presentation and natural numbers n and k, computes all the relators of
length and area up to n and k respectively. The complexity of this algorithm is
better by a factor which is over-exponential than that of classical methods
using van Kampen diagrams.

Affiliated with

Also associated with

No associations

Rating

Algorithmic and combinatorial methods for enumerating the relators of a group presentation 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 Algorithmic and combinatorial methods for enumerating the relators of a group presentation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Algorithmic and combinatorial methods for enumerating the relators of a group presentation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-603145