Construction of All Gyrogroups of Orders at most 31

Ali Reza Ashrafi; Kurosh Mavaddat Nezhaad; Mohammad Ali Salahshour

Home/Archive/arXiv

arXiv · 2209.04948

Construction of All Gyrogroups of Orders at most 31

Ali Reza Ashrafi·Kurosh Mavaddat Nezhaad·Mohammad Ali Salahshour

View original source ↗Read source document ↗Export metadata ↓

Abstract

The gyrogroup is the closest algebraic structure to the group ever discovered. It has a binary operation $\star$ containing an identity element such that each element has an inverse. Furthermore, for each pair $(a,b)$ of elements of this structure there exists an automorphism $\gyr{a,b}{}$ with this property that left associativity and left loop property are satisfied. Since each gyrogroup is a left Bol loop, some results of Burn imply that all gyrogroups of orders $p, 2p$ and $p^2$ are groups. The aim of this paper is to classify gyrogroups of orders 8, 12, 15, 18, 20, 21, and 28.

Explore related subjects

math.GR

Keep this discovery

BibTeX RIS

Ali Reza Ashrafi, Kurosh Mavaddat Nezhaad, Mohammad Ali Salahshour. 2022-09-11. Construction of All Gyrogroups of Orders at most 31. https://arxiv.org/abs/2209.04948

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

KEEP EXPLORING

Related papers

arXiv2026

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↗

arXiv2026

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↗

arXiv2026

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↗