Finding direct product decompositions in polynomial time

Details Finding direct product decompositions in polynomial time Finding direct product decompositions in polynomial time

2010-05-04

arxiv.org/abs/1005.0548v1

Mathematics

Group Theory

39 pages, 6 figures

Scientific paper

A polynomial-time algorithm is produced which, given generators for a group of permutations on a finite set, returns a direct product decomposition of the group into directly indecomposable subgroups. The process uses bilinear maps and commutative rings to characterize direct products of p-groups of class 2 and reduces general groups to p-groups using group varieties. The methods apply to quotients of permutation groups and operator groups as well.

Affiliated with

Also associated with

No associations

Rating

Finding direct product decompositions in polynomial time 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 Finding direct product decompositions in polynomial time, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Finding direct product decompositions in polynomial time will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-532310