SearcharxivSearch

arXiv · 1403.2254

Semiautomorphic Inverse Property Loops

Abstract

We define a variety of loops called semiautomorphic, inverse property loops that generalize Moufang and Steiner loops. We first show an equivalence between a previously studied variety of loops. Next we extend several known results for Moufang and Steiner loops. That is, the commutant is a subloop and if $a$ is in the commutant, then $a^{2}$ is a Moufang element, $a^{3}$ is a $c$-element and $a^{6}$ is in the center. Finally, we give two constructions for semiautomorphic inverse property loops based on Chein's and de Barros and Juriaans' doubling constructions.

Explore related subjects

Keep this discovery

BibTeXRIS

Mark Greer. 2014-03-10. Semiautomorphic Inverse Property Loops. https://arxiv.org/abs/1403.2254

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