Unbreakable Loops

Details Unbreakable Loops Unbreakable Loops

2010-09-02

arxiv.org/abs/1009.0487v1

Mathematics

Group Theory

28 pages

Scientific paper

We say that a loop is unbreakable when it does not have nontrivial subloops. While the cyclic groups of prime order are the only unbreakable finite groups, we show that nonassociative unbreakable loops exist for every order n >= 5. We describe two families of commutative unbreakable loops of odd order, n >= 7, one where the loop's multiplication group is isomorphic to the alternating group An and another where the multiplication group is isomorphic to the symmetric group Sn. We also prove for each even n >= 6 that there exist unbreakable loops of order n whose multiplication group is isomorphic to Sn.

Affiliated with

Also associated with

No associations

Rating

Unbreakable Loops 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 Unbreakable Loops, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Unbreakable Loops will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-376715