SearcharxivSearch

arXiv · 1709.06559

Holomorphy of Osborn loops

Abstract

Let $(L,\cdot)$ be any loop and let $A(L)$ be a group of automorphisms of $(L,\cdot)$ such that $\alpha$ and $\phi$ are elements of $A(L)$. It is shown that, for all $x,y,z\in L$, the $A(L)$-holomorph $(H,\circ)=H(L)$ of $(L,\cdot)$ is an Osborn loop if and only if $x\alpha (yz\cdot x\phi^{-1})= x\alpha (yx^\lambda\cdot x) \cdot zx\phi^{-1}$. Furthermore, it is shown that for all $x\in L$, $H(L)$ is an Osborn loop if and only if $(L,\cdot)$ is an Osborn loop, $(x\alpha\cdot x^{\rho})x=x\alpha$, $x(x^{\lambda}\cdot x\phi^{-1})=x\phi^{-1}$ and every pair of automorphisms in $A(L)$ is nuclear (i.e. $x\alpha\cdot x^{\rho},x^{\lambda}\cdot x\phi\in N(L,\cdot )$). It is shown that if $H(L)$ is an Osborn loop, then $A(L,\cdot)= \mathcal{P}(L,\cdot)\cap\Lambda(L,\cdot)\cap\Phi(L,\cdot)\cap\Psi(L,\cdot)$ and for any $\alpha\in A(L)$, $\alpha= L_{e\pi}=R^{-1}_{e\varrho}$ for some $\pi\in \Phi(L,\cdot)$ and some $\varrho\in \Psi(L,\cdot)$. Some commutative diagrams are deduced by considering isomorphisms among the various groups of regular bijections (whose intersection is $A(L)$) and the nucleus of $(L,\cdot)$.

Explore related subjects

Keep this discovery

BibTeXRIS

Abednego Orobosa Isere, John Olushola Adeniran, Temitope Gbolahan Jaiyeola. 2017-09-19. Holomorphy of Osborn loops. https://doi.org/10.1515/awutm-2015-0016

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