Search arXivSearch

arXiv · 1809.09418

Connections between properties of the additive and the multiplicative groups of a two-sided skew brace

Abstract

We study relations between the additive and the multiplicative groups of a two-sided skew brace. In particular, we prove that if the additive group of a two-sided skew brace is finite solvable (respectively, finitely generated nilpotent, finitely generated residually nilpotent, finitely generated residually finite), then the multiplicative group of this skew brace is solvable (respectively, solvable, residually solvable, residually finite). Also, we prove that if the multiplicative group of a two-sided skew brace is nilpotent of nilpotency class $k$, then the additive group of this skew brace is solvable of class at most $2k$. The letter result generalizes the result of Byott which says that if the multiplicative group of a finite skew brace is abelian, then the additive group of this skew brace is solvable. In addition, we solve two problems (Problem 19.49 and Problem 19.90(a)) concerning skew braces which are formulated in the Kourovka notebook.

Explore related subjects

Keep this discovery

BibTeXRIS

T. Nasybullov. 2018-09-25. Connections between properties of the additive and the multiplicative groups of a two-sided skew brace. https://arxiv.org/abs/1809.09418

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