Automorphism groups of simple Moufang loops over perfect fields

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Automorphism Groups of Simple Moufang Loops over Perfect Fields

Let F be a perfect field and M(F ) the nonassociative simple Moufang loop consisting of the units in the (unique) split octonion algebra O(F ) modulo the center. Then Aut(M(F )) is equal to G2(F )o Aut(F ). In particular, every automorphism of M(F ) is induced by a semilinear automorphism of O(F ). The proof combines results and methods from geometrical loop theory, groups of Lie type and compo...

متن کامل

Generators of Nonassociative Simple Moufang Loops over Finite Prime Fields

The first class of nonassociative simple Moufang loops was discovered by L. Paige in 1956 [9], who investigated Zorn’s and Albert’s construction of simple alternative rings. M. Liebeck proved in 1987 [7] that there are no other finite nonassociative simple Moufang loops. We can briefly describe the class as follows: For every finite field F, there is exactly one simple Moufang loop. Recall Zorn...

متن کامل

Generators for Finite Simple Moufang Loops

Moufang loops are one of the best-known generalizations of groups. There is only one countable family of nonassociative finite simple Moufang loops, arising from the split octonion algebras. We prove that every member of this family is generated by three elements, using the classical results on generators of unimodular groups.

متن کامل

Moufang loops that are almost groups

It is known that Moufang loops are closely related to groups as they have many properties in common. For instance, they both have an inverse for each element and satisfy Lagrange’s theorem. In this paper, we study the properties of a class of Moufang loops which are not groups, but all their proper subloops and proper quotient loops are groups.

متن کامل

Automorphism groups of real Cayley-Dickson loops

The Cayley-Dickson loop Cn is the multiplicative closure of basic elements of the algebra constructed by n applications of the Cayley-Dickson doubling process (the first few examples of such algebras are real numbers, complex numbers, quaternions, octonions, sedenions). We will discuss properties of the Cayley-Dickson loops, show that these loops are Hamiltonian and describe the structure of th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematical Proceedings of the Cambridge Philosophical Society

سال: 2003

ISSN: 0305-0041,1469-8064

DOI: 10.1017/s0305004103006716