Conjugacy of Sylow 2-Subloops of the Chein Loops M 2n (G, 2)

In general, Sylow's Theorems do not hold for finite Moufang loops. It can be seen that if p is an odd prime then the Sylow p-subloops of the Chein loop M _2n (G, 2) are conjugate. Here we prove that it is also true that all the Sylow 2-subloops of M _2n (G, 2) are conjugate.     

Finite Bruck loops

Bruck loops are Bol loops satisfying the automorphic inverse property. We prove a structure theorem for finite Bruck loops , showing that is essentially the direct product of a Bruck loop of odd order with a -element Bruck loop. The former class of loops is well understood. We identify the minimal obstructions to the conjecture that all finite -element Bruck loops are -loops, leaving open the question of whether such obstructions actually exist.

     

On Nuclearly Nilpotent Loops of Finite Exponent

We show that the restricted Burnside problem has a positive answer for suitable classes of nuclearly nilpotent loops. Using this technique we give a positive answer to the restricted Burnside problem for Moufang A-loops.     

Sylow's theorem for Moufang loops

For finite Moufang loops, we prove an analog of the first Sylow theorem giving a criterion for the existence of a p-Sylow subloop. We also find the maximal order of p-subloops in the Moufang loops that do not possess p-Sylow subloops.     

The Number of Sylow p-Subloops in Finite Moufang Loops

We prove that if L is a finite Moufang loop and p is a Sylow prime for L then the number of Sylow p-subloops of L is congruent to one modulo p.     

Abelian-by-Cyclic Moufang Loops

We use groups with triality to construct a series of nonassociative Moufang loops. Certain members of this series contain an abelian normal subloop with the corresponding quotient being a cyclic group. In particular, we give a new series of examples of finite abelian-by-cyclic Moufang loops. The previously known [10 Rajah , A. ( 2001 ). Moufang loops of odd order pq ³ . J. Algebra 235 ( 1 ): 66 – 93 .[Crossref], [Web of Science ®] , [Google Scholar]] loops of this type of odd order 3q ³, with prime q ≡ 1 (mod 3), are particular cases of our series. Some of the examples are shown to be embeddable into a Cayley algebra.     

On the structure of the automorphism group of certain automorphic loop

Automorphic loops, or A-loops, are loops in which all inner mappings are automorphisms. We investigated A-loops arising from a Lie algebra and describe their automorphism group. Also, we identify and describe their inner mapping group.     

Constructions of Commutative Automorphic Loops

A loop whose inner mappings are automorphisms is an automorphic loop (or A-loop). We characterize commutative (A-)loops with middle nucleus of index 2 and solve the isomorphism problem. Using this characterization and certain central extensions based on trilinear forms, we construct several classes of commutative A-loops of order a power of 2. We initiate the classification of commutative A-loops of small orders and also of order p ³, where p is a prime.     

The Campbell- Hausdorff Series of Local Analytic Bruck Loops

The class of local analyitic Bruck loops (or equivalently K-loops) is strongly related to locally symmetric spaces. In particular, both have Lie triple systems as their tangent algebra. In this paper, we consider the existence and some properties of the Campbell-Hausdorff series of local analytic Bruck loops (K-loops). This formula can be used to determine the local symmetries of the associated symmetric space.     

Admissible Orders of Jordan Loops

A commutative loop is Jordan if it satisfies the identity x²(yx) = (x²y)x. Using an amalgam construction and its generalizations, we prove that a nonassociative Jordan loop of order n exists if and only if n≧ 6 and n≠ 9. We also consider whether powers of elements in Jordan loops are well‐defined, and we construct an infinite family of finite simple nonassociative Jordan loops. © 2008 Wiley Periodicals, Inc. J Combin Designs 17: 103–118, 2009     

G-Loops and Permutation Groups

A G-loop is a loop which is isomorphic to all its loop isotopes. We apply some theorems about permutation groups to get information about G-loops. In particular, we study G-loops of order pq, where p < q are primes and p  (q − 1). In the case p = 3, the only G-loop of order 3q is the group of order 3q. The notion “G-loop” splits naturally into “left G-loop” plus “right G-loop.” There exist non-group right G-loops and left G-loops of order n iff n is composite and n > 5.     

Primary Decompositions in Varieties of Commutative Diassociative Loops

The decomposition theorem for torsion abelian groups holds analogously for torsion commutative diassociative loops. With this theorem in mind, we investigate commutative diassociative loops satisfying the additional condition (trivially satisfied in the abelian group case) that all nth powers are central, for a fixed n. For n = 2, we get precisely commutative C loops. For n = 3, a prominent variety is that of commutative Moufang loops.

