SearcharxivSearch

arXiv · math/9611214

Class 2 Moufang loops, small Frattini Moufang loops, and code loops

Abstract

Let $L$ be a Moufang loop which is centrally nilpotent of class 2. We first show that the nuclearly-derived subloop (normal associator subloop) $L^*$ of $L$ has exponent dividing 6. It follows that $L_p$ (the subloop of $L$ of elements of $p$-power order) is associative for $p>3$. Next, a loop $L$ is said to be a {\it small Frattini Moufang loop}, or SFML, if $L$ has a central subgroup $Z$ of order $p$ such that $C\isom L/Z$ is an elementary abelian $p$-group. $C$ is thus given the structure of what we call a {\it coded vector space}, or CVS. (In the associative/group case, CVS's are either orthogonal spaces, for $p=2$, or symplectic spaces with attached linear forms, for $p>2$.) Our principal result is that every CVS may be obtained from an SFML in this way, and two SFML's are isomorphic in a manner preserving the central subgroup $Z$ if and only if their CVS's are isomorphic up to scalar multiple. Consequently, we obtain the fact that every SFM 2-loop is a code loop, in the sense of Griess, and we also obtain a relatively explicit characterization of isotopy in SFM 3-loops. (This characterization of isotopy is easily extended to Moufang loops of class 2 and exponent 3.) Finally, we sketch a method for constructing any finite Moufang loop which is centrally nilpotent of class 2.

Explore related subjects

Keep this discovery

BibTeXRIS

Tim Hsu. 1996-11-20. Class 2 Moufang loops, small Frattini Moufang loops, and code loops. https://arxiv.org/abs/math/9611214

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR