Search arXivSearch

arXiv · math/0401193

Finite Bruck Loops

Abstract

A loop $(X,\circ)$ is said to be a Bruck loop if it satisfies the (right) Bol identity $((z\circ x)\circ y)\circ x = z\circ ((x\circ y)\circ x)$ and the automorphic inverse property $(x\circ y)^{-1}=x^{-1}\circ y^{-1}$. If $X$ is a finite Bruck loop and $G$ is the group generated by all right translations $R(x): y\mapsto y\circ x$, then we show that $X$ and $G$ are central products $X = O^{2'}(X) * O(X)$ and $G = O^{2'}(G) * O(G)$, where $O^{2'}(X)$ ($O^{2'}(G)$) is the subloop (subgroup) generated by all 2-elements, and $O(X)$ ($O(G)$) is the largest normal subloop (subgroup) of odd order. In particular, if $X$ is solvable, then these central products are direct products. We also give a set of necessary conditions that must hold for a finite Bruck loop $X$ to be nonsolvable but have each proper section solvable; in particular, $X$ must be simple and consist of 2-elements, while the quotient of $G$ by its largest normal 2-subgroup must be isomorphic to $PGL_2(q)$, with $q=2^n+1\geq 5$.

Explore related subjects

Keep this discovery

BibTeXRIS

Michael Aschbacher, Michael K. Kinyon, J. D. Phillips. 2004-01-16. Finite Bruck Loops. https://arxiv.org/abs/math/0401193

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