Search arXivSearch

arXiv · 1306.6261

Cyclic extensions of Moufang loops induced by semi-automorphisms

Abstract

It is well known that if a group G factorizes as G = NH where H\leq G and N is normal in G then the group structure of G is determined by the subgroups H and N, the intersection of N with H and how H acts on N with a homomorphism f : H -> Aut(N). Here we generalize the idea by creating extensions using the semi-automorphism group of N. We show that if G=NH is a Moufang loop, N is a normal subloop, and H= is a finite cyclic group of order coprime to three then the binary operation of G depends only on the binary operation of N, the intersection of N with H, and how u permutes the elements of N as a semi-automorphism of N.

Explore related subjects

Keep this discovery

BibTeXRIS

Stephen M. Gagola III. 2013-06-26. Cyclic extensions of Moufang loops induced by semi-automorphisms. https://arxiv.org/abs/1306.6261

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