SearcharxivSearch

arXiv · 1712.06516

Automorphisms of dihedral-like automorphic loops

Abstract

Automorphic loops are loops in which all inner mappings are automorphisms. A large class of automorphic loops is obtained as follows: Let $m$ be a positive even integer, $G$ an abelian group, and $\alpha$ an automorphism of $G$ that satisfies $\alpha^2=1$ if $m>2$. Then the dihedral-like automorphic loop $\mathrm{Dih}(m,G,\alpha)$ is defined on $\mathbb Z_m\times G$ by $(i,u)(j,v)=(i+j, ((-1)^{j}u+v)\alpha^{ij})$. We prove that two finite dihedral-like automorphic loops $\mathrm{Dih}(m,G,\alpha)$, $\mathrm{Dih}(\overline{m},\overline{G},\overline{\alpha})$ are isomorphic if and only if $m=\overline{m}$, $G=\overline{G}$, and $\alpha$ is conjugate to $\overline{\alpha}$ in the automorphism group of $G$. Moreover, for a finite dihedral-like automorphic loop $Q$ we describe the structure of the automorphism group of $Q$ and its subgroup consisting of inner mappings of $Q$.

Explore related subjects

Keep this discovery

BibTeXRIS

Mouna Aboras, Petr Vojtěchovský. 2017-12-18. Automorphisms of dihedral-like automorphic loops. https://arxiv.org/abs/1712.06516

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