SearcharxivSearch

arXiv · 0908.2597

The finite Bruck Loops

Abstract

We continue the work by Aschbacher, Kinyon and Phillips [AKP] as well as of Glauberman [Glaub1,2] by describing the structure of the finite Bruck loops. We show essentially that a finite Bruck loop $X$ is the direct product of a Bruck loop of odd order with either a soluble Bruck loop of 2-power order or a product of loops related to the groups $PSL_2(q)$, $q= 9$ or $q \geq 5$ a Fermat prime. The latter possibillity does occur as is shown in [Nag1, BS]. As corollaries we obtain versions of Sylow's, Lagrange's and Hall's Theorems for loops.

Explore related subjects

Keep this discovery

BibTeXRIS

Barbara Baumeister, Alexander Stein. 2010-07-14. The finite Bruck Loops. https://arxiv.org/abs/0908.2597

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