SearcharxivSearch

arXiv · 1207.4230

Multiplication groups and inner mapping groups of Cayley-Dickson loops

Abstract

The Cayley-Dickson loop Q_n is the multiplicative closure of basic elements of the algebra constructed by n applications of the Cayley-Dickson doubling process (the first few examples of such algebras are real numbers, complex numbers, quaternions, octonions, sedenions). We establish that the inner mapping group Inn(Q_n) is an elementary abelian 2-group of order 2^(2^n-2) and describe the multiplication group Mlt(Q_n) as a semidirect product of Inn(Q_n)xZ_2 and an elementary abelian 2-group of order 2^n. We prove that one-sided inner mapping groups Inn_l(Q_n) and Inn_r(Q_n) are equal, elementary abelian 2-groups of order 2^(2^(n-1)-1). We establish that one-sided multiplication groups Mlt_l(Q_n) and Mlt_r(Q_n) are isomorphic, and show that Mlt_l(Q_n) is a semidirect product of Inn_l(Q_n)xZ_2 and an elementary abelian 2-group of order 2^n.

Explore related subjects

Keep this discovery

BibTeXRIS

Jenya Kirshtein. 2012-07-17. Multiplication groups and inner mapping groups of Cayley-Dickson loops. https://arxiv.org/abs/1207.4230

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