SearcharxivSearch

arXiv · math/0701711

C-loops: An introduction

Abstract

C-loops are loops satisfying $x(y(yz))=((xy)y)z$. They often behave analogously to Moufang loops and they are closely related to Steiner triple systems and combinatorics. We initiate the study of C-loops by proving: (i) Steiner loops are C-loops, (ii) C-loops are alternative, inverse property loops with squares in the nucleus, (iii) the nucleus of a C-loop is a normal subgroup, (iv) C-loops modulo their nucleus are Steiner loops, (v) C-loops are power associative, power alternative but not necessarily diassociative, (vi) torsion commutative C-loops are products of torsion abelian groups and torsion commutative 2-C-loops; and several other results. We also give examples of the smallest nonassociative C-loops, and explore the analogy between commutative C-loops and commutative Moufang loops.

Explore related subjects

Keep this discovery

BibTeXRIS

J. D. Phillips, Petr Vojtěchovský. 2007-01-24. C-loops: An introduction. https://arxiv.org/abs/math/0701711

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