SearcharxivSearch

arXiv · 2207.06582

Parastrophes and Cosets of Soft Quasigroups

Abstract

This paper introduced the concept of soft quasigroup, its parastrophes, soft nuclei, left (right) coset, distributive soft quasigroups and normal soft quasigroups. Necessary and sufficient conditions for a soft set over a quasigroup (loop) to be a soft quasigroup (loop) were established. It was proved that a soft set over a group is a soft group if and only if it is a soft loop or either of two of its parastrophes is a soft groupoid. For a finite quasigroup, it was shown that the orders (arithmetic and geometric means) of the soft quasigroup over it and its parastrophes are equal. It was also proved that if a soft quasigroup is distributive, then all its parastrophes are distributive, idempotent and flexible soft quasigroups. For a distributive soft quasigroup, it was shown that its left and right cosets form families of distributive soft quasigroups that are isomorphic. If in addition, a soft quasigroup is normal, then its left and right cosets forms families of normal soft quasigroups. On another hand, it was found that if a soft quasigroup is a normal and distributive soft quasigroup, then its left (right) quotient is a family of commutative distributive quasigroups which have a 1-1 correspondence with the left (right) coset of the soft quasigroup.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Anthony Oyem, Temitope Gbolahan Jaiyeola. 2022-07-14. Parastrophes and Cosets of Soft Quasigroups. https://arxiv.org/abs/2207.06582

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