On the non-commuting graph in finite Moufang loops

The non-commuting graph associated to a non-abelian group [Formula: see text], [Formula: see text], is a graph with vertex set [Formula: see text] where distinct non-central elements [Formula: see text] and [Formula: see text] of [Formula: see text] are joined by an edge if and only if [Formula: see text]. The non-commuting graph of a non-abelian finite group has received some attention in existing literature. Recently, many authors have studied the non-commuting graph associated to a non-abelian group. In particular, the authors put forward the following conjectures: Conjecture 1. Let [Formula: see text] and [Formula: see text] be two non-abelian finite groups such that [Formula: see text]. Then [Formula: see text]. Conjecture 2 (AAM’s Conjecture). Let [Formula: see text] be a finite non-abelian simple group and [Formula: see text] be a group such that [Formula: see text]. Then [Formula: see text]. Some authors have proved the first conjecture for some classes of groups (specially for all finite simple groups and non-abelian nilpotent groups with irregular isomorphic non-commuting graphs) but in [Moghaddamfar, About noncommuting graphs, Sib. Math. J. 47(5) (2006) 911–914], Moghaddamfar has shown that it is not true in general with some counterexamples to this conjecture. On the other hand, Solomon and Woldar proved the second conjecture, in [R. Solomon and A. Woldar, Simple groups are characterized by their non-commuting graph, J. Group Theory 16 (2013) 793–824]. In this paper, we will define the same concept for a finite non-commutative Moufang loop [Formula: see text] and try to characterize some finite non-commutative Moufang loops with their non-commuting graph. Particularly, we obtain examples of finite non-associative Moufang loops and finite associative Moufang loops (groups) of the same order which have isomorphic non-commuting graphs. Also, we will obtain some results related to the non-commuting graph of a finite non-commutative Moufang loop. Finally, we give a conjecture stating that the above result is true for all finite simple Moufang loops.

A second grammar of associators

1. Introduction. This paper is concerned with proving identities in commutative Moufang loops. Many such identities were derived in chapter VIII of (1) in the course of demonstrating the local nilpotence of commutative Moufang loops. The results there are regarded as constituting the ‘first grammar of associators’: the reader is assumed to have a good knowledge of them. The current paper develops additional material required for the determination in (5) of the precise nilpotence class of the free commutative Moufang loop on any given finite number of generators. It is called a ‘grammar’ because it lists formal ways in which the language of associators works, and is merely meant to serve a reader of ‘literature’ in the language such as (5). However, it may be of interest for other purposes, such as answering Manin's question ((3), Vopros 10·3; (4), problem 10·2) on the 3-rank of the free commutative Moufang loop of exponent 3. There is also the problem raised below as to whether the Triple Argument Hypothesis is a consequence of the commutative Moufang loop laws. Finally, the Möbius function in Section 9 may tempt someone to look at lattice-theoretical aspects of associators.

On the nilpotence class of commutative Moufang loops

The nilpotence class of the free commutative Moufang loop on n generators (n > 3) is the maximum allowed by the Bruck-Slaby Theorem, namely n − 1. This is proved by setting up a presentation of an extension of the loop's multiplication group as a nilpotent group of class at most 2n − 2, and then using the Macdonald-Wamsley technique of nilpotent group theory to show that this class is exactly 2n − 2.