SearcharxivSearch

arXiv · 1308.2691

Constructing Double Magma with Commutation Operations

Abstract

A double magma is a nonempty set with two binary operations satisfying the interchange law. We call a double magma proper if the two operations are distinct and commutative if the operations are commutative. A double semigroup is a double magma for which both operations are associative. Given a group G we define a double magma (G,*,#) with the commutator operations x * y = [x,y] (= x^-1y^-1xy) and x # y = [y,x]. We show that (G,*,#) is a double magma if and only if G satisfies the commutator laws [x,y;x,z]=1 and [w,x;y,z]^2 = 1. Note that the first law defines the variety of 3-metabelian groups. If both these laws hold in G, (G,*,#) is proper if and only if G contains a commutator whose square is nontrivial. B.H. Neumann has given an example of such a group which is not metabelian; thus the associated double magma is proper and produces an example with some complexity. The double magma (G,*,#) is a double semigroup if and only if G is nilpotent of class 2. In this case, (G,*,#) is a proper double semigroup if and only if G contains a commutator whose square is nontrivial. We construct a specific example letting G be the dihedral group of order 16. In addition we comment on a similar construction for rings using Lie commutators.

Explore related subjects

Keep this discovery

BibTeXRIS

Charles C. Edmunds. 2013-08-12. Constructing Double Magma with Commutation Operations. https://arxiv.org/abs/1308.2691

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