Abstract

We study the right and left commutation semigroups of finite metacyclic groups with trivial centre. These are presented $$\begin{aligned} G(m,n,k) = \left\langle {a,b;{a^m} = 1,{b^n} = 1,{a^b} = {a^k}} \right\rangle \quad (m,n,k\in {\mathbb {Z}}^+) \end{aligned}$$with $$(m,k - 1) = 1$$ and $$n = \mathrm {ind}_m(k),$$ the smallest positive integer for which $${k^n} = 1\,\pmod m,$$ with the conjugate of a by b written $${a^b} = {b^{ - 1}}ab.$$ The right and left commutation semigroups ofG, denoted $$\mathrm{P}(G)$$ and $$\Lambda (G),$$ are the semigroups of mappings generated by $$\rho (g):G \rightarrow G$$ and $$\lambda (g):G \rightarrow G$$ defined by $$(x)\rho (g) = [x,g]$$ and $$(x)\lambda (g) = [g,x],$$ where the commutator of g and h is defined as $$[g,h] = {g^{ - 1}}{h^{ - 1}}gh.$$ This paper builds on a previous study of commutation semigroups of dihedral groups conducted by the authors with C. Levy. Here we show that a similar approach can be applied to G, a metacyclic group with trivial centre. We give a construction of $$\mathrm{P}(G)$$ and $$\Lambda (G)$$ as unions of containers, an idea presented in the previous paper on dihedral groups. In the case that $$\left\langle a \right\rangle$$ is cyclic of order p or $${p^2}$$ or its index is prime, we show that both $$\mathrm{P}(G)$$ and $$\Lambda (G)$$ are disjoint unions of maximal containers. In these cases, we give an explicit representation of the elements of each commutation semigroup as well as formulas for their exact orders. Finally, we extend a result of J. Countryman to show that, for G(m, n, k) with m prime, the condition $$\left| {\mathrm{P}(G)} \right| = \left| {\Lambda (G)} \right|$$ is equivalent to $$\mathrm{P}(G) = \Lambda (G).$$

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.