SearcharxivSearch

arXiv · math/0601363

When is the commutant of a Bol loop a subloop?

Abstract

A left Bol loop is a loop satisfying $x(y(xz)) = (x(yx))z$. The commutant of a loop is the set of elements which commute with all elements of the loop. In a finite Bol loop of odd order or of order $2k$, $k$ odd, the commutant is a subloop. We investigate conditions under which the commutant of a Bol loop is not a subloop. In a finite Bol loop of order relatively prime to 3, the commutant generates an abelian group of order dividing the order of the loop. This generalizes a well-known result for Moufang loops. After describing all extensions of a loop $K$ such that $K$ is in the left and middle nuclei of the resulting loop, we show how to construct classes of Bol loops with non-subloop commutant. In particular, we obtain all Bol loops of order 16 with non-subloop commutant.

Explore related subjects

Keep this discovery

BibTeXRIS

Michael K. Kinyon, J. D. Phillips, Petr Vojtěchovský. 2006-01-14. When is the commutant of a Bol loop a subloop?. https://arxiv.org/abs/math/0601363

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