Many analogies between commutative C and Moufang loops have been noted in the literature, often obtained by interchanging the role of the primes 2 and 3. We show that the correct encompassing variety for these two classes of loops is the variety of commutative RIF loops. In particular, when Q is a commutative RIF loop: all squares in Q are Moufang elements, all cubes are C elements, Moufang elements of Q form a normal subloop M ₀(Q) such that Q/M ₀(Q) is a C loop of exponent 2 (a Steiner loop), C elements of L form a normal subloop C ₀(Q) such that Q/C ₀(Q) is a Moufang loop of exponent 3. Since squares (resp., cubes) are central in commutative C (resp., Moufang) loops, it follows that Q modulo its center is of exponent 6. Returning to the decomposition theorem, we find that every torsion, commutative RIF loop is a direct product of a C 2-loop, a Moufang 3-loop, and an abelian group with each element of order prime to 6.

We also discuss the definition of Moufang elements and the quasigroups associated with commutative RIF loops.     

Simple Bol Loops

In this article we investigate the Bol loops and connected with them groups. We prove an analog of the Doro's theorem for Moufang loops and find a criterion for simplicity of Bol loops. One of the main results obtained is the following: If the right multiplication group of a connected finite Bol loop S is a simple group, then S is a Moufang loop.     

3‐Factor‐Criticality of Vertex‐Transitive Graphs

A graph of order n is p ‐factor‐critical, where p is an integer of the same parity as n, if the removal of any set of p vertices results in a graph with a perfect matching. 1‐factor‐critical graphs and 2‐factor‐critical graphs are factor‐critical graphs and bicritical graphs, respectively. It is well known that every connected vertex‐transitive graph of odd order is factor‐critical and every connected nonbipartite vertex‐transitive graph of even order is bicritical. In this article, we show that a simple connected vertex‐transitive graph of odd order at least five is 3‐factor‐critical if and only if it is not a cycle.     

42-arcs in PG(2, q) left invariant by PSL(2, 7)

For an odd prime p?≠ 7, let q be a power of p such that ${q^3\equiv1 \pmod 7}$ . It is known that the desarguesian projective plane PG(2, q) of order q has a unique conjugacy class of projectivity groups isomorphic to PSL(2, 7). For such a projective group Γ, we investigate the geometric properties of the (unique) Γ-orbit Ω of size 42 such that the 1-point stabilizer of Γ in Ω is a cyclic group of order 4. We present a computational approach to prove that Ω is a 42-arc provided that q?≥ 53 and q?≠ 37³, 11⁶, 5⁶, 3⁶. We discuss the case q?=?53 in more detail showing the completeness of Ω for q?=?53.     

On nilpotent Moufang loops with central associators

In this paper, we investigate Moufang p-loops of nilpotency class at least three for $p>3$. The smallest examples have order $p^5$ and satisfy the following properties: (1) They are of maximal nilpotency class, (2) their associators lie in the center, and (3) they can be constructed using a general form of the semidirect product of a cyclic group and a group of maximal class. We present some results concerning loops with these properties. As an application, we classify proper Moufang loops of order $p^5$, $p>3$, and collect information on their multiplication groups.     

Code loops in both parities

We present equivalent definitions of code loops in any characteristic p≠0. The most natural definition is via combinatorial polarization, but we also show how to realize code loops by linear codes and as a class of symplectic conjugacy closed loops. For p odd, it is possible to define code loops via characteristic trilinear forms. Related concepts are discussed.     

Note on group distance magic complete bipartite graphs

A Γ-distance magic labeling of a graph G = (V, E) with |V| = n is a bijection ? from V to an Abelian group Γ of order n such that the weight $w(x) = \sum\nolimits_{y \in N_G (x)} {\ell (y)}$ of every vertex x ∈ V is equal to the same element µ ∈ Γ, called the magic constant. A graph G is called a group distance magic graph if there exists a Γ-distance magic labeling for every Abelian group Γ of order |V(G)|. In this paper we give necessary and sufficient conditions for complete k-partite graphs of odd order p to be ? _p -distance magic. Moreover we show that if p ≡ 2 (mod 4) and k is even, then there does not exist a group Γ of order p such that there exists a Γ-distance labeling for a k-partite complete graph of order p. We also prove that K _m,n is a group distance magic graph if and only if n + m ? 2 (mod 4).     

The Orders of Vertices of a Character-degree Graph

Let G be a finite group. We put ρ(G) = {p|p is a prime dividing χ(1) for some χ ∈Irr(G)}. We define a graph Γ(G), whose vertices are the primes in ρ(G) and p, q ∈ ρ(G) are connected in Γ(G) denoted p ～ q, if pq||χ(1) for some χ ∈Irr(G). For p ∈ ρ(G), we define ord(p) = |{q ∈ ρ(G)|q ～ p}|. We call ord(p) the order of the vertex p of the graph Γ(G). In this article, we discuss orders and the influences of orders on the structure of finite groups.     

Polar Decomposition of Locally Finite Groups

The study of loops as transversals in groups dates back to the works of Reinhold Baer. In the past few years there have been several papers using polar decomposition in linear algebra in order to construct Bruck loops. In this paper we generalize the notion of polar decomposition to any arbitrary group, and we show that in any polar decomposition the binary operation “inherited” from the group leads to the construction of a Bruck loop.