SearcharxivSearch

arXiv · math/0412390

C-loops: extensions and constructions

Abstract

C-loops are loops satisfying the identity $x(y\cdot yz) = (xy\cdot y)z$. We develop the theory of extensions of C-loops, and characterize all nuclear extensions provided the nucleus is an abelian group. C-loops with central squares have very transparent extensions; they can be built from small blocks arising from the underlying Steiner triple system. Using these extensions, we decide for which abelian groups $K$ and Steiner loops $Q$ there is a nonflexible C-loop $C$ with center $K$ such that $C/K$ is isomorphic to $Q$. We discuss possible orders of associators in C-loops. Finally, we show that the loops of signed basis elements in the standard real Cayley-Dickson algebras are C-loops.

Explore related subjects

Keep this discovery

BibTeXRIS

Michael K. Kinyon, J. D. Phillips, Petr Vojtěchovský. 2004-12-19. C-loops: extensions and constructions. https://arxiv.org/abs/math/0412390

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