Classification Of Moufang Loops Of Odd Order
dc.contributor.author | Chee, Wing Loon | |
dc.date.accessioned | 2018-11-07T05:41:34Z | |
dc.date.available | 2018-11-07T05:41:34Z | |
dc.date.issued | 2010-06 | |
dc.description.abstract | The Moufang identity (x · y) · (z · x) = [x · (y · z)] · x was first introduced by Ruth Moufang in 1935. Now, a loop that satisfies the Moufang identity is called a Moufang loop. Our interest is to study the question: “For a positive integer n, must every Moufang loop of order n be associative?”. If not, can we construct a nonassociative Moufang loop of order n? These questions have been studied by handling Moufang loops of even and odd order separately. For even order, Chein (1974) constructed a class of nonassociative Moufang loop, M(G, 2) of order 2m where G is a nonabelian group of order m. Following that, Chein and Rajah (2000) have proved that all Moufang loops of order 2m are associative if and only if all groups of order m are abelian. | en_US |
dc.identifier.uri | http://hdl.handle.net/123456789/7010 | |
dc.language.iso | en | en_US |
dc.publisher | Universiti Sains Malaysia | en_US |
dc.subject | Classification Of Moufang Loops | en_US |
dc.subject | Odd Order | en_US |
dc.title | Classification Of Moufang Loops Of Odd Order | en_US |
dc.type | Thesis | en_US |
Files
License bundle
1 - 1 of 1
Loading...
- Name:
- license.txt
- Size:
- 1.71 KB
- Format:
- Item-specific license agreed upon to submission
- Description: