SearcharxivSearch

arXiv · 0902.1062

Bruck decomposition for endomorphisms of quasigroups

Abstract

In the year 1944 R. H. Bruck has described a very general construction method which he called the extension of a set by a quasigroup. We use it to construct a class of examples for LF-quasigroups in which the image of the map $e(x)=x\backslash x$ is a group. More generally, we consider the variety of quasigroups which is defined by the property that the map $e$ is an endomorphism and its subvariety where the image of the map $e$ is a group. We characterize quasigroups belonging to these varieties using their Bruck decomposition with respect to the map $e$.

Explore related subjects

Keep this discovery

BibTeXRIS

P. T. Nagy, P. Plaumann. 2009-04-30. Bruck decomposition for endomorphisms of quasigroups. https://arxiv.org/abs/0902.1062

